ACM Transactions on Computational Logic (TOCL), Volume 11

Volume 11, Number 1, October 2009

• Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn:
  Finitary winning in omega-regular games.
  
• Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann:
  Automated termination proofs for logic programs by term rewriting.
  
• Valentin Goranko, Dmitry Shkatov:
  Tableau-based decision procedures for logics of strategic ability in multiagent systems.
  
• Michael Benedikt, Luc Segoufin:
  Regular tree languages definable in FO and in FO_mod.
  
• Ferruccio Guidi:
  The formal system lambdadelta.
  
• Brigitte Pientka:
  Higher-order term indexing using substitution trees.
  
• Rob Arthan, Ursula Martin, Erik A. Mathiesen, Paulo Oliva:
  A general framework for sound and complete Floyd-Hoare logics.
  

Volume 11, Number 2, January 2010

• James Bailey, Guozhu Dong, Anthony Widjaja To:
  Logical queries over views: Decidability and expressiveness.
  
• Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu:
  Deciding security properties for cryptographic protocols. application to key cycles.
  
• Octavian Udrea, Diego Reforgiato Recupero, V. S. Subrahmanian:
  Annotated RDF.
  
• Robin Adams, Zhaohui Luo:
  Weyl's predicative classical mathematics as a logic-enriched type theory.
  
• Stavros S. Cosmadakis, Eugénie Foustoucos, Anastasios Sidiropoulos:
  Undecidability and intractability results concerning datalog programs and their persistency numbers.
  
• Alwen Tiu, Dale Miller:
  Proof search specifications of bisimulation and modal logics for the pi-calculus.
  
• Thomas Eiter, Mantas Simkus:
  FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols.
  

Volume 11, Number 3, May 2010

• Manuel Bodirsky, Jan Kára:
  A fast algorithm and datalog inexpressibility for temporal reasoning.
  
• Kedar S. Namjoshi, Richard J. Trefler:
  On the completeness of compositional reasoning methods.
  
• Detlef Kähler, Ralf Küsters, Thomas Wilke:
  Deciding strategy properties of contract-signing protocols.
  
• Nachum Dershowitz, Iddo Tzameret:
  Complexity of propositional proofs under a promise.
  
• Eli Ben-Sasson, Prahladh Harsha:
  Lower bounds for bounded depth Frege proofs via Pudlák-Buss games.
  
• Marko Samer, Helmut Veith:
  On the distributivity of LTL specifications.
  

Volume 11, Number 4, July 2010

• Michael Kaminski, Simone Martini:
  CSL 2008 special issue.
  
• Olaf Beyersdorff, Sebastian Müller:
  A tight Karp-Lipton collapse result in bounded arithmetic.
  
• Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
  Quantitative languages.
  
• Nadia Creignou, Henning Schnoor, Ilka Schnoor:
  Nonuniform Boolean constraint satisfaction problems with cardinality constraint.
  
• Mariangiola Dezani-Ciancaglini, Roberto Di Cosmo, Elio Giovannetti, Makoto Tatsuta:
  On isomorphisms of intersection types.
  
• Martin Hofmann, Ulrich Schöpp:
  Pure pointer programs with iteration.
  
• Matthias Horbach, Christoph Weidenbach:
  Superposition for fixed domains.
  
• Alexis Saurin:
  Typing streams in the Lambdaµ-calculus.
  
• Hana Chockler, Joseph Y. Halpern, Orna Kupferman:
  Erratum for "What causes a system to satisfy a specification?".
  

Last update Wed Feb 15 05:46:02 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page