• TPLP regular papers
• Transactions On Computational Logic (TOCL) regular papers

Regular Papers

• Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Answer Set Programming Phan Huy Tu, Tran Cao Son, and Chitta Baral
  
• Updates in Answer Set Programming: An Approach Based on Basic Structural Properties, Mauricio Osorio and V\'ictor Cuevas
  
• Fast Frequent Querying with Lazy Control Flow Compilation Remko Tron\c{c}on, Gerda Janssens, Bart Demoen, Henk Vandecasteele
  

Book review

• Explanatory Nonmonotonic Reasoning by Alexander Bochman World Scientific, Hardback: ISBN 981-256-101-3 Victor W. Marek
  
  

Regular Papers

•  Incremental copying garbage collection for WAM-based Prolog systems , Ruben Vandeginste, Bart Demoen.
• Constraint Functional Logic Programming over Finite Domains, Antonio J. Fernàndez, Teresa Hortalà-Gonzàlez, Fernando Sàenz-Pèrez and Rafael del Vado-Vìrseda.
• Decomposable Theories Khalil Djelloul

Regular Papers

•  PALS: Efficient or-Parallelism on Beowulf clusters Enrico Pontelli, Karen Villaverde, Hai-Feng Guo, Gopal Gupta
• Automated verification of weak equivalence within the smodels system, Tomi Janhunen and Emilia Oikarinen

• Propositional theories are strongly equivalent to logic programs Pedro Cabalar and Paolo Ferraris
  

Regular Papers

• Calculating modules in contextual logic program refinement, Robert Colvin, Ian J. Hayes and Paul Strooper
• Improving Precision of Type Analysis Using Non-Discriminative Union , Lunjin Lu.
• Linear Tabling Strategies and Optimizations Neng-Fa Zhou, Taisuke Sato, and Yi-Dong Shen

• Recurrence with affine level mappings is P-time decidable for binary CLP(R) Fred Mesnard and Alexander Serebrenik

• Logic programming with satisfiability Michael Codish, Vitaly Lagoon and Peter J. Stuckey

Accepted Regular Papers

• Experimenting with recursive queries in database and logic programming systems , Giorgio Terracina, Nicola Leone, Vincenzino Lio, Claudio Panetta
  
• Logic programs with monotone abstract constraint atoms, Victor Marek, lkka Niemela, and Mirek Truszczynski
  
• Updates in Answer Set Programming: An Approach Based on Basic Structural Properties, Mauricio Osorio and V\'ictor Cuevas
  

Accepted Technical Note

• Fast Frequent Querying with Lazy Control Flow Compilation Remko Tron\c{c}on, Gerda Janssens, Bart Demoen, Henk Vandecasteele
  
• Improving Prolog programs: Refactoring for Prolog Alexander Serebrenik, Tom Schrijvers and Bart Demoen

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.

• A Game-Based Framework for CTL Counterexamples and 3-Valued Abstraction-Refinement Sharon Shoham and Orna Grumberg (Electronic Appendix)
• A Formally Verified Proof of the Prime Number Theorem Jeremy Avigad, Kevin Donnelly, David Gray and Paul Raff
• Polymorphic Type Inference for the Named Nested Relational Calculus Jan Van den Bussche and Stijn Vansummeren
• Predicate Abstraction with Indexed Predicates Shuvendu Lahiri and Randal Bryant
• Verifying Nondeterministic Probabilistic Channel Systems Against Omega-Regular Linear-Time Properties Christel Baier, Nathalie Bertrand and Philippe Schnoebelen
• A Concrete Framework for Environment Machines Malgorzata Biernacka and Olivier Danvy
• Outlier Detection by Logic Programming Fabrizio Angiulli, Gianluigi Greco and Luigi Palopoli (Electronic Appendix)

• A Comprehensive Combination Framework Silvio Ghilardi, Enrica Nicolini and Daniele Zucchelli
• Coordination in Answer Set Programming Chiaki Sakama and Katsumi Inoue
• Alternating Timed Automata Slawomir Lasota and Igor Walukiewicz
• Bounds on the Automata Size for Presburger Arithmetic Felix Klaedtke
• Durations and Parametric Model-Checking in Timed Automata Véronique Bruyère, Emmanuel Dall'Oli and Jean-Francois Raskin
• First-order Complete and Computationally Complete Query Languages for Spatio-Temporal Databases Sofie Haesevoets, Floris Geerts and Bart Kuijpers
• A Logic for Non-Monotone Inductive Definitions Marc Denecker and Eugenia Ternovska

• A Uniform Approach to Constraint-solving for Lists, Multisets, Compact Lists, and Sets Agostino Dovier, Carla Piazza, and Gianfranco Rossi
• Foundational Certified Code in the Twelf Metalogical Framework Karl Crary and Susmit Sarkar
• Inferring Non-Suspension Conditions for Logic Programs with Dynamic Scheduling Samir Genaim and Andy King
• Program Termination and Well Partial Orderings Andreas Blass and Yuri Gurevich
• Abstract State Machines Capture Parallel Algorithms: Correction and Extension Andreas Blass and Yuri Gurevich
• What Causes a System to Satisfy a Specification? Hana Chockler, Joseph Y. Halpern and Orna Kupferman
• Proof Search in Hajek's Basic Logic Simone Bova and Franco Montagna
• Conjunctive Query Containment and Answering under Description Logics Constraints Diego Calvanese, Giuseppe De Giacomo and Maurizio Lenzerini
• Contextual Modal Type Theory Aleksandar Nanevski, Frank Pfenning and Brigitte Pientka
• Complexity Results for Security Protocols with Diffie-Hellman Exponentiation and Commuting Public Key Encryption Yannick Chevalier, Ralf Kuesters, Michael Rusinowitch and Mathieu Turuani
• Undecidability of the Unification and Admissibility Problems for Modal and Description Logics Frank Wolter and Michael Zakharyaschev
• Open Answer Set Programming with Guarded Programs Stijn Heymans, Davy Van Nieuwenborgh and Dirk Vermeir
• Reasoning with Recursive Loops under the PLP Framework Yi-Dong Shen
• Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying Helmut Seidl and Kumar Neeraj Verma
• Verifiable Agent Interaction in Abductive Logic Programming: the SCIFF Framework Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello and Paolo Torroni
• Specifying Norm-Governed Computational Societies Alexander Artikis, Marek Sergot and Jeremy Pitt
• Arithmetic Complexity Lou van den Dries and Yiannis N. Moschovakis
• Certainty Closure: Reliable Constraint Reasoning with Incomplete or Erroneous Data Neil Yorke-Smith and Carmen Gervet
• New Results on Rewrite-based Satisfiability Procedures Alessandro Armando, Maria Paola Bonacina, Silvio Ranise and Stephan Schulz
• Reasoning about Actions with Sensing under Qualitative and Probabilistic Uncertainty Luca Iocchi, Thomas Lukasiewicz, Daniele Nardi and Riccardo Rosati
• A Finite Equational Base for CCS with Left Merge and Communication Merge Luca Aceto, Wan Fokkink, Anna Ingolfsdottir and Bas Luttik
• Logical Characterization of the Counting Hierarchy Juha Kontinen
• The Geometry of Linear Higher-Order Recursion Ugo Dal Lago
• Probabilistic Bisimulation as a Congruence Ruggero Lanotte and Simone Tini
• Extending the LOOP language with Higher-Order Procedural Variables T. Crolard, E. Polonowski and P. Valarcher
• Termination of Rewriting Strategies: a Generic Approach Isabelle Gnaedig and Hélène Kirchner (Electronic Appendix)
• A Compositional Semantics for CHR Maurizio Gabrielli and Maria Chiara Meo
• Proofs, Tests and Continuation Passing Style Stefano Guerrini and Andrea Masini