Skip to main content
  • Conference proceedings
  • © 2001

Automated Reasoning

First International Joint Conference, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings

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

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

Conference series link(s): IJCAR: International Joint Conference on Automated Reasoning

Conference proceedings info: IJCAR 2001.

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (59 papers)

  1. Front Matter

    Pages I-XIII
  2. SET Cardholder Registration: The Secrecy Proofs

    1. SET Cardholder Registration: The Secrecy Proofs

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

  4. Description, Modal and temporal Logics

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

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

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

    1. The Hybrid μ-Calculus

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

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

  9. Tableaux for Temporal Description Logic with Constant Domains

    1. Tableaux for Temporal Description Logic with Constant Domains

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

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

    1. Instructing Equational Set-Reasoning with Otter

      • Andrea Formisano, Eugenio G. Omodeo, Marco Temperini
      Pages 152-167
    2. Ordered Resolution vs. Connection Graph resolution

      • Reiner Hähnle, Neil V. Murray, Erik Rosenthal
      Pages 182-194
  12. A Model-Based Completeness Proof of Extended Narrowing and Resolution

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

  14. Superposition and Chaining for Totally Ordered Divisible Abelian Groups

  15. Context Trees

    1. Context Trees

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

    1. On the Evaluation of Indexing Techniques for Theorem Proving

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

Other Volumes

  1. Automated Reasoning

Editors and Affiliations

  • Automated Reasoning Project and Department of Computer Science, Australian National University, Canberra, Australia

    Rajeev Goré

  • AG Theoretische Informatik und Logik, Institut für Computersprachen, Technische Universität Wien, Wien, Austria

    Alexander Leitsch

  • Institut für Informatik, Technische Universität München, München, Germany

    Tobias Nipkow

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access