Theory and Practice of Logic Programming (TPLP), Volume 3

Volume 3, Number 1, January 2003

• James H. Andrews:
  The witness properties and the semantics of the Prolog cut. 1-59
  
• Faiz Arni, KayLiang Ong, Shalom Tsur, Haixun Wang, Carlo Zaniolo:
  The Deductive Database System LDL++. 61-94
  
• Jacob M. Howe, Andy King:
  Efficient Groundness Analysis in Prolog. 95-124
  
• Agostino Dovier:
  Book review: Set Theory for Computing: From Decision Procedures to Declarative Programming with Sets by Domenico Cantone, Eugenio Omodeo, and Alberto Policriti, Springer, 2001, ISBN 0-387-95197-0. 125-128
  

Volume 3, Number 2, March 2003

• James P. Delgrande, Torsten Schaub, Hans Tompits:
  A Framework for Compiling Preferences in Logic Programs. 129-187
  
• Juan M. Molina-Bravo, Ernesto Pimentel:
  Composing Programs in a Rewriting Logic for Declarative Programming. 189-221
  
• Yan Zhang:
  Two results for prioritized logic programming. 223-242
  
• Jacob M. Howe, Andy King:
  Three Optimisations for Sharing. 243-257
  

Volume 3, Number 3, May 2003

• Dick De Jongh, Lex Hendriks:
  Characterization of strongly equivalent logic programs in intermediate logics. 259-270
  
• Anja Remshagen, Klaus Truemper:
  Learning in a Compiler for MINSAT Algorithms. 271-286
  
• Ernest Teniente, Toni Urpí:
  On the abductive or deductive nature of database schema validation and update processing problems. 287-327
  
• Yan Zhang:
  Handling defeasibilities in action domains. 329-376
  
• Henk Vandecasteele, Gerda Janssens:
  An Open Ended Tree. 377-385
  

Volume 3, Number 4-5, July/September 2003

• Chitta Baral, Alessandro Provetti, Tran Cao Son:
  Introduction to the special issue on Programming with Answer Sets. 387-391
  
• Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki:
  Answer sets for consistent query answering in inconsistent databases. 393-424
  
• Marcello Balduccini, Michael Gelfond:
  Diagnostic reasoning with A-Prolog. 425-461
  
• Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer:
  Computing preferred answer sets by meta-interpretation in answer set programming. 463-498
  
• Esra Erdem, Vladimir Lifschitz:
  Tight logic programs. 499-518
  
• Keijo Heljanko, Ilkka Niemelä:
  Bounded LTL model checking with stable models. 519-550
  
• V. Wiktor Marek, Jeffrey B. Remmel:
  On the expressibility of stable logic programming. 551-567
  
• Torsten Schaub, Kewen Wang:
  A semantic framework for preference handling in answer set programming. 569-607
  
• Hudson Turner:
  Strong equivalence made easy: nested expressions and weight constraints. 609-622
  

Volume 3, Number 6, November 2003

• Elisa Bertino, Barbara Catania, Paolo Perlasca:
  Introducing Dynamic Behavior in Amalgamated Knowledge Bases. 625-669
  
• Chiaki Sakama, Katsumi Inoue:
  An abductive framework for computing knowledge base updates. 671-713
  
• Peter Van Roy, Per Brand, Denys Duchier, Seif Haridi, Martin Henz, Christian Schulte:
  Logic programming in the context of multiparadigm programming: the Oz experience. 715-763
  
• Bart Kuijpers:
  Book review: Introduction to Constraint Databases by Peter Revesz. Texts in Computer Science, Springer-Verlag, 2002, ISBN 0-387-98729-0, xiv + 393 pages, 112 illustrations, hardcover. 765-767
  

Last update Fri May 24 20:57:41 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page