ACM Transactions on Computational Logic (TOCL), Volume 3

Volume 3, Number 1, January 2002

Gerald Lüttgen, Michael Mendler:
The intuitionism behind Statecharts steps. 1-41
Georg Gottlob, Erich Grädel, Helmut Veith:
Datalog LITE: a deductive query language with linear time model checking. 42-79
Raymond McDowell, Dale Miller:
Reasoning with higher-order abstract syntax in a logical framework. 80-136
Andrea Asperti, Luca Roversi:
Intuitionistic Light Affine Logic. 137-175

Francesco M. Donini, Daniele Nardi, Riccardo Rosati:
Description logics of minimal knowledge and negation as failure. 177-225
Piero A. Bonatti, Nicola Olivetti:
Sequent calculi for propositional nonmonotonic logics. 226-278
J. V. Tucker, Jeffery I. Zucker:
Abstract computability and algebraic specification. 279-333

Martín Abadi, Leonid Libkin, Frank Pfenning:
Editorial. 335-335
Martin Grohe, Luc Segoufin:
On first-order topological queries. 336-358
Vincent Danos, Russell Harmer:
Probabilistic game semantics. 359-382
Klaus Aehlig, Helmut Schwichtenberg:
A syntactical analysis of non-size-increasing polynomial time computation. 383-401
Samuel R. Buss, Bruce M. Kapron:
Resource-bounded continuity and sequentiality for type-two functionals. 402-417
Erich Grädel, Colin Hirsch, Martin Otto:
Back and forth between guarded and modal logics. 418-463

Mario Bravetti, Roberto Gorrieri:
Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement. 465-520
Robert Givan, David A. McAllester:
Polynomial-time computation via local inference relations. 521-541
Michael Kaminski, Guy Rey:
Revisiting quantification in autoepistemic logic. 542-561
Viviana Bono, Michele Bugliesi, Silvia Crafa:
Typed interpretations of extensible objects. 562-603
Randal E. Bryant, Miroslav N. Velev:
Boolean satisfiability with transitivity constraints. 604-627

Last update Sat May 25 17:01:42 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page