4. ELP 1993: St. Andrews, U.K.

• Roy Dyckhoff:
  Introduction to ELP'93. 1-2
• Salvador Abreu, Luís Moniz Pereira:
  Design for AKL with Intelligent Pruning. 3-10
  
• José Júlio Alferes, Luís Moniz Pereira:
  Contradiction: When Avoidance Equals Removal - Part I. 11-23
  (Part II: 268-281)
• Beatrice Amrhein:
  Birkhoff's HSP-Theorem for Cumulative Logic Programs. 24-36
  
• Harold Boley:
  Finite Domains and Exclusions as First-Class Citizens. 37-61
  
• Anna Ciampolini, Evelina Lamma, Paola Mello, Cesare Stefanelli:
  Some Experimental Results in Implementing a Logic Language with Multi-head Clauses on a Transputer Architecture. 62-76
  
• Agostino Dovier:
  A Language with Finite Sets Embedded in the CLP-scheme. 77-93
  
• Lars-Henrik Eriksson:
  Finitary Partial Inductive Definitions as a General Logic. 94-119
  
• Göran Falkman, Olof Torgersson:
  Programming Methodologies in GCLA. 120-151
  
• Knut Hinkelmann, Helge Hintze:
  Computing Cost Estimates for Proof Strategies. 152-170
  
• Joshua S. Hodas:
  Logic Programming with Multiple Context Management Schemes. 171-182
  
• Seppo Keronen:
  Non-Procedural Logic Programming. 183-195
  
• Per Kreuger:
  Axioms in Definitional Calculi. 196-205
  
• Dale Miller:
  A Proposal for Modules in Lambda-Prolog. 206-221
  
• Alberto Momigliano, Mario Ornaghi:
  Regular Search Spaces as a Foundation of Logic Programming. 222-254
  
• David Pearce:
  Answer Sets and Nonmonotonic S4. 255-267
  
• José Júlio Alferes, Luís Moniz Pereira:
  Contradiction: When Avoidance Equals Removal - Part II. 268-281
  (Part I: 11-23)
• Luis Pinto:
  Cut Formulae and Logic Programming. 282-300
  
• Uday S. Reddy:
  Higher-order Aspects of Logic Programming. 301-321
  
• Cristina Ribeiro, António Porto:
  Representation and Inference with Consistent Temporal Propositions. 322-332
  
• Peter Schroeder-Heister:
  Definitional Reflection and the Completion. 333-347
  
• Jirí Zlatuska:
  Linear Logic Semantics for Concurrent Prolog. 348-360