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 14, Number 1

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
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

Volume 14, Number 2

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
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
Parallel Abductive Query Answering in Probabilistic Logic Programs Gerardo Simari, John Dickerson, Amy Sliva, and V.S. Subrahmanian
Topological logics with connectedness over Euclidean spaces Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, and Michael Zakharyaschev

Volume 14, Number 3 (tentative)

Constraint Propagation for First-Order Logic and Inductive Definitions Johan Wittocx, Marc Denecker and Maurice Bruynooghe (Electronic Appendix)
Translating to Co-Büchi Made Tight, Unified, and Useful Udi Boker and Orna Kupferman
Common Knowledge in Email Exchanges Floor Sietsma and Krzysztof Apt
Parameterized Complexity of DPLL Search Procedures Olaf Beyersdorff, Nicola Galesi, and Lauria, Massimo
Graph Reachability and Pebble Automata over Infinite Alphabets Tony Tan
Extensional Higher-Order Logic Programming A. Charalambidis, K. Handjopoulos, P. Rondogiannis, and W. W. Wadge
On the Inference of Resource Usage Upper and Lower Bounds Elvira Albert, Samir Genaim, and Abu Naser Masud
Propositional update operators based on formula/literal dependence Andreas Herzig, Jérôme Lang, and Pierre Marquis

Future Issues (the order of the papers can change)

Does Treewidth Help in Modal Satisfiability? Manjunatha Praveen
Enumeration of monadic second-order queries on trees Wojciech Kazana and Luc Segoufin
Computing Persistent Homology within Coq/SSReflect Jónathan Heras, Thierry Coquand, Anders Mörtberg, and Vincent Siles
A Unified Semantic Framework for Fully-structural Propositional Sequent Systems Ori Lahav and Arnon Avron
Logical Foundations for More Expressive Declarative Temporal Logic Programming Languages Jose Gaintzarain and Paqui Lucio
Three Syntactic Theories for Combinatory Graph Reduction Olivier Danvy, Ian Zenry (Electronic Appendix)
Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets Manuel Bodirsky, H. Dugald Macpherson, and Johan Thapper
Least Upper Bounds on the Size of Confluence and Church-Rosser Diagrams in Term Rewriting and λ-Calculus Jeroen Ketema and Jakob Grue Simonsen
A PSPACE-Complete First Order Fragment of Computability Logic Matthew S. Bauer
Logical Relations for a Logical Framework Florian Rabe and Kristina Sojakova
Verification of Linear Duration Properties over Continuous Time Markov Chains Taolue Chen, Marco Diciolla, Marta Kwiatkowska, and Alexandru Mereacre
Improved Witnessing and Local Improvement Principles for Second-Order Bounded Arithmetic Arnold Beckmann and Samuel R. Buss
Algebra, Proof Theory and Applications for an Intuitionistic Logic of Propositions, Actions and Adjoint Modal Operators Roy Dyckhoff, Mehrnoosh Sadrzadeh, and Julien Truffaut
Algebra-Coalgebra Duality in Brzozowski's Minimization Algorithm Filippo Bonchi, Marcello Bonsangue, Helle Hvid Hansen, Prakash Panangaden, Jan Rutten, and Alexandra Silva

Back to home page