ACM Transactions on Computational Logic (TOCL)
Accepted Papers, 2005
Volume 6, Number 1 (January 2005)
Volume 6, Number 2 (April 2005)
-
Induction from Answer Sets in Nonmonotonic Logic Programs,
Chiaki Sakama
-
Complexity of Nested Circumscription and Nested Abnormality Theories,
Marco Cadoli, Thomas Eiter and Georg Gottlob
-
From Linear Time to Branching Time,
Orna Kupferman and Moshe Vardi
-
Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs,
Kewen Wang and Lizhi Zhou
-
Equivalences Among Aggregate Queries with Negation,
Sara Cohen, Werner Nutt and Yehoshua Sagiv
-
Knuth-Bendix Constraint Solving Is NP-Complete,
Konstantin Korovin and Andrei Voronkov
-
Reasoning about Evolving Nonmonotonic Knowledge Bases,
Thomas Eiter, Michael Fink, Giuliana Sabbatini and Hans Tompits
-
Minimum Model Semantics for Logic Programs with Negation-as-Failure,
Panos Rondogiannis and William W. Wadge
-
An Elementary Fragment of Second-Order Lambda Calculus
K. Aehlig and J. Johannsen
Volume 6, Number 3 (July 2005)
Volume 6, Number 4 (October 2005)
Editorial, Krzysztof R. Apt
Editorial, Phokion Kolaitis
Regular Papers
Back to home page