vg TOCL: Accepted Papers

ACM Transactions on Computational Logic (TOCL)

Accepted Papers

The files below are the final versions of the papers submitted by the authors. The definite, published versions of the papers are available from the TOCL home page within the ACM Digital Library.

Volume 1, 2000

Volume 2, 2001

Volume 3, 2002

Volume 4, 2003

Volume 5, 2004

Volume 6, 2005

Volume 7, 2006

Volume 8, 2007

Volume 9, 2008

Volume 10, 2009

Volume 11, 2010

Volume 12, 2011

Volume 13, Number 1

Robust Vacuity for Branching Temporal Logic Arie Gurfinkel and Marsha Chechik
Least and greatest fixed points in linear logic David Baelde
Topological and simplicial models of identity types Benno van den Berg and Richard Garner
Succinctness of the complement and intersection of regular expressions Wouter Gelade and Frank Neven
The complexity of positive first-order logic without equality Florent Madelaine and Barnaby Martin
On the Expressive Power of Multiple Heads in CHR Cinzia Di Giusto, Maurizio Gabbrielli and Maria Chiara Meo
Reachability Problems in Piecewise FIFO Systems Naghmeh Ghafari, Arie Gurfinkel, Nils Klarlund and Richard Trefler
Structural Analysis of Boolean Equation Systems Jeroen Keiren, Michel A. Reniers, and Tim A.C. Willemse
The Complexity of Proving the Discrete Jordan Curve Theorem Phuong Nguyen and Stephen Cook

Volume 13, Number 2

Nominal Unification from a Higher-Order Perspective Jordi Levy and Mateu Villaret
Interactive Realizers: A New Approach to Program Extraction from Nonconstructive Proofs Stefano Berardi and Ugo de'Liguoro
Model Checking of Recursive Probabilistic Systems Kousha Etessami and Mihalis Yannakakis (Electronic Appendix)
Annotated Probabilistic Temporal Logic: Approximate Fixpoint Implementation Paulo Shakarian, Gerardo I. Simari and V.S. Subrahmanian (Electronic Appendix)
Simplification Rules for Intuitionistic Propositional Tableaux Mauro Ferrari, Camillo Fiorentini and Guido Fiorino
Complexity of Data Dependence problems for Program Schemas with Concurrency Sebastian Danicic, Robert M Hierons and Michael R Laurence
On the Relative Strength of Pebbling and Resolution Jakob Nordström
The Complexity of Reasoning for Fragments of Autoepistemic Logic Nadia Creignou, Arne Meier, Michael Thomas and Heribert Vollmer
An Implicit Characterization of PSPACE Marco Gaboardi, Jean-Yves Marion and Simona Ronchi Della Rocca

Volume 13, Number 3 (tentative)

The Dynamic Complexity of Formal Languages Wouter Gelade, Marcel Marquardt, and Thomas Schwentick
Permissive-Nominal Logic Gilles Dowek and Murdoch Gabbay
LTL over Description Logic Axioms Franz Baader, Silvio Ghilardi and Carsten Lutz
Calculus of Cooperation and Game-Based Reasoning about Protocol Privacy Sara Miner More and Pavel Naumov
Deductive Inference for the Interiors and Exteriors of Horn Theories Kazuhisa Makino and Hirotaka Ono
Arithmetic Complexity via Effective Names for Random Sequences Bjorn Kjos-Hanssen, Frank Stephan, Jason R. Teutsch
Graded Computation Tree Logic Alessandro Bianco, Fabio Mogavero and Aniello Murano
Well Structured Program Equivalence Is Highly Undecidable Robert Goldblatt and Marcel Jackson
Algorithmic Analysis of Array-Accessing Programs Rajeev Alur, Pavol Cerny and Scott Weinstein

Volume 13, Number 4 (tentative)

Epistemic Strategies and Games on Concurrent Processes Konstantinos Chatzikokolakis, Sophia Knight, Catuscia Palamidessi and Prakash Panangaden
Translating to Co-Büchi Made Tight, Unified, and Useful Udi Boker and Orna Kupferman
Maps in Multiple Belief Change Pavlos Peppas, Costas D. Koutras, and Mary-Anne Williams
Hierarchies in Dependence Logic Arnaud Durand and Juha Kontinen
A Generalized QSQR Evaluation Method for Horn Knowledge Bases Ewa Madalinska-Bugaj and Linh Anh Nguyen
Fuzzy Equilibrium Logic: Declarative Problem Solving in Continuous Domains Steven Schockaert, Jeroen Janssen, and Dirk Vermeir (Electronic Appendix)
Decidability of downward XPath Diego Figueira
Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction Hariolf Betz and Thom Fruehwirth
Complexities of Horn Description Logics Markus Kroetzsch, Sebastian Rudolph, and Pascal Hitzler

Volume 14, Number 1 (tentative)

Computing Loops with at Most One External Support Rule Xiaoping Chen, Jianmin Ji, and Fangzhen Lin
YAPA: A Generic Tool for Computing Intruder Knowledge Veronique Cortier, Mathieu Baudet, and Stephanie Delaune
Proof Nets for Herbrand's Theorem Richard McKinley
Non-deterministic Phase Semantics and the Undecidability of Boolean BI Dominique Larchey-Wendling and Didier Galmiche
Sound and Complete Axiomatisations of Coalgebraic Language Equivalence Marcello Bonsangue, Stefan Milius, and Alexandra Silva
A Model-theoretic Approach to Belief Change in Answer Set Programming James Delgrande, Torsten Schaub, Hans Tompits, and Stefan Woltran
Tableau Calculi for Logic Programs under Answer Set Semantics Martin Gebser and Torsten Schaub (Electronic Appendix)
First-Order Logic on Higher-Order Nested Pushdown Trees Alexander Kartzow

Future Issues (the order of the papers can change)

Fair Synthesis for Asynchronous Distributed Systems Paul Gastin and Nathalie Sznajder
Query-driven Procedures for Hybrid MKNF Knowledge Bases Jose Julio Alferes, Mathias Knorr, and Terrance Swift
Using Generalized Annotated Programs to Solve Social Network Optimization Problems Paulo Shakarian, Matthias Broecheler, V.S. Subrahmanian, and Cristian Molinaro
Instantiation Schemes for Nested Theories Mnacho Echenim and Nicolas Peltier
Constraint Propagation for First-Order Logic and Inductive Definitions Johan Wittocx, Marc Denecker and Maurice Bruynooghe

Back to home page