Skip to main content
Springer Nature Link
Account

Logic Programming

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

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Philippe Codognet

    1. LIP6, case 169, University of Paris 6, Paris, France

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2237)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 12.99 USD 39.99
Discount applied Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (31 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  3. Tutorials

    1. Building Real-Life Applications with Prolog

      • Jan Wielemaker
      Pages 7-7

    2. Natural Language Tabular Parsing

      • Éric Villemonte de la Clergerie
      Pages 8-8

    3. A Close Look at Constraint-Based Concurrency

      • Kazunori Ueda
      Pages 9-9

    4. Probabilistic Databases and Logic Programming

      • V. S. Subrahmanian
      Pages 10-10

  4. Conference Papers

    1. Understanding Memory Management in Prolog Systems

      • Luís Fernando Castro, Vítor Santos Costa
      Pages 11-26

    2. PALS: An Or-Parallel Implementation of Prolog on Beowulf Architectures

      • K. Villaverde, E. Pontelli, H. Guo, G. Gupta2
      Pages 27-42

    3. On a Tabling Engine That Can Exploit Or-Parallelism

      • Ricardo Rocha, Fernando Silva, Vítor Santos Costa
      Pages 43-58

    4. Revisiting the Cardinality Operator and Introducing the Cardinality-PathConstraint Family

      • Nicolas Beldiceanu, Mats Carlsson
      Pages 59-73

    5. Optimizing Compilation of Constraint Handling Rules

      • Christian Holzbaur, María García de la Banda, David Jeffery, Peter J. Stuckey
      Pages 74-89

    6. Building Constraint Solvers with HAL

      • María García de la Banda, David Jeffery, Kim Marriott, Nicholas Nethercote, Peter J. Stuckey, Christian Holzbaur
      Pages 90-104

    7. Practical Aspects for a Working Compile Time Garbage Collection System for Mercury

      • Nancy Mazur, Peter Ross, Gerda Janssens, Maurice Bruynooghe
      Pages 105-119

    8. Positive Boolean Functions as Multiheaded Clauses

      • Jacob M. Howe, Andy King
      Pages 120-134

    9. Higher-Precision Groundness Analysis

      • Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey
      Pages 135-149

    10. Speculative Beats Conservative Justification

      • Hai-Feng Guo, C. R. Ramakrishnan, I. V. Ramakrishnan
      Pages 150-165

    11. Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming

      • Samik Basu, Madhavan Mukund, C. R. Ramakrishnan, I. V. Ramakrishnan, Rakesh Verma
      Pages 166-180
Back to top

Editors and Affiliations

  • LIP6, case 169, University of Paris 6, Paris, France

    Philippe Codognet

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top