Logic for Programming, Artificial Intelligence, and Reasoning

8th International Conference, LPAR 2001 Havana, Cuba, December 3–7, 2001 Proceedings

Editors:

ISBN: 978-3-540-42957-9 (Print) 978-3-540-45653-7 (Online)

Table of contents (50 chapters)

previous Page of 3
  1. Invited Talk

    1. No Access

      Book Chapter

      Pages 1-23

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

  2. Verification

    1. No Access

      Book Chapter

      Pages 24-38

      On Bounded Specifications

    2. No Access

      Book Chapter

      Pages 39-54

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

    3. No Access

      Book Chapter

      Pages 55-69

      Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets

  3. Guarded Logics

    1. No Access

      Book Chapter

      Pages 70-84

      Games and Model Checking for Guarded Logics

    2. No Access

      Book Chapter

      Pages 85-99

      Computational Space Efficiency and Minimal Model Generation for Guarded Formulae

  4. Agents

    1. No Access

      Book Chapter

      Pages 100-109

      Logical Omniscience and the Cost of Deliberation

    2. No Access

      Book Chapter

      Pages 110-124

      Local Conditional High-Level Robot Programs

    3. No Access

      Book Chapter

      Pages 125-141

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

  5. Automated Theorem Proving

    1. No Access

      Book Chapter

      Pages 142-156

      Proof and Model Generation with Disconnection Tableaux

    2. No Access

      Book Chapter

      Pages 157-171

      Counting the Number of Equivalent Binary Resolution Proofs

  6. Automated Theorem Proving

    1. No Access

      Book Chapter

      Pages 172-185

      Splitting through New Proposition Symbols

    2. No Access

      Book Chapter

      Pages 186-200

      Complexity of Linear Standard Theories

    3. No Access

      Book Chapter

      Pages 201-216

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

  7. Non-classical Logics

    1. No Access

      Book Chapter

      Pages 217-232

      Unification in a Description Logic with Transitive Closure of Roles

    2. No Access

      Book Chapter

      Pages 233-248

      Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions

  8. Types

    1. No Access

      Book Chapter

      Pages 249-265

      Coherence and Transitivity in Coercive Subtyping

    2. No Access

      Book Chapter

      Pages 266-281

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

    3. No Access

      Book Chapter

      Pages 282-298

      Analysis of Polymorphically Typed Logic Programs Using ACI-Unification

  9. Experimental Papers

    1. No Access

      Book Chapter

      Pages 299-308

      Model Generation with Boolean Constraints

previous Page of 3