There were 112 submissions (92 theoretical + 19 experimental).

Accepted theoretical:  40
Accepted experimental:  9
Rejected:              63




LPAR 2001 List of Accepted Papers.
==================================


A Local System for Classical Logic
   Kai Brünnler and Alwen Fernato Tiu

A Monotonic Higher-Order Semantic Path Ordering
   Cristina Borralleras and Albert Rubio

A Refinement Theory that Supports Reasoning about Knowledge and Time for Synchronous Agents
   Kai Engelhardt, Ron van der Meyden, Yoram Moses

A Type-Theoretic Appropach to Induction for Higher-order Encodings
   Carsten Schuermann

Analysis of Polymorphically Typed Logic Programs Using ACI-Unification
   Jan-Georg Smaus

Andorra Model Revised: Introducing Nested Domain Variables and a Targeted Local Search
   Rong Yang and Steve Gregory

Binding-time Annotations without Binding-time Analysis
   Wim Vanhoof and Maurice Bruynooghe 

Boolean Functions for Finite-Tree Dependencies
   R. Bagnara, E. Zaffanella, R. Gori, P. M. Hill

Coherence and transitivity in coercive subtyping
   Yong Luoand Zhaohui Luo 

Coherent composition of distributed knowledge-bases through abduction
   Ofer Arieli, Bert Van Nuffelen, Marc Denecker, Maurice Bruynooghe

Complexity of Linear Standard Theories
   Christopher Lynch and Barbara Morawska

Computational space efficiency and minimal model generation for guarded formulae  
   Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt

Concept Formation via Proof Planning Failure
   Raul Monroy

Counting the Number of Equivalent Binary Resolution Proofs
   Joseph D. Horton

Efficient Computation of the Well-Founded Model Using Update Propagation
   Andreas Behrend

Functional Logic Programming with Failure: a Set-oriented View
   F.J. López-Fraguas and J. Sánchez-Hernández 

Games and Model Checking for Guarded Logics
   DietmarBerwanger and Erich Graedel 

Herbrand's Theorem for Prenex Godel Logic and its Consequences for Theorem Proving
   M. Baaz, A. Ciabattoni, C.G. Fermueller

How to Transform an Analyzer into a Verifier
   Marco Comini, Roberta Gori, Giorgio Levi

Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy
   Klaus Schneider

Indexed Categories and Bottom-Up Semantics of Logic Programs
   Gianluca Amato, James Lipton

Inference of termination conditions for numerical loops in Prolog
   Alexander Serebrenik, Danny De Schreye

Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions
   Guy Perrier

Local Conditional High-Level Robot Programs
   Sebastian Sardina

Local Temporal Logic is Expressively Complete for Series Parallel Traces
   Volker Diekert, Paul Gastin

Logical omniscience and the cost of deliberation
   NatashaAlechina and Brian Logan 

On Bounded Specifications
   Orna Kupferman and Moshe Vardi

On termination of meta-programs
   Alexander Serebrenik, Danny De Schreye

Operational Semantics for Fixed-Point Logics on Constraint Databases
   Stephan Kreutzer

Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae
   Jussi Rintanen

Permutation Problems and Channelling Constraints
   Toby Walsh

Proof and Model Generation with Disconnection Tableaux
   Reinhold Letz & Gernot Stenz

Reasoning about Evolving Nonmonotonic Knowledge Bases
   Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits

Simplifying Binary Propositional Theories into Connected Components Twice as Fast
   Alvaro del Val

Splitting through New Proposition Symbols
   Hans de Nivelle

Tableaux for Reasoning About Atomic Updates
   Chris Fermueller, Georg Moser, Richard Zach

Termination of rewriting with strategy annotations
   Salvador Lucas

The functions provable by first order abstraction
   Daniel Leivant

Unification in a Description Logic with Transitive Closure of Roles
   Franz Baader and Ralf Kuesters

Census Data Repair: a challenging application of Disjunctive Logic Programming
   Enrico Franconi, Antonio Lauretti Palma, Nicola Leone, 
   Simona Perri, and Francesco Scarcello



Experimental Papers:
====================


A Computer Environment for Writing Ordinary Mathematical Proofs
   David McMath, Marianna Rozenfeld, Richard Sommer

Automated Proof Support for Interval Logics
   Thomas Marthedal Rasmussen

Certifying synchrony for free
   Sylvain Boulme and Gregoire Hamon

Efficient Negation Using Abstract Interpretation
   Susana Muńoz, Juan José Moreno, Manuel Hermenegildo

Inferring Termination Conditions for Logic Programs using Backwards Analysis
   Samir Genaim and Michael Codish

Model Generation with Boolean Constraints
   Miyuki Koshimura, Hiroshi Fujita, and Ryuzo Hasegawa

Reachability Analysis of Term Rewriting Systems with Timbuk
   Thomas Genet and Valerie Viet Triem Tong

The Elog Web Extraction Language
   R. Baumgartner, S. Flesca, G. Gottlob

First-Order Atom Definitions Extended
   Bijan Afshordel, Thomas Hillenbrand, Christoph Weidenbach