Logic for Programming, Artificial Intelligence, and Reasoning

1. Front Matter

   Pages I-XV

   PDF

2. Invited Talk

   1. Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.

      • Ian Hodkinson, Frank Wolter, Michael Zakharyaschev

      Pages 1-23

3. Verification

   1. On Bounded Specifications

      • Orna Kupferman, MosheY. Vardi

      Pages 24-38

   2. Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy

      • K. Schneider

      Pages 39-54

   3. Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets

      • Volker Diekert, Paul Gastin

      Pages 55-69

4. Guarded Logics

   1. Games and Model Checking for Guarded Logics

      • Dietmar Berwanger, Erich Grädel

      Pages 70-84

   2. Computational Space Efficiency and Minimal Model Generation for Guarded Formulae

      • Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt

      Pages 85-99

5. Agents

   1. Logical Omniscience and the Cost of Deliberation

      • Natasha Alechina, Brian Logan

      Pages 100-109

   2. Local Conditional High-Level Robot Programs

      • Sebastian Sardiña

      Pages 110-124

   3. A Refinement Theory that Supports Reasoning about Knowledge and Time for Synchronous Agents

      • Kai Engelhardt, Ron van der Meyden, Yoram Moses

      Pages 125-141

6. Automated Theorem Proving

   1. Proof and Model Generation with Disconnection Tableaux

      • Reinhold Letz, Gernot Stenz

      Pages 142-156

   2. Counting the Number of Equivalent Binary Resolution Proofs

      • Joseph D. Horton

      Pages 157-171

7. Automated Theorem Proving

   1. Splitting through New Proposition Symbols

      • Hans de Nivelle

      Pages 172-185

   2. Complexity of Linear Standard Theories

      • 1Christopher Lynch, Barbara Morawska

      Pages 186-200

   3. Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving

      • Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller

      Pages 201-216

8. Non-classical Logics

   1. Unification in a Description Logic with Transitive Closure of Roles

      • Franz Baader, Ralf Küsters

      Pages 217-232

   2. Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions

      • Guy Perrier

      Pages 233-248

9. Types

   1. Coherence and Transitivity in Coercive Subtyping

      • Yong Luo, Zhaohui Luo

      Pages 249-265

   2. A Type-Theoretic Approach to Induction with Higher-Order Encodings

      • Carsten Schürmann

      Pages 266-281

   3. Analysis of Polymorphically Typed Logic Programs Using ACI-Unification

      • Jan-Georg Smaus

      Pages 282-298

This volume contains the papers presented at the Eighth International C- ference on Logic for Programming, Arti?cial Intelligence and Reasoning (LPAR 2001), held on December 3-7, 2001, at the University of Havana (Cuba), together with the Second International Workshop on Implementation of Logics. There were 112 submissions, of which 19 belonged to the special subm- sion category of experimental papers, intended to describe implementations or comparisons of systems, or experiments with systems. Each submission was - viewed by at least three program committee members and an electronic program committee meeting was held via the Internet. The high number of submissions caused a large amount of work, and we are very grateful to the other 31 PC members for their e?ciency and for the quality of their reviews and discussions. Finally, the committee decided to accept 40papers in the theoretical ca- gory, and 9 experimental papers. In addition to the refereed papers, this volume contains an extended abstract of the invited talk by Frank Wolter. Two other invited lectures were given by Matthias Baaz and Manuel Hermenegildo. Apart from the program committee, we would also like to thank the other people who made LPAR 2001 possible: the additional referees; the Local Arran- ` gements Chair Luciano Garc´?a; Andr´es Navarro and Oscar Guell, ¨ who ran the internet-based submission software and the program committee discussion so- ware at the LSI Department lab in Barcelona; and Bill McCune, whose program committee management software was used.

• Artificial intelligence
• Automat
• automated theorem proving
• knowledge
• knowledge base
• knowledge-based system
• knowledge-based systems
• logic
• nonmonotonic reasoning
• programming
• proving
• semantics
• theorem proving
• verification

• Department of Software, Technical University of Catalonia, Barcelona, Spain

  Robert Nieuwenhuis

• Department of Computer Science, University of Manchester, Manchester, UK

  Andrei Voronkov

Policies and ethics