arXiv 2001-09-02 EN Abstract Computability, Algebraic Specification and Initiality Tucker, J. V. · Zucker, J. I.
arXiv 2001-08-22 EN Convergent Approximate Solving of First-Order Constraints by Approximate Quantifiers Ratschan, Stefan
arXiv 2001-08-12 EN Abstract versus Concrete Computation on Metric Partial Algebras Tucker, J. V. · Zucker, J. I.
arXiv 2001-07-19 EN aspps --- an implementation of answer-set programming with propositional schemata Truszczynski, Deborah East. Miroslaw
arXiv 2001-07-19 EN Annotated revision programs Marek, Victor · Pivkina, Inna · Truszczynski, Miroslaw
arXiv 2001-07-19 EN Propositional satisfiability in answer-set programming East, Deborah · Truszczynski, Miroslaw
arXiv 2001-07-19 EN Fixed-parameter complexity of semantics for logic programs Lonc, Zbigniew · Truszczynski, Miroslaw
arXiv 2001-07-17 EN An interactive semantics of logic programming Bruni, Roberto · Montanari, Ugo · Rossi, Francesca
arXiv 2001-07-10 EN Transformations of CCP programs Etalle, Sandro · Gabbrielli, Maurizio · Meo, Maria Chiara
arXiv 2001-06-26 EN Inference of termination conditions for numerical loops Serebrenik, Alexander · De Schreye, Danny
arXiv 2001-06-25 EN Classes of Terminating Logic Programs Pedreschi, Dino · Ruggieri, Salvatore · Smaus, Jan-Georg
arXiv 2001-06-21 EN Expressing the cone radius in the relational calculus with real polynomial constraints Geerts, Floris
arXiv 2001-06-14 EN Solving equations in the relational algebra Biskup, Joachim · Paredaens, Jan · Schwentick, Thomas · Bussche, Jan Van den
arXiv 2001-06-14 EN Polymorphic type inference for the relational algebra Bussche, Jan Van den · Waller, Emmanuel
arXiv 2001-06-13 EN Complexity Results and Practical Algorithms for Logics in Knowledge Representation Tobies, Stephan
arXiv 2001-06-12 EN Building Views with Description Logics in ADE: Application Development Environment Ismailova, Larissa · Kosikov, Sergey · Zinchenko, Konstantin · Mikhaylov, Alexey +2
