| Program Committee | |
| The Association for Logic Programming | |
| Series Foreword | |
| Preface | |
| Referees | |
| Declarative Programming for a Messy World | p. 3 |
| Logics and Database Modeling | p. 6 |
| Adventures in the Prolog Trade | p. 22 |
| Answer Set Planning | p. 23 |
| Logic Programming in Oz with Mozart | p. 38 |
| Program Analysis, Debugging, and Optimization Using the Ciao System Preprocessor | p. 52 |
| From Prolog and Zelda to ToonTalk | p. 67 |
| Disjunctive Logic Programs with Inheritance | p. 79 |
| Event, Property, and Hierarchy in Order-Sorted Logic | p. 94 |
| Temporal Probabilistic Logic Programs | p. 109 |
| An Optimized Prolog Encoding of Typed Feature Structures | p. 124 |
| A Generic Approach to Monitor Program Executions | p. 139 |
| Generating Deductive Database Explanations | p. 154 |
| Computing Large and Small Stable Models | p. 169 |
| Algebra of Logic Programming | p. 184 |
| Semantic Definitions for Normal Open Programs | p. 200 |
| Declarative Priority in a Concurrent Logic Language O[subscript N] | p. 215 |
| Revising Hull and Box Consistency | p. 230 |
| CLAIRE: Combining Sets, Search, and Rules to Better Express Algorithms | p. 245 |
| Herbrand Constraint Solving in HAL | p. 260 |
| Comparing Trailing and Copying for Constraint Programming | p. 275 |
| Stack-splitting: Or-/And-parallelism on Distributed Memory Machines | p. 290 |
| Mutable Terms in a Tabled Logic Programming System | p. 305 |
| Concurrency in Prolog Using Threads and a Shared Database | p. 320 |
| Proving Termination of Input-Consuming Logic Programs | p. 335 |
| Bounded Nondeterminism of Logic Programs | p. 350 |
| Termination Analysis for Abductive General Logic Programs | p. 365 |
| The Relative Complement Problem for Higher-Order Patterns | p. 380 |
| Extensionality of Simply Typed Logic Programs | p. 395 |
| Lightweight Lemmas in [lamda]Prolog | p. 411 |
| Well-founded Abduction via Tabled Dual Programs | p. 426 |
| Optimization of Disjunctive Queries | p. 441 |
| Well-founded Semantics by Transformation: The Non-ground Case | p. 456 |
| Monotonicity in Rule Based Update | p. 471 |
| Transforming Inductive Definitions | p. 486 |
| Binding-time Analysis for Mercury | p. 500 |
| Solving TSP with Time Windows with Constraints | p. 515 |
| Finding Fair Allocations for the Coalition Problem with Constraints | p. 530 |
| Constraint-based Round Robin Tournament Planning | p. 545 |
| Logic Programming with Requests | p. 558 |
| ACI1 Constraints | p. 573 |
| Declarative Pruning in a Functional Query Language | p. 588 |
| Adding Functions to SICStus Prolog | p. 605 |
| Symbolic Execution for the Derivation of Meaningful Properties of Hybrid Systems | p. 606 |
| It Is Declarative | p. 607 |
| Domains as First Class Objects in CLP(FD) | p. 608 |
| A Characterization of Acceptability | p. 609 |
| A Static Analysis for Classical Linear Logic Programming Language | p. 610 |
| Isoinitial Models for Logic Programs: Some Preliminary Results | p. 611 |
| Implementing Prolog with Chronological Garbage Collection | p. 612 |
| A Regular Type Analysis of Logic Programs | p. 613 |
| Using Static Analysis to Compile Non-sequential Functional Logic Programs | p. 614 |
| Practical Investigation of Constraints with Graph Views | p. 615 |
| Generalized Unfold/fold Transformation Systems for Normal Logic Programs | p. 616 |
| Reactive Logic Programming by Reinforcement Learning | p. 617 |
| A Linear Tabling Mechanism | p. 618 |
| Author Index | p. 619 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
