{"title": "Automated reasoning", "subjects": ["Computer logic", "Congresses", "Automatic theorem proving", "Computers", "Computer science", "Software engineering", "Logic design", "Artificial intelligence", "Symbolic and mathematical Logic"], "key": "/works/OL16965727W", "type": {"key": "/type/work"}, "covers": [2223254], "authors": [{"type": {"key": "/type/author_role"}, "author": {"key": "/authors/OL7208175A"}}, {"type": {"key": "/type/author_role"}, "author": {"key": "/authors/OL3180053A"}}], "description": {"type": "/type/text", "value": "Automated Reasoning: First International Joint Conference, IJCAR 2001 Siena, Italy, June 18\u201322, 2001 Proceedings<br />Author: Rajeev Gor\u00e9, 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)\n</li><li>SET Cardholder Registration: The Secrecy Proofs\n</li><li>Algorithms, Datastructures, and other Issues in Efficient Automated Deduction\n</li><li>The Description Logic ALCNH\n</li><li>NExpTime-Complete Description Logics with Concrete Domains\n</li><li>Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics\n</li><li>The Hybrid \u03bc-Calculus\n</li><li>The Inverse Method Implements the Automata Approach for Modal Satisfiability\n</li><li>Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL\n</li><li>Tableaux for Temporal Description Logic with Constant Domains\n</li><li>Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation\n</li><li>Instructing Equational Set-Reasoning with Otter\n</li><li>NP-Completeness of Refutability by Literal-Once Resolution\n</li><li>Ordered Resolution vs. Connection Graph resolution\n</li><li>A Model-Based Completeness Proof of Extended Narrowing and Resolution\n</li><li>A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality\n</li><li>Superposition and Chaining for Totally Ordered Divisible Abelian Groups\n</li><li>Context Trees\n</li><li>On the Evaluation of Indexing Techniques for Theorem Proving\n</li><li>Preferred Extensions of Argumentation Frameworks: Query, Answering, and Computation</li></ul>"}, "latest_revision": 5, "revision": 5, "created": {"type": "/type/datetime", "value": "2014-07-29T14:01:19.125900"}, "last_modified": {"type": "/type/datetime", "value": "2025-11-29T19:08:47.015734"}}