Automated reasoning

de Alexander Leitsch, Tobias Nipkow

Automated Reasoning: First International Joint Conference, IJCAR 2001 Siena, Italy, June 18–22, 2001 Proceedings<br />Author: Rajeev Goré, Alexander Leitsch, Tobias Nipkow<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42254-9<br /> DOI: 10.1007/3-540-45744-5<br /><br />Table of Contents:<p></p><ul><li>Program Termination Analysis by Size-Change Graphs (Abstract) </li><li>SET Cardholder Registration: The Secrecy Proofs </li><li>Algorithms, Datastructures, and other Issues in Efficient Automated Deduction </li><li>The Description Logic ALCNH </li><li>NExpTime-Complete Description Logics with Concrete Domains </li><li>Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics </li><li>The Hybrid μ-Calculus </li><li>The Inverse Method Implements the Automata Approach for Modal Satisfiability </li><li>Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL </li><li>Tableaux for Temporal Description Logic with Constant Domains </li><li>Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation </li><li>Instructing Equational Set-Reasoning with Otter </li><li>NP-Completeness of Refutability by Literal-Once Resolution </li><li>Ordered Resolution vs. Connection Graph resolution </li><li>A Model-Based Completeness Proof of Extended Narrowing and Resolution </li><li>A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality </li><li>Superposition and Chaining for Totally Ordered Divisible Abelian Groups </li><li>Context Trees </li><li>On the Evaluation of Indexing Techniques for Theorem Proving </li><li>Preferred Extensions of Argumentation Frameworks: Query, Answering, and Computation</li></ul>