Logic Programming: 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004. Proceedings
Author: Bart Demoen, Vladimir Lifschitz
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-22671-0
DOI: 10.1007/b99475

Table of Contents:

• Termination by Abstraction
  
• Answer Set Programming and the Design of Deliberative Agents
  
• Abstract Domains Based on Regular Types
  
• Termination of Logic Programs Using Various Dynamic Selection Rules
  
• Improving Prolog Programs: Refactoring for Prolog
  
• Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP
  
• The Refined Operational Semantics of Constraint Handling Rules
  
• Compiling Ask Constraints
  
• Constraint Handling Rules and Tabled Execution
  
• Possible Worlds Semantics for Probabilistic Logic Programs
  
• Limiting Resolution: From Foundations to Implementation
  
• Generalised Kernel Sets for Inverse Entailment
  
• On Programs with Linearly Ordered Multiple Preferences
  
• Splitting an Operator
  
• Simplifying Logic Programs Under Answer Set Semantics
  
• On Acyclic and Head-Cycle Free Nested Logic Programs
  
• Fast Query Evaluation with (Lazy) Control Flow Compilation
  
• Speculative Computations in Or-Parallel Tabled Logic Programs
  
• αProlog: A Logic Programming Language with Names, Binding and α-Equivalence
  
• Implementation Results in Classical Constructive Negation