| |
| |
Program Committee | |
| |
| |
The Association for Logic Programming | |
| |
| |
Series Foreword | |
| |
| |
Preface | |
| |
| |
Referees | |
| |
| |
Invited Talks | |
| |
| |
Lazy Functional State Threads: An | |
| |
| |
Abstract | |
| |
| |
| |
Advanced Tutorials | |
| |
| |
Implementation of Andorra-based Languages | |
| |
| |
| |
A Tutorial on Synthesis of Logic Programs from Specifications | |
| |
| |
Kung-Kiu Lau and Geraint Wiggins | |
| |
| |
Modularity in Logic Programming | |
| |
| |
| |
Abduction and Abductive Logic Programming | |
| |
| |
| |
Semantics I Splitting a Logic Program | |
| |
| |
| |
Language Independence and Language Tolerance in Logic Programs | |
| |
| |
| |
Computing Stable Models by Program Transformation | |
| |
| |
| |
Declarative Interpretations Reconsidered | |
| |
| |
| |
Parallelism | |
| |
| |
ACE: And/Or-parallel Copying-based Execution of Logic Programs | |
| |
| |
| |
Hybrid Tree Search in the Andorra Model | |
| |
| |
| |
Parallel CLP on Heterogeneous Networks | |
| |
| |
| |
PDP: Prolog Distributed Processor for Independent AND/OR Parallel Execution of Prolog | |
| |
| |
| |
Implementation | |
| |
| |
On the Scheme of Passing Arguments in Stack Frames for Prolog | |
| |
| |
| |
Output Value Placement in Moded Logic Programs | |
| |
| |
| |
Native Code Compliation in SICStus Prolog | |
| |
| |
| |
Action | |
| |
| |
Representing Actions in Equational Logic Programming | |
| |
| |
| |
Representing Continuous Change in the Abductive Event Calculus | |
| |
| |
| |
Concurrency and Plan Generation in a Logic Programming Language with a Sequential Operator | |
| |
| |
| |
Semantics II Computing Annotated Logic Programs | |
| |
| |
| |
Conditional Logic Programming | |
| |
| |
| |
Causal Models of Disjunctive Logic Programs | |
| |
| |
| |
An Axiomatic Approach to Semantics of Disjunctive Programs | |
| |
| |
| |
Constraints I Finding Conflict Sets and Backtrack Points in CLP (K) | |
| |
| |
| |
Entailment of Finite Domain Constraints | |
| |
| |
| |
Notes on the Design of an Open Boolean Solver | |
| |
| |
| |
Improved CLP Scheduling with Task Intervals | |
| |
| |
| |
Higher-order and Meta Programming | |
| |
| |
Ambivalent Logic as the Semantic Basis of Metalogic Programming: I | |
| |
| |
| |
Higher-order Aspects of Logic Programming (Summary) | |
| |
| |
| |
Higher-Order Polymorphic Unification for Logic Programming | |
| |
| |
| |
Databases | |
| |
| |
A Database Interface for Complex Objects | |
| |
| |
| |
A Slick Procedure for Integrity Checking in Deductive Databases | |
| |
| |
| |
LPDA: Another Look at Tabulation in Logic Programming | |
| |
| |
| |
Abduction and Negation | |
| |
| |
On the Equivalence between Disjunctive and Abductive Logic Programs | |
| |
| |
| |
The Acceptability Semantics for Logic Programs | |
| |
| |
| |
A Bottom-up Semantics for Constructive Negation | |
| |
| |
| |
Default Rules: An Extension of Constructive Negation for Narrowing-based Languages | |
| |
| |
| |
Analysis | |
| |
| |
| |
Towards a Practical Full Mode Inference System for CLP(H,N) | |
| |
| |
| |
A Proof Method for Run-time Properties of Prolog Programs | |
| |
| |
| |
Fast and Precise Regular Approximations of Logic Programs | |
| |
| |
| |
Constraints II Constraint Solving by Narrowing in Combined Algebraic Domains | |
| |
| |
| |
A Grammatical Approach to DCG Parsing | |
| |
| |
| |
Compiling Intensional Sets in CLP | |
| |
| |
| |
Transformation and Synthesis | |
| |
| |
The Halting Problem for Deductive Synthesis of Logic Programs | |
| |
| |
| |
A New Transformation Based on Process-Message Duality for Concurrent Logic Languages | |
| |
| |
| |
Compiling Control Revisited: A New Approach Based upon | |
| |
| |
Abstract Interpretation | |
| |
| |
| |
Completeness of Some Transformation Strategies for Avoiding Unnecessary Logical Variables | |
| |
| |
| |
Poster | |
| |
| |
Abstracts | |
| |
| |
Conjunto: Constraint Propagation over Set Constraints with Finite Set Domain Variables | |
| |
| |
| |
Logic Programs with Refutation Rules | |
| |
| |
| |
Efficient and Complete Demo Predicates for Defmite Clause Languages | |
| |
| |
| |
Towards a Verified OR-Parallel WAM | |
| |
| |
| |
Recomputation-free Lemmatization by Program Transformation | |
| |
| |
| |
Is a Whelk: Whelk Interpreted in Isabelle | |
| |
| |
| |
Reflection through Constraint Satisfaction | |
| |
| |
| |
PP-clauses: A Means for Handling Resources | |
| |
| |
| |
Logic, Algebra and Static Analysis in DM Systems, the IE Way | |
| |
| |
| |
Proving Hardware Designs | |
| |
| |
| |
A Dataflow Analysis Method for Ground Prolog | |
| |
| |
| |
Logic Programming as Quantum Measurement | |
| |
| |
| |
Author Index | |