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

• Special issue on constraint handling rules. Guest editors' introduction , Slim Abdennadher, Thom Fruehwirth, Christian Holzbaur. Vol 5(4&5) pp 401-402
• Automatic Generation of CHR Constraint Solvers, Slim Abdennadher and Christophe Rigotti. pp 403-418
  
• A CHR-based Implementation of Known Arc-Consistency, Marco Alberti, Marco Gavanelli, Evelina Lamma, Paola Mello, Michela Milano. pp 419-440
  
• Schedulers and redundancy for a class of constraint propagation rules, Sebastian Brand and Krzysztof R. Apt. pp 441-465
  
• CHR grammars, Henning Christiansen. pp 467-501
  
• Optimizing compilation of constraint handling rules in HAL, Christian Holzbaur, Maria Garcia de la Banda, Peter J. Stuckey, Gregory J. Duck. pp 503-531
  
• FLUX: A logic programming method for reasoning agents, Michael Thielscher. pp 533-565
  

Book reviews:

• Yves Deville: Concepts, Techniques, and Models of Computer Programming by Peter Van Roy and Seif Haridi, MIT Press, 2004, hard cover: ISBN 0-262-22069-5, xxvii + 900 pages, 55 US$ [html] [pdf] pp 595-600
  

Regular Papers

• Integrating design synthesis and assembly of structured objects in a visual design language, Omid Banyasad, Philip T. Cox. pp 601-622
• Checking modes of HAL progams , Maria Garcia de la Banda, Warwick Harvey, Kim Marriott, Peter J. Stuckey, Bart Demoen.pp 623-668
• Proving correctness and completeness of normal programs - a declarative approach, W{\l}odzimierz Drabent, Miros{\l}awa Mi{\l}kowska. pp 669-711
• Optimization of bound disjunctive queries with constraints , Gianluigi Greco, Sergio Greco, Irina Trubitsyna, Ester Zumpano.pp 713-745

Technical Note

• Normal forms for answer sets programming , Stefania Costantini and Alessandro Provetti. pp 747-760

Special Issues (to appear)

• Special issue on specification, analysis and verification of reactive systems. Guest editors' introduction , Giorgio Delzanno, Sandro Etalle, Maurizio Gabbrielli,
• State Space Computation and Analysis of Time Petri Nets , Guillaume Gardey and Olivier H. Roux and Olivier F. Roux,
• Equivalence-checking on infinite-state systems: Techniques and results , Antonin Kucera and Petr Jancar,
• Parametric Verification of a Group Membership Algorithm , Ahmed Bouajjani, Agathe Merceron,
• Automatic Verification of Timed Concurrent Constraint Programs , Moreno Falaschi and Alicia Villanueva

• Introduction to the special issue on multiparadigm languages and constraint programming , Moreno Falaschi and Michael Maher,
• Mapping fusion and synchronized hyperedge replacement into logic programming , Ivan Lanese and Ugo Montanari
• A comparison between two logical formalisms for rewriting, , Miguel Palomino
• Combining relational algebra, SQL, constraint modelling, and local search, , Marco Cadoli and Toni Mancini,
• Constraint-based automatic verification of abstract models of multitreaded programs, , Giorgio Delzanno
• Removing redundant arguments automatically , Mar\'{\i}a Alpuente, Santiago Escobar, and Salvador Lucas,
• Forward slicing of functional logic programs by partial evaluation, , Josep Silva and Germ\'an Vidal,
• Demand Analysis with Partial Predicates, , Julio Mari\~no, \'Angel Herranz and Juan Jos\'e Moreno-Navarro
• Integration of Declarative and Constraint Programming , Petra Hofstedt and Peter Pepper,

Accepted Regular Papers

• Planning with Preferences using Logic Programming , Tran Cao Son and Enrico Pontelli.
  
• Temporal Phylogenetic Networks and Logic Programming , Esra Erdem, Vladimir Lifschitz, and Don Ringe.
  
• Set Unification , Agostino Dovier, Enrico Pontelli, and Gianfranco Rossi.
  
• A three-valued semantics for logic programmers , Lee Naish.
  
• Epistemic Foundation of Stable Model Semantics , Yann Loyer and Umberto Straccia.
  
• Improving PARMA Trailing , Tom Schrijvers, Maria Garcia de la Banda, Bart Demoen, Peter J. Stuckey
  
• Programming Finite-Domain Constraint Propagators in Action Rules , Neng-Fa Zhou.
  
• Computing minimal models, stable models and answer sets , Zbigniew Lonc and Miroslaw Truszczynski.
  
• Preferred answer sets for ordered logic programs , Davy Van Nieuwenborgh, Dirk Vermeir.
  
• Intelligent search strategies based on adaptive Constraint Handling Rules, Armin Wolf.
  
• Stabilization of Cooperative Information Agents in Unpredictable Environment: A Logic Programming Approach, Phan Minh Dung, Do Duc Hanh, and Phan Minh Thang.
  
• EPspectra: A Formal Toolkit for Developing DSP Software Applications, Hahnsang Kim, Thierry Turletti, Amar Bouali.
  
• Towards Automated Integration of Guess and Check Programs in Answer Set Programming: A Meta-Interpreter and Applications, Thomas Eiter and Axel Polleres.
  
• Graphs and colorings for answer set programming, Kathrin Konczak and Thomas Linke and Torsten Schaub.
  
• On the existence of stable models of non-stratified logic programs, Stefania Costantini.
  
  

Accepted Technical Note

Accepted Programming Pearl

• Optimal Union-Find in Constraint Handling Rules , Tom Schrijvers, Thom Fruehwirth.
  

Accepted Book Review

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.

• Unfolding Partiality and Disjunctions in Stable Model Semantics T. Janhunen, I. Niemela, D. Seipel, P. Simons and J. You
• Predicate-Calculus Based Logics for Modeling and Solving Search Problems Deborah East and Mirek Truszczynski
• Complexity Results on DPLL and Resolution Paolo Liberatore
• Monodic Temporal Resolution Anatoly Degtyarev, Michael Fisher and Boris Konev
• Heterogeneous Temporal Probabilistic Agents Juergen Dix, Sarit Kraus and VS Subrahmanian

• Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations Russell Impagliazzo and Nathan Segerlind
• Optimizing Optimal Reduction: A Type Inference Algorithm for Elementary Affine Logic Paolo Coppola and Simone Martini
• Why Are There So Many Loop Formulas? Vladimir Lifschitz and Alexander Razborov
• Decidability Results for Sets with Atoms Agostino Dovier, Andrea Formisano and Eugenio Omodeo
• Propositional Computability Logic I Giorgi Japaridze
• Propositional Computability Logic II Giorgi Japaridze
• Ordinary Interactive Small-Step Algorithms I Andreas Blass and Yuri Gurevich

• Logic Program Based Updates Yan Zhang
• Fast Verification of MLL Proof Nets via IMLL A.S. Murawski and C.-H. L. Ong
• The DLV System for Knowledge Representation and Reasoning Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, and Francesco Scarcello
• Soft Concurrent Constraint Programming S. Bistarelli, U. Montanari, and F. Rossi
• Comprehending Software Correctness Implies Comprehending an Intelligence-Related Limitation Arthur Charlesworth
• A System of Interaction and Structure Alessio Guglielmi
• Domain-Dependent Knowledge in Answer Set Planning Tran Cao Son, Chitta Baral, Nam Tran, and Sheila McIlraith
• Defining Functions on Equivalence Classes Larry Paulson
• Extensional Equivalence and Singleton Types Christopher A. Stone and Robert Harper
• Compilability of Abduction Paolo Liberatore and Marco Schaerf
• Results on the Quantitative Mu-Calculus Annabelle McIver and Carroll Morgan
• Efficient Solving of Quantified Inequality Constraints over the Real Numbers Stefan Ratschan
• The Strength of Replacement in Weak Arithmetic Stephen Cook and Neil Thapen
• Splitting an Operator: Algebraic Modularity Results for Logics with Fixpoint Semantics Joost Vennekens, David Gilis and Marc Denecker
• Kleene Algebra with Domain J. Desharnais, B. Möller, G. Struth
• On Compositionality and its Limitations Alex Rabinovich
• Logical Characterizations of Heap Abstractions G. Yorsh, T. Reps, M. Sagiv and R. Wilhelm
• Abstract Canonical Inference Maria Paola Bonacina and Nachum Dershowitz
• Sound and Complete Elimination of Singleton Kinds Karl Crary
• Recycling Computed Answers in Rewrite Systems for Abduction Fangzhen Lin and Jia-Huai You
• Where Fail-Safe Default Logics Fail Paolo Liberatore
• Logical Definability and Query Languages over Ranked and Unranked Trees M. Benedikt, L. Libkin and F. Neven
• On Unification for Bounded Distributive Lattices Viorica Sofronie-Stokkermans
• The Arithmetical Complexity of Dimension and Randomness John M. Hitchcock, Jack H. Lutz, Sebastiaan A. Terwijn
• PELCR: Parallel Environment for Optimal Lambda Calculus Reduction M. Pedicini, F. Quaglia
• Ordinary Interactive Small-Step Algorithms II Andreas Blass and Yuri Gurevich
• Ordinary Interactive Small-Step Algorithms III Andreas Blass and Yuri Gurevich
• Semantical Characterizations and Complexity of Equivalences in Answer Set Programming Thomas Eiter, Michael Fink, and Stefan Woltran (Electronic Appendix)
• Paraconsistent Reasoning and Preferential Entailments by Signed Quantified Boolean Formulae Ofer Arieli
• The Axiomatic Translation Principle for Modal Logic Renate A. Schmidt and Ullrich Hustadt
• Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing Sophie Laplante, Richard Lassaigne, Frederic Magniez, Sylvain Peyronnet and Michel de Rougemont
• First-Order Queries on Structures of Bounded Degree Are Computable with Constant Delay Arnaud Durand and Etienne Grandjean
• A Sequent Calculus and a Theorem Prover for Standard Conditional Logics Nicola Olivetti, Gian Luca Pozzato and Camilla Schwind
• Removing Propagation Redundant Constraints in Redundant Modeling Chiu Wo Choi, Jimmy Ho-Man Lee and Peter J. Stuckey
• Probabilistic Interval XML Edward Hung, Lise Getoor and V.S. Subrahmanian
• 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