Logic Programming

Anewmillenniumhasstartedandnewtools,heirsofthreedecadesofresearch and development in the Logic Programming paradigm, are bringing new so- tionstocopewiththeincreasingcomplexityoftoday scomputersystems.C- putationallogicingeneralandlogicprogramminginparticularwillalwaysplaya keyroleintheunderstanding,formalizing,anddevelopmentofcomplexsoftware. ICLP2001 was the 17th International Conference on Logic Programming andcontinuedaseriesofconferencesinitiatedinMarseille,France,in1982.This year ICLP was held in conjunction with CP2001, the 7th International C- ference on Principle and Practice of Constraint Programming. A coordinated programscheduleandjointeventswereorganizedinordertomaximizethe- teractionbetweenthesetwoneighboringcommunities.LOPSTR2001,the11th international workshop on Logic-based Program Synthesis and Transformation was also co-located with ICLP2001 and CP2001 this year, bringing together a larger community to share novel research results. Seven satellite workshops were also associated to the conference and took place on the day following the conference. We received 64 papers, among which 23 were selected for presentation at theconferenceandinclusionintheconferenceproceedings.Inadditiontopaper presentations,theconferenceprogramalsoincludedfourinvitedtalksandfour tutorials.Wechosethisyeartocelebratethefoundersofthelogicprogramming ?eld,namelyAlainColmerauerandBobKowalski,whoarebothcelebratingtheir 60th birthday. The other two invited talks were given by Patrick Cousot, p- neerinthe?eldofabstractinterpretation,andAshishGupta,whopresentedhis industrial experience on cross-enterprise databases at amazon.com and Tavant Technologies. The four tutorials were given by Eric Villemonte de la Clergerie, V.S.Subrahmanian,KazunoriUeda,andJanWielemaker. I would like 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.

Includes supplementary material: sn.pub/extras

Klappentext

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.

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