17. ICLP 2001: Paphos, Cyprus

@proceedings{DBLP:conf/iclp/2001,
  editor    = {Philippe Codognet},
  title     = {Logic Programming, 17th International Conference, ICLP 2001,
               Paphos, Cyprus, November 26 - December 1, 2001, Proceedings},
  booktitle = {ICLP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2237},
  year      = {2001},
  isbn      = {3-540-42935-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Speakers

• Alain Colmerauer:
  Solving the Multiplication Constraint in Several Approximation Spaces. 1
  Electronic Edition (Springer LINK) BibTeX
• Robert A. Kowalski:
  Is Logic Really Dead or Only Just Sleeping? 2-3
  Electronic Edition (Springer LINK) BibTeX
• Patrick Cousot:
  Design of Syntactic Program Transformations by Abstract Interpretation of Semantic Transformations. 4-5
  Electronic Edition (Springer LINK) BibTeX
• Ashish Gupta:
  X-tegration - Some Cross-Enterprise Thoughts. 6
  Electronic Edition (Springer LINK) BibTeX

Tutorials

• Jan Wielemaker:
  Building Real-Life Applications with Prolog. 7
  Electronic Edition (Springer LINK) BibTeX
• Eric Villemonte de la Clergerie:
  Natural Language Tabular Parsing. 8
  Electronic Edition (Springer LINK) BibTeX
• Kazunori Ueda:
  A Close Look at Constraint-Based Concurrency. 9
  Electronic Edition (Springer LINK) BibTeX
• V. S. Subrahmanian:
  Probabilistic Databases and Logic Programming. 10
  Electronic Edition (Springer LINK) BibTeX

Conference Papers

• Luís Fernando Castro, Vítor Santos Costa:
  Understanding Memory Management in Prolog Systems. 11-26
  Electronic Edition (Springer LINK) BibTeX
• Karen Villaverde, Enrico Pontelli, Hai-Feng Guo, Gopal Gupta:
  PALS: An Or-Parallel Implementation of Prolog on Beowulf Architectures. 27-42
  Electronic Edition (Springer LINK) BibTeX
• Ricardo Rocha, Fernando M. A. Silva, Vítor Santos Costa:
  On a Tabling Engine That Can Exploit Or-Parallelism. 43-58
  Electronic Edition (Springer LINK) BibTeX
• Nicolas Beldiceanu, Mats Carlsson:
  Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family. 59-73
  Electronic Edition (Springer LINK) BibTeX
• Christian Holzbaur, Maria J. García de la Banda, David Jeffery, Peter J. Stuckey:
  Optimizing Compilation of Constraint Handling Rules. 74-89
  Electronic Edition (Springer LINK) BibTeX
• Maria J. García de la Banda, David Jeffery, Kim Marriott, Nicholas Nethercote, Peter J. Stuckey, Christian Holzbaur:
  Building Constraint Solvers with HAL. 90-104
  Electronic Edition (Springer LINK) BibTeX
• Nancy Mazur, Peter Ross, Gerda Janssens, Maurice Bruynooghe:
  Practical Aspects for a Working Compile Time Garbage Collection System for Mercury. 105-119
  Electronic Edition (Springer LINK) BibTeX
• Jacob M. Howe, Andy King:
  Positive Boolean Functions as Multiheaded Clauses. 120-134
  Electronic Edition (Springer LINK) BibTeX
• Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey:
  Higher-Precision Groundness Analysis. 135-149
  Electronic Edition (Springer LINK) BibTeX
• Hai-Feng Guo, C. R. Ramakrishnan, I. V. Ramakrishnan:
  Speculative Beats Conservative Justification. 150-165
  Electronic Edition (Springer LINK) BibTeX
• Samik Basu, Madhavan Mukund, C. R. Ramakrishnan, I. V. Ramakrishnan, Rakesh M. Verma:
  Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming. 166-180
  Electronic Edition (Springer LINK) BibTeX
• Hai-Feng Guo, Gopal Gupta:
  A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives. 181-196
  Electronic Edition (Springer LINK) BibTeX
• Zbigniew Lonc, Miroslaw Truszczynski:
  Fixed-Parameter Complexity of Semantics for Logic Programs. 197-211
  Electronic Edition (Springer LINK) BibTeX
• Marc Denecker, Nikolay Pelov, Maurice Bruynooghe:
  Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates. 212-226
  Electronic Edition (Springer LINK) BibTeX
• K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smolka:
  Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models. 227-241
  Electronic Edition (Springer LINK) BibTeX
• Esra Erdem, Vladimir Lifschitz:
  Fages' Theorem for Programs with Nested Expressions. 242-254
  Electronic Edition (Springer LINK) BibTeX
• Fernando Orejas, Edelmira Pasarella, Elvira Pino:
  Semantics of Normal Logic Programs with Embedded Implications. 255-268
  Electronic Edition (Springer LINK) BibTeX
• Jesús Medina, Manuel Ojeda-Aciego, Peter Vojtás:
  A Multi-adjoint Logic Approach to Abductive Reasoning. 269-283
  Electronic Edition (Springer LINK) BibTeX
• Wlodzimierz Drabent, Miroslawa Milkowska:
  Proving Correctness and Completeness of Normal Programs - A Declarative Approach. 284-299
  Electronic Edition (Springer LINK) BibTeX
• Ken Kaneiwa, Satoshi Tojo:
  An Order-Sorted Resolution with Implicitly Negative Sorts. 300-314
  Electronic Edition (Springer LINK) BibTeX
• Mutsunori Banbara, Kyoung-Sun Kang, Takaharu Hirai, Naoyuki Tamura:
  Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic. 315-330
  Electronic Edition (Springer LINK) BibTeX
• Jesús Manuel Almendros-Jiménez, Antonio Becerra-Terón, Jaime Sánchez-Hernández:
  A Computational Model for Functional Logic Deductive Databases. 331-347
  Electronic Edition (Springer LINK) BibTeX
• Gianluigi Greco, Sergio Greco, Ester Zumpano:
  A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases. 348-364
  Electronic Edition (Springer LINK) BibTeX