ACM Transactions on Computational Logic (TOCL)

Accepted Papers, 2005

Volume 6, Number 1 (January 2005)

A Classification of Symbolic Transition Systems, T.A. Henzinger, R. Majumdar and J.-F. Raskin
Making Abstract Domains Condensing, R. Giacobazzi, F. Ranzato and F. Scozzari
On Equivalence and Canonical Forms in the LF Type Theory, Robert Harper and Frank Pfenning
A New Decidability Technique for Ground Term Rewriting Systems with Applications, Rakesh Verman and Ara Hayrapetyan
A Modal Logic Framework for Multi-agent Belief Fusion, Churn-Jung Liau
Eternity Variables to Prove Simulation of Specifications, Wim H. Hesselink

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)

Datalog Programs and their Persistency Numbers Foto Afrati, Stavros Cosmadakis and Eugenie Foustoucos
On the Complexity of the Disjunction Property in Intuitionistic and Modal Logics Mauro Ferrari, Camillo Fiorentini and Guido Fiorino
Disjunction and Modular Goal-directed Proof Search Matthew Stone
Sequent and Hypersequent Calculi for Lukasiewicz and Abelian Logics George Metcalfe, Nicola Olivetti, and Dov Gabbay
An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables Bernard Boigelot, Sebastien Jodogne and Pierre Wolper
Arithmetic, First-Order Logic, and Counting Quantifiers Nicole Schweikardt

Volume 6, Number 4 (October 2005)

Editorial, Krzysztof R. Apt
Editorial, Phokion Kolaitis

Regular Papers

Automatic Linear Orders and Trees B. Khussainov, S. Rubin and F. Stephan
About the Indecidability of Program Equivalence in Finitary Languages with States A. Murawski
Convergence Law for Random Graphs with Specified Degree Sequence J. Lynch
A Proof Theory for Generic Judgments D. Miller and A. Tiu
Proof Nets for Unit-Free Multiplicative-Additive Linear Logic D. Hughes and R. Van Glabbeek

Back to home page