ACM Transactions on Computational Logic (TOCL), Volume 5

Volume 5, Number 1, January 2004

• Rajeev Alur, Salvatore La Torre:
  Deterministic generators and games for Ltl fragments. 1-25
  Electronic Edition (ACM DL) BibTeX
• Bard Bloom, Wan Fokkink, Rob J. van Glabbeek:
  Precongruence formats for decorated trace semantics. 26-78
  Electronic Edition (ACM DL) BibTeX
• Rocco De Nicola, Michele Loreti:
  A modal logic for mobile agents. 79-128
  Electronic Edition (ACM DL) BibTeX
• Stefan Brass, Jürgen Dix, Teodor C. Przymusinski:
  Super logic programs. 129-176
  Electronic Edition (ACM DL) BibTeX

Volume 5, Number 2, April 2004

• Slim Abdennadher, Christophe Rigotti:
  Automatic generation of rule-based constraint solvers over finite domains. 177-205
  Electronic Edition (ACM DL) BibTeX
• Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres:
  A logic programming approach to knowledge-state planning: Semantics and complexity. 206-263
  Electronic Edition (ACM DL) BibTeX
• Stefan Ratschan:
  Convergent approximate solving of first-order constraints by approximate quantifiers. 264-281
  Electronic Edition (ACM DL) BibTeX
• Anuj Dawar, Erich Grädel, Stephan Kreutzer:
  Inflationary fixed points in modal logic. 282-315
  Electronic Edition (ACM DL) BibTeX
• K. Subramani:
  Optimal length tree-like resolution refutations for 2SAT formulas. 316-320
  Electronic Edition (ACM DL) BibTeX
• Guillem Godoy, Robert Nieuwenhuis, Ashish Tiwari:
  Classes of term rewrite systems with polynomial confluence problems. 321-331
  Electronic Edition (ACM DL) BibTeX
• Aleksandar Ignjatovic, Arun Sharma:
  Some applications of logic to feasibility in higher types. 332-350
  Electronic Edition (ACM DL) BibTeX
• Laurent Michel, Pascal Van Hentenryck:
  A decomposition-based implementation of search strategies. 351-383
  Electronic Edition (ACM DL) BibTeX

Volume 5, Number 3, July 2004

• Pawel Mielniczuk:
  Basic theory of feature trees. 385-402
  Electronic Edition (ACM DL) BibTeX
• Frank Neven, Thomas Schwentick, Victor Vianu:
  Finite state machines for strings over infinite alphabets. 403-435
  Electronic Edition (ACM DL) BibTeX
• Marco Bernardo:
  Symbolic semantic rules for producing compact STGLAs from value passing process descriptions. 436-469
  Electronic Edition (ACM DL) BibTeX
• Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus:
  Termination of simply moded logic programs with dynamic scheduling. 470-507
  Electronic Edition (ACM DL) BibTeX
• Yann Loyer, Nicolas Spyratos, Daniel Stamate:
  Hypothesis-based semantics of logic programs in multivalued logics. 508-527
  Electronic Edition (ACM DL) BibTeX
• David A. Basin, Manuel Clavel, José Meseguer:
  Reflective metalogical frameworks. 528-576
  Electronic Edition (ACM DL) BibTeX

Volume 5, Number 4, October 2004

• W. O. David Griffioen, Frits W. Vaandrager:
  A theory of normed simulations. 577-610
  Electronic Edition (ACM DL) BibTeX
• J. V. Tucker, Jeffery I. Zucker:
  Abstract versus concrete computation on metric partial algebras. 611-668
  Electronic Edition (ACM DL) BibTeX
• Carsten Lutz:
  NEXP TIME-complete description logics with concrete domains. 669-705
  Electronic Edition (ACM DL) BibTeX
• Frank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo:
  Proving correctness of timed concurrent constraint programs. 706-731
  Electronic Edition (ACM DL) BibTeX
• Frédéric Benhamou, Frédéric Goualard, Eric Languénou, Marc Christie:
  Interval constraint solving for camera control and motion planning. 732-767
  Electronic Edition (ACM DL) BibTeX