ACM Transactions on Computational Logic (TOCL)

Accepted Papers, 2009

• 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
• 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
• PSPACE Bounds for Rank-1 Modal Logics Lutz Schröder and Dirk Pattinson
• On the Proof Complexity of Deep Inference Paola Bruscoli and Alessio Guglielmi

• Checking Timed Büchi Automata Emptiness on Simulation Graphs Stavros Tripakis
• LTL with the Freeze Quantifier and Register Automata Stéphane Demri and Ranko Lazic
• Generalizing Consistency and other Constraint Properties to Quantified Constraints Lucas Bordeaux, Marco Cadoli and Toni Mancini (Electronic Appendix)
• Analytic Tableaux Calculi for KLM Logics of Nonmonotonic Reasoning Laura Giordano, Valentina Gliozzi, Nicola Olivetti and Gian Luca Pozzato (Electronic Appendix)
• An Algebra of Quantum Processes Mingsheng Ying, Yuan Feng, Runyao Duan and Zhengfeng Ji (Electronic Appendix)
• Simultaneous Checking of Completeness and Ground Confluence for Algebraic Specifications Adel Bouhoula
• Tableau Calculus for Preference-Based Conditional Logics: CE and Its Extensions Laura Giordano, Valentina Gliozzi, Nicola Olivetti and Camilla Schwind
• Differential Recursion Akitoshi Kawamura

• Editorial Patrick Baillot, Jean-Yves Marion and Simona Ronchi Della Rocca
• A New Function Algebra of EXPTIME Functions by Safe Nested Recursion Toshiyasu Arai and Naohi Eguchi
• Context Semantics, Linear Logic and Computational Complexity Ugo Dal Lago
• Extending the LOOP language with Higher-Order Procedural Variables T. Crolard, E. Polonowski and P. Valarcher
• Sup-Interpretations, a Semantic Method for Static Analysis of Program Resources Jean-Yves Marion and Romain Péchoux
• A Flow Calculus of mwp-Bounds for Complexity Analysis Neil D. Jones and Lars Kristiansen
• Resource Control Graphs Jean-Yves Moyen