ICLP '01 Accepted Papers Fixed-parameter complexity of semantics for logic programs Zbigniew Lonc and Miroslaw Truszczynski University of Kentucky
PALS: A Distributed Or-Parallel Implementation of Prolog K. Villaverde, E. Pontelli, H. Guo, New Mexico State University Gopal Gupta, University of Texas at Dallas
Practical Aspects for a working Compile Time Garbage Collection System for Mercury Nancy Mazur, Peter Ross, Gerda Janssens, Maurice Bruynooghe K.U. Leuven Fages' Theorem for Programs with Nested Expressions Esra Erdem and Vladimir Lifschitz University of Texas at Austin
Semantics of normal logic programs with embedded implications Fernando Orejas, Elvira Pino, Universidad Politecnica de Catalunya, Barcelona Edelmira Pasarella, Universidad Simon Bolivar, Caracas
Positive Boolean Functions as Multiheaded Clauses Jacob M. Howe and Andy King University of Kent, Canterbury,
An Order-sorted Deduction and Resolution with Implicitly Negative Sorts Ken Kaneiwa (National Institute of Informatics, Tokyo), Satoshi Tojo (Japan Advanced Institute of Science and Technology)
A Multi-Adjoint Logic Approach to Abductive Reasoning Jesus Medina, Manuel Ojeda-Aciego , Universidad de Malaga. Peter Vojtas, P.J. Safarik University, Kosice, Slovakia
Higher-Precision Groundness Analysis Michael Codish, Samir Genaim, Ben-Gurion University of the Negev Harald Sondergaard, Peter J. Stuckey, The University of Melbourne
Optimizing Compilation of Constraint Handling Rules Christian Holzbaur, University of Vienna Peter J. Stuckey, University of Melbourne Maria Garcia de la Banda, David Jeffrey, Monash University
Building Constraint Solvers with HAL Maria Garcia de la Banda, David Jeffery, Kim Marriott , Monash University, Australia Peter J. Stuckey, University of Melbourne, Australia Christian Holzbaur, University of Vienna, Austria
Understanding Memory Management in Prolog Systems Luís Fernando Castro, SUNY, Stony Brook, USA Vítor Santos Costa, Federal University of Rio de Janeiro, Brazil Proving correctness and completeness of normal programs - a declarative approach. Wlodzimierz Drabent, Polish Academy of Sciences, Warszawa Miroslawa Milkowska, Warsaw University
Speculative Beats Conservative Justification
Hai-Feng Guo, C.R. Ramakrishnan, I.V. Ramakrishnan SUNY Stony Brook, USA
On a Tabling Engine that can Exploit Or-Parallelism Ricardo Rocha, Fernando Silva, University of Porto, Portugal Vítor Santos Costa, Federal University of Rio de Janeiro, Brazil
Local and Symbolic Bisimulation using Tabled Constraint Logic Programming Samik Basu, Madhavan Mukund, C.R. Ramakrishnan, I.V. Ramakrishnan, Rakesh Verma SUNY Stony Brook, USA
A Simple Scheme for Implementing Tabled Logic Programming Systems based on Dynamic Reordering of Alternatives
Hai-Feng Guo, SUNY Stony Brook, USA Gopal Gupta, University of Texas at Dallas
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models K. Narayan Kumar, C.R. Ramakrishnan, Scott A. Smolka State University of New York at Stony Brook, USA
Logic Programming in a Fragment of Intutionistic Temporal Linear Logic Mutsunori BANBARA, Nara National College of Technology, Japan Kyoung-Sun KANG, Pusan University of Foreign Studies, Korea Takaharu HIRAI, Noyuki TAMURA, Kobe University, Japan
Well-founded and stable semantics for logic programs with aggregates Marc Denecker, Nikolay Pelov, Maurice Bruynooghe K.U. Leuven, Belgium
Revisiting the cardinality Operator and Introducing the cardinality-path Constraint Family Nicolas Beldiceanu and Mats Carlsson SICS, Sweden
A Computational Model for Functional Logic Deductive Databases Jesus Manuel Almendros Jimenez, Antonio Becerra Teron and Jaime Sanchez Hernandez Universidad de Almeria, Spain
A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases G. Greco, S. Greco and E. Zumpano University of Calabria, Italy
|