Volume 2, Number 1, January 2001

• 
  Andreas Blass, Yuri Gurevich: Inadequacy of computable loop invariants. 1-11
• 
  Michael Fisher, Clare Dixon, Martin Peim: Clausal temporal resolution. 12-56
• 
  Sofie Verbaeten, Danny De Schreye, Konstantinos F. Sagonas: Termination proofs for logic programs with tabling. 57-92
• 
  Randal E. Bryant, Steven M. German, Miroslav N. Velev: Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic. 93-134
• 
  Leonid Libkin: Logics capturing local properties. 135-153

Volume 2, Number 2, April 2001

• 
  Tatiana Rybina, Andrei Voronkov: A decision procedure for term algebras with queues. 155-181
• 
  Andrei Voronkov: How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculi. 182-215
• 
  Joost Engelfriet, Hendrik Jan Hoogeboom: MSO definable string transductions and two-way finite-state transducers. 216-254
• 
  Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher: Representation results for defeasible logic. 255-287

Volume 2, Number 3, July 2001

• 
  Thomas Lukasiewicz: Probabilistic logic programming with conditional constraints. 289-339
• 
  Uwe Egly, Hans Tompits: Proof-complexity results for nonmonotonic reasoning. 340-387
• 
  Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron Peled: Parametric temporal logic for "model measuring". 388-407
• 
  Orna Kupferman, Moshe Y. Vardi: Weak alternating automata are not that weak. 408-429

Volume 2, Number 4, October 2001

• 
  Krzysztof R. Apt, Antonis C. Kakas, Fariba Sadri: Editorial. 431
• 
  Raymond Reiter: On knowledge-based programming with sensing in the situation calculus. 433-457
• 
  Nada Lavrac, Peter A. Flach: An extended transformation approach to inductive logic programming. 458-494
• 
  Giuseppe De Giacomo, Hector J. Levesque, Sebastian Sardiña: Incremental execution of guarded theories. 495-525
• 
  Vladimir Lifschitz, David Pearce, Agustín Valverde: Strongly equivalent logic programs. 526-541
• 
  Luigia Carlucci Aiello, Fabio Massacci: Verifying security protocols as planning in logic programming. 542-580
• 
  Marek J. Sergot: A computational theory of normative positions. 581-622
• 
  Marc Denecker, Maurice Bruynooghe, V. Wiktor Marek: Logic programming revisited: Logic programs as inductive definitions. 623-654

last updated on Thu May 23 04:48:39 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page