Logic Programming

17th International Conference, ICLP 2001, Paphos, Cyprus, November 26 - December 1, 2001. Proceedings
2001
ISBN: 978-3-540-42935-7
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 2237, 368 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1190 g

Reihe: Lecture Notes in Computer Science

to thank all the authors of the submitted papers, the Program Committeemembers,andtherefereesfortheirtimeande?ortsspentinthe- viewingprocess,theconferencechairTonyKakasandhisteamattheUniversity ofCyprusfortheexcellentorganizationoftheconference,andTobyWalsh,the CP2001 program chair, for his constant cooperation and interaction. Last but notleast,specialthankstoYoannFabreattheUniversityofParis6fortaking careofinstallingandmaintainingthepaperreviewsystem.

Zielgruppe

Research

Autoren/Hrsg.

Codognet, Philippe

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Prozedurale Programmierung
• Mathematik | Informatik EDV | Informatik Informatik Rechnerarchitektur
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten

Inhaltsverzeichnis

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 ImplicitlyNegative 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.