ACM Transactions on Computational Logic (TOCL), Volume 8

Volume 8, Number 1, January 2007

• Alessio Guglielmi:
  A system of interaction and structure.
  Electronic Edition (ACM DL) BibTeX
• Paolo Liberatore, Marco Schaerf:
  Compilability of propositional abduction.
  Electronic Edition (ACM DL) BibTeX
• Annabelle McIver, Carroll Morgan:
  Results on the quantitative µ-calculus qMµ.
  Electronic Edition (ACM DL) BibTeX
• Alexander Rabinovich:
  On compositionality and its limitations.
  Electronic Edition (ACM DL) BibTeX
• Greta Yorsh, Thomas W. Reps, Mooly Sagiv, Reinhard Wilhelm:
  Logical characterizations of heap abstractions.
  Electronic Edition (ACM DL) BibTeX
• Maria Paola Bonacina, Nachum Dershowitz:
  Abstract canonical inference.
  Electronic Edition (ACM DL) BibTeX
• Joost Vennekens, David Gilis, Marc Denecker:
  Erratum to splitting an operator: Algebraic modularity results for logics with fixpoint semantics.
  Electronic Edition (ACM DL) BibTeX

Volume 8, Number 2, April 2007

• Karl Crary:
  Sound and complete elimination of singleton kinds.
  Electronic Edition (ACM DL) BibTeX
• Fangzhen Lin, Jia-Huai You:
  Recycling computed answers in rewrite systems for abduction.
  Electronic Edition (ACM DL) BibTeX
• Paolo Liberatore:
  Where fail-safe default logics fail.
  Electronic Edition (ACM DL) BibTeX
• Michael Benedikt, Leonid Libkin, Frank Neven:
  Logical definability and query languages over ranked and unranked trees.
  Electronic Edition (ACM DL) BibTeX
• Viorica Sofronie-Stokkermans:
  On unification for bounded distributive lattices.
  Electronic Edition (ACM DL) BibTeX
• John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
  The arithmetical complexity of dimension and randomness.
  Electronic Edition (ACM DL) BibTeX

Volume 8, Number 3, July 2007

• Marco Pedicini, Francesco Quaglia:
  PELCR: Parallel environment for optimal lambda-calculus reduction.
  Electronic Edition (ACM DL) BibTeX
• Andreas Blass, Yuri Gurevich:
  Ordinary interactive small-step algorithms, II.
  Electronic Edition (ACM DL) BibTeX
• Andreas Blass, Yuri Gurevich:
  Ordinary interactive small-step algorithms, III.
  Electronic Edition (ACM DL) BibTeX
• Thomas Eiter, Michael Fink, Stefan Woltran:
  Semantical characterizations and complexity of equivalences in answer set programming.
  Electronic Edition (ACM DL) BibTeX
• Ofer Arieli:
  Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae.
  Electronic Edition (ACM DL) BibTeX

Volume 8, Number 4, August 2007

• Renate A. Schmidt, Ullrich Hustadt:
  The axiomatic translation principle for modal logic.
  Electronic Edition (ACM DL) BibTeX
• Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont:
  Probabilistic abstraction for model checking: An approach based on property testing.
  Electronic Edition (ACM DL) BibTeX
• Arnaud Durand, Etienne Grandjean:
  First-order queries on structures of bounded degree are computable with constant delay.
  Electronic Edition (ACM DL) BibTeX
• Nicola Olivetti, Gian Luca Pozzato, Camilla Schwind:
  A sequent calculus and a theorem prover for standard conditional logics.
  Electronic Edition (ACM DL) BibTeX
• Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey:
  Removing propagation redundant constraints in redundant modeling.
  Electronic Edition (ACM DL) BibTeX
• Edward Hung, Lise Getoor, V. S. Subrahmanian:
  Probabilistic interval XML.
  Electronic Edition (ACM DL) BibTeX