This book constitutes the refereed proceedings of the 17th International Conference on Logic Programming, ICLP 2001, held in Paphos, Cyprus in November/December 2001.
The 23 revised full papers presented were carefully reviewed and selected from 64 submissions. All current aspects of logic programming and computational logics are addressed.
Author(s): Alain Colmerauer (auth.), Philippe Codognet (eds.)
Series: Lecture Notes in Computer Science 2237
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2001
Language: English
Pages: 368
Tags: Programming Techniques; Artificial Intelligence (incl. Robotics); Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Mathematical Logic and Formal Languages
Solving the Multiplication Constraint in Several Approximation Spaces....Pages 1-1
Is Logic Really Dead or Only Just Sleeping?....Pages 2-3
Design of Syntactic Program Transformations by Abstract Interpretation of Semantic Transformations....Pages 4-5
X-tegration — Some Cross-Enterprise Thoughts....Pages 6-6
Building Real-Life Applications with Prolog....Pages 7-7
Natural Language Tabular Parsing....Pages 8-8
A Close Look at Constraint-Based Concurrency....Pages 9-9
Probabilistic Databases and Logic Programming....Pages 10-10
Understanding Memory Management in Prolog Systems....Pages 11-26
PALS: An Or-Parallel Implementation of Prolog on Beowulf Architectures....Pages 27-42
On a Tabling Engine That Can Exploit Or-Parallelism....Pages 43-58
Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family....Pages 59-73
Optimizing Compilation of Constraint Handling Rules....Pages 74-89
Building Constraint Solvers with HAL....Pages 90-104
Practical Aspects for a Working Compile Time Garbage Collection System for Mercury....Pages 105-119
Positive Boolean Functions as Multiheaded Clauses....Pages 120-134
Higher-Precision Groundness Analysis....Pages 135-149
Speculative Beats Conservative Justification....Pages 150-165
Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming....Pages 166-180
A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives....Pages 181-196
Fixed-Parameter Complexity of Semantics for Logic Programs....Pages 197-211
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates....Pages 212-226
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models....Pages 227-241
Fages’ Theorem for Programs with Nested Expressions....Pages 242-254
Semantics of Normal Logic Programs with Embedded Implications....Pages 255-268
A Multi-adjoint Logic Approach to Abductive Reasoning....Pages 269-283
Proving Correctness and Completeness of Normal Programs — A Declarative Approach....Pages 284-299
An Order-Sorted Resolution with Implicitly Negative Sorts....Pages 300-314
Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic....Pages 315-330
A Computational Model for Functional Logic Deductive Databases....Pages 331-347
A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases....Pages 348-364
