| Program Committee | |
| The Association for Logic Programming | |
| Series Foreword | |
| Preface | |
| Referees | |
| Temporal Logic Model Checking | p. 3 |
| Program Analysis via Graph Reachability | p. 5 |
| Inductive Databases and Condensed Representations for Data Mining | p. 21 |
| Logic Programming Tools for Advanced Internet Programming | p. 33 |
| Set-based Analysis of Logic Programs and Reactive Logic Programs | p. 35 |
| Constraint Programming in Oz | p. 37 |
| Model Checking | p. 39 |
| Logic Programming for Processing Natural Language | p. 41 |
| Multi-Paradigm Declarative Programming | p. 43 |
| Transaction Logic: An Introduction | p. 47 |
| Programming with Global Analysis | p. 49 |
| A Lazy Narrowing Calculus for Functional Logic Programming with Algebraic Polymorphic Types | p. 53 |
| Answer Sets for Prioritized Logic Programs | p. 69 |
| Generated Preferred Models and Extensions of Nonmonotonic Systems | p. 85 |
| Comparative Metric Semantics for Commit in Or-Parallel Logic Programming | p. 101 |
| The SBA: Exploiting Orthogonality in AND-OR Parallel Systems | p. 117 |
| Using SimICS to Evaluate the Penny System | p. 133 |
| Extending a Concurrent Constraint Language by Propagators | p. 149 |
| A Rational and Efficient Algorithm for View Deletion in Databases | p. 165 |
| NP Optimization Problems in Datalog | p. 181 |
| Prioritized Conflict Handling for Logic Programs | p. 197 |
| A Procedure for Mediation of Queries to Sources in Disparate Contexts | p. 213 |
| Calculi for Disjunctive Logic Programming | p. 229 |
| A Characterization of the Partial Stable Models For Disjunctive Deductive Databases | p. 245 |
| Lower-bound Time-complexity Analysis of Logic Programs | p. 261 |
| Recursive Modes for Precise Analysis of Logic Programs | p. 277 |
| Lower Bound Cost Estimation for Logic Programs | p. 291 |
| Constraint Logic Programming with Hereditary Harrop Formulas | p. 307 |
| On T Logic Programming | p. 323 |
| Best-First Search in Property Maintenance for Reactive Constraints Systems | p. 339 |
| From Functional Specifications to Logic Programs | p. 355 |
| Compositionality of Normal Open Logic Programs | p. 371 |
| Approximate Reasoning about Actions in Presence of Sensing and Incomplete Information | p. 387 |
| On Well-Behaved Semantics Suitable for Aggregation | p. 405 |
| OPENLOG: A Logical Language to Program Reactive and Rational Agents | p. 406 |
| Type Inference for CLP(FD) | p. 407 |
| Disjunctive Completion Is Not "Optimal" | p. 408 |
| Controlling the Search in Tabled Evaluations | p. 409 |
| Specialization of Declarative Programs and Its Applications | p. 413 |
| Dynamics '97: (Trans)Actions and Change in Logic Programming and Deductive Databases | p. 415 |
| Tools and Environments for (Constraint) Logic Programming | p. 417 |
| Logic Programming and Knowledge Representation (LPKR'97) | p. 419 |
| Verification, Model Checking and Abstract Interpretation | p. 421 |
| Author Index | p. 423 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
