ACM Transactions on Computational Logic (TOCL)
Accepted Papers, 2004
Volume 5, Number 1 (January 2004)
Volume 5, Number 2 (April 2004)
-
Automatic Generation of Rule-based Constraint Solvers over Finite
Domains,
Slim Abdennadher and Christophe Rigotti
-
A Logic Programming Approach to Knowledge-State
Planning: Semantics and Complexity,
Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, and Axel
Polleres
-
Convergent Approximate Solving of First-Order
Constraints by Approximate Quantifiers,
Stefan Ratschan
-
Inflationary Fixed Points in Modal Logic,
Anuj Dawar, Erich Grädel, and Stephan Kreutzer
-
Optimal Length Tree-like Resolution Refutations for 2SAT formulas,
K. Subramani
-
Classes of Term Rewrite Systems with Polynomial Confluence
Problems,
Guillem Godoy, Ashish Tiwari and Robert Nieuwenhuis
-
Some applications of logic to feasibility in higher types,
Aleksandar Ignjatovic and Arun Sharma
-
A Decomposition-Based Implementation of Search Strategies,
Laurent Michel and Pascal Van Hentenryck
Volume 5, Number 3 (July 2004)
-
Basic Theory of Feature Trees,
P. Mielniczuk
-
Finite state machines for strings over infinite alphabets,
F. Neven, T. Schwentick and V. Vianu
-
Symbolic Semantic Rules for Producing Compact STGLA from
Value Passing Process Descriptions,
Marco Bernardo
-
Termination of Simply Moded Logic Programs with Dynamic
Scheduling,
Annalisa Bossi, Sandro Etalle,
Sabina Rossi and Jan-Georg Smaus
-
Hypotheses-Based Semantics of Logic Programs in Multi-Valued
Logics,
Yann Loyer, Nicolas Spyratos and Daniel Stamate
-
Reflective Metalogical Frameworks,
David Basin, Manuel Clave and Jose Meseguer
Volume 5, Number 4 (October 2004)
Back to home page