Logic Programming: 17th International Conference, ICLP 2001, Paphos, Cyprus, November 26 - December 1, 2001. Proceedings

by Philippe Codognet (Editor)

Overview

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.

Product Details

ISBN-13:	9783540429357
Publisher:	Springer Berlin Heidelberg
Publication date:	12/06/2001
Series:	Lecture Notes in Computer Science , #2237
Edition description:	2001
Pages:	368
Product dimensions:	6.10(w) x 9.17(h) x 0.03(d)

Table of Contents

Invited Speakers.- Solving the Multiplication Constraint in Several Approximation Spaces.- Is Logic Really Dead or Only Just Sleeping?.- Design of Syntactic Program Transformations by Abstract Interpretation of Semantic Transformations.- X-tegration — Some Cross-Enterprise Thoughts.- Tutorials.- Building Real-Life Applications with Prolog.- Natural Language Tabular Parsing.- A Close Look at Constraint-Based Concurrency.- Probabilistic Databases and Logic Programming.- Conference Papers.- Understanding Memory Management in Prolog Systems.- PALS: An Or-Parallel Implementation of Prolog on Beowulf Architectures.- On a Tabling Engine That Can Exploit Or-Parallelism.- Revisiting the Cardinality Operator and Introducing the Cardinality-PathConstraint Family.- Optimizing Compilation of Constraint Handling Rules.- Building Constraint Solvers with HAL.- Practical Aspects for a Working Compile Time Garbage Collection System for Mercury.- Positive Boolean Functions as Multiheaded Clauses.- Higher-Precision Groundness Analysis.- Speculative Beats Conservative Justification.- Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming.- A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives.- Fixed-Parameter Complexity of Semantics for Logic Programs.- Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates.- Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models.- Fages’ Theorem for Programs with Nested Expressions.- Semantics of Normal Logic Programs with Embedded Implications.- A Multi-adjoint Logic Approach to Abductive Reasoning.- Proving Correctness and Completeness of Normal Programs — A Declarative Approach.- An Order-Sorted Resolution with Implicitly Negative Sorts.- Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic.- A Computational Model for Functional Logic Deductive Databases.- A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases.