Logic Programming: Proceedings of the Twelfth International Conference on Logic ProgrammingLeon Sterling Topics covered: Theoretical Foundations. Higher-Order Logics. Non-Monotonic Reasoning. Programming Methodology. Programming Environments. Extensions to Logic Programming. Constraint Satisfaction. Meta-Programming. Language Design and Constructs. Implementation of Logic Programming Languages. Compilation Techniques. Architectures. Parallelism. Reasoning about Programs. Deductive Databases. Applications. 13-16 June 1995, Tokyo, Japan ICLP, which is sponsored by the Association for Logic Programming, is one of two major annual international conferences reporting recent research results in logic programming. Logic programming originates from the discovery that a subset of predicate logic could be given a procedural interpretation which was first embodied in the programming language, Prolog. The unique features of logic programming make it appealing for numerous applications in artificial intelligence, computer-aided design and verification, databases, and operations research, and for exploring parallel and concurrent computing. The last two decades have witnessed substantial developments in this field from its foundation to implementation, applications, and the exploration of new language designs. Topics covered: Theoretical Foundations. Higher-Order Logics. Non-Monotonic Reasoning. Programming Methodology. Programming Environments. Extensions to Logic Programming. Constraint Satisfaction. Meta-Programming. Language Design and Constructs. Implementation of Logic Programming Languages. Compilation Techniques. Architectures. Parallelism. Reasoning about Programs. Deductive Databases. Applications. Logic Programming series, Research Reports and Notes |
Contents
Model Generation Theorem Provers and Their Applications | 7 |
Linear Equation Solving for Constraint Logic Programming 333 | 33 |
A Generic Algorithm for CLP Analysis | 49 |
Variants of the Event Calculus 5888 | 67 |
Fariba Sadri and Robert A Kowalski | 83 |
Efficient Implementation of the Event Calculus for Temporal Database | 99 |
Compiling and Executing Disjunctions of Finite Domain Constraints | 117 |
Finite Domain and Cutting Plane Techniques in CLP PB | 133 |
Reduction of Abductive Logic Programs to Normal Logic Programs | 367 |
The Effect of Partial Deduction in Abductive Reasoning | 383 |
Integrating Abductive and Constraint Logic Programming | 399 |
Constraint Enforcement and Retraction | 417 |
A Decision Graph Algorithm for CCP Languages | 433 |
Operational Semantics of Constraint Logic Programs with | 449 |
Andreas Podelski and Gert Smolka | 463 |
A Transformation System for Modular CLP Programs | 681 |
A Reactive Constraint Logic Programming Scheme | 157 |
Dynamic Deductive Data Bases With Steady Behaviour | 183 |
Disjunctive Semantics Based upon Partial and BottomUp Evaluation | 199 |
Stefan Brass and Jürgen Dix | 212 |
Relating Stable Models and AI Planning Domains | 233 |
Two Approaches for FiniteDomain Constraint Satisfaction Problems | 249 |
Experimenting with Nonmonotonic Reasoning | 267 |
A Modal Calculus of Partially Ordered Events in a Logic Programming | 299 |
Compiling Prolog to C | 317 |
Incremental Global Compilation of Prolog with the Vienna Abstract | 333 |
Efficient Execution of HiLog in WAMbased Prolog Implementations | 349 |
Efficient Tabling Mechanisms for Logic Programs | 697 |
A Statistical Learning Method for Logic Programs with Distribution | 715 |
Preference Logic Programming | 731 |
Two Aspects of Directional Types | 747 |
Type Inferencing for Polymorphic OrderSorted Logic Programs | 765 |
On the Practicality of Abstract Equation Systems | 781 |
Incremental Analysis of Logic Programs | 797 |
Shallow Backtracking Points in an Intelligent Backtracking Schema | 815 |
Pawel Cholewinski V Wiktor Marek Artur Mikitiuk and Miroslaw | 832 |