Logic Programming: 17thInternational Conference, ICLP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings<br />Author: Philippe Codognet<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42935-7<br /> DOI: 10.1007/3-540-45635-X<br /><br />Table of Contents:<p></p><ul><li>Solving the Multiplication Constraint in Several Approximation Spaces </li><li>Is Logic Really Dead or Only Just Sleeping? </li><li>Design of Syntactic Program Transformations by Abstract Interpretation of Semantic Transformations </li><li>X-tegration — Some Cross-Enterprise Thoughts </li><li>Building Real-Life Applications with Prolog </li><li>Natural Language Tabular Parsing </li><li>A Close Look at Constraint-Based Concurrency </li><li>Probabilistic Databases and Logic Programming </li><li>Understanding Memory Management in Prolog Systems </li><li>PALS: An Or-Parallel Implementation of Prolog on Beowulf Architectures </li><li>On a Tabling Engine That Can Exploit Or-Parallelism </li><li>Revisiting the Cardinality Operator and Introducing the Cardinality-PathConstraint Family </li><li>Optimizing Compilation of Constraint Handling Rules </li><li>Building Constraint Solvers with HAL </li><li>Practical Aspects for a Working Compile Time Garbage Collection System for Mercury </li><li>Positive Boolean Functions as Multiheaded Clauses </li><li>Higher-Precision Groundness Analysis </li><li>Speculative Beats Conservative Justification </li><li>Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming </li><li>A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives</li></ul>