ACM Transactions on Computational Logic (TOCL)

Accepted Papers, 2002

Volume 3, Number 1 (January 2002)

The Intuitionism Behind Statecharts Steps, Gerald Luettgen and Michael Mendler
Datalog LITE: A Deductive Query Language with Linear Time Model Checking, Georg Gottlob, Erich Grädel and Helmut Veith
Reasoning with Higher-Order Abstract Syntax in a Logical Framework, Raymond McDowell and Dale Miller
Intuitionistic Light Affine Logic, Andrea Asperti and Luca Roversi

Volume 3, Number 2 (April 2002)

Description Logics of Minimal Knowledge and Negation as Failure, Francesco M. Donini, Daniele Nardi and Riccardo Rosati
Sequent Calculi for Propositional Nonmonotonic Logics, Piero Bonatti and Nicola Olivetti
Abstract Computability, Algebraic Specification and Initiality, J.V. Tucker and J.I. Zucker

Volume 3, Number 3 (July 2002)

Editorial, Martin Abadi, Leonid Libkin and Frank Pfenning

Regular Papers

On first-order topological queries, Martin Grohe and Luc Segoufin
Probabilistic Game Semantics, Vincent Danos and Russell Harmer
A syntactical analysis of non-size-increasing polynomial time computations, Klaus Aehlig and Helmut Schwichtenberg
Resource-bounded continuity and sequentiality for type-two functionals, Samuel R. Buss and Bruce Kapron
Back and Forth Between Guarded and Modal Logics, Erich Grädel, Colin Hirsch and Martin Otto

Volume 3, Number 4 (October 2002)

Deciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement, Mario Bravetti and Roberto Gorrieri
Polynomial-time Computation via Local Inference Relations, Robert Givan and David McAllester
Revisiting quantification in autoepistemic logic, Michael Kaminski and Guy Rey
Typed Interpretations of Extensible Objects, Viviana Bono, Michele Bugliesi and Silvia Crafa
Boolean Satisfiability with Transitivity Constraints, Randal E. Bryant and Miroslav N. Velev

Back to home page