Automated Reasoning

First International Joint Conference, IJCAR 2001 Siena, Italy, June 18–22, 2001 Proceedings

  • Rajeev Goré
  • Alexander Leitsch
  • Tobias Nipkow

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2083)

Table of contents

  1. Front Matter
    Pages I-XIII
  2. Invited Talks

  3. SET Cardholder Registration: The Secrecy Proofs

    1. Lawrence C. Paulson
      Pages 5-12
  4. Algorithms, Datastructures, and other Issues in Efficient Automated Deduction

  5. Description, Modal and temporal Logics

  6. Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics

    1. Volker Haarslev, Ralf Möller, Anni-Yasmin Turhan
      Pages 61-75
  7. The Hybrid μ-Calculus

    1. Ulrike Sattler, Moshe Y. Vardi
      Pages 76-91
  8. The Inverse Method Implements the Automata Approach for Modal Satisfiability

  9. Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL

  10. Tableaux for Temporal Description Logic with Constant Domains

    1. Carsten Lutz, Holger Sturm, Frank Wolter, Michael Zakharyaschev
      Pages 121-136
  11. Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation

  12. Saturation Based Theorem Proving, Applications, and Data Structures

    1. Andrea Formisano, Eugenio G. Omodeo, Marco Temperini
      Pages 152-167
    2. Reiner Hähnle, Neil V. Murray, Erik Rosenthal
      Pages 182-194
  13. A Model-Based Completeness Proof of Extended Narrowing and Resolution

  14. A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality

  15. Superposition and Chaining for Totally Ordered Divisible Abelian Groups

  16. Context Trees

    1. Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela
      Pages 242-256
  17. On the Evaluation of Indexing Techniques for Theorem Proving

    1. Robert Nieuwenhuis, Thomas Hillenbrand, Alexandre Riazanov, Andrei Voronkov
      Pages 257-271

About these proceedings

Keywords

Automat automata automated reasoning data structure data structures interactive theorem proving logic nonmonotonic reasoning programming proof theory proving theorem proving verification

Editors and affiliations

  • Rajeev Goré
    • 1
  • Alexander Leitsch
    • 2
  • Tobias Nipkow
    • 3
  1. 1.Automated Reasoning Project and Department of Computer ScienceAustralian National UniversityCanberraAustralia
  2. 2.AG Theoretische Informatik und Logik, Institut für ComputersprachenTechnische Universität WienWienAustria
  3. 3.Institut für InformatikTechnische Universität MünchenMünchenGermany

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45744-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42254-9
  • Online ISBN 978-3-540-45744-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book