Automated Reasoning: First International Joint Conference, IJCAR 2001 Siena, Italy, June 18–22, 2001 Proceedings
Author: Rajeev Goré, Alexander Leitsch, Tobias Nipkow
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42254-9
DOI: 10.1007/3-540-45744-5

Table of Contents:

• Program Termination Analysis by Size-Change Graphs (Abstract)
  
• SET Cardholder Registration: The Secrecy Proofs
  
• Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
  
• The Description Logic ALCNH
  
• NExpTime-Complete Description Logics with Concrete Domains
  
• Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics
  
• The Hybrid μ-Calculus
  
• The Inverse Method Implements the Automata Approach for Modal Satisfiability
  
• Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL
  
• Tableaux for Temporal Description Logic with Constant Domains
  
• Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation
  
• Instructing Equational Set-Reasoning with Otter
  
• NP-Completeness of Refutability by Literal-Once Resolution
  
• Ordered Resolution vs. Connection Graph resolution
  
• A Model-Based Completeness Proof of Extended Narrowing and Resolution
  
• A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality
  
• Superposition and Chaining for Totally Ordered Divisible Abelian Groups
  
• Context Trees
  
• On the Evaluation of Indexing Techniques for Theorem Proving
  
• Preferred Extensions of Argumentation Frameworks: Query, Answering, and Computation