Automated Reasoning with Analytic Tableaux and Related Methods
Subtitle: International Conference, TABLEAUX 2000 St Andrews, Scotland, UK, July 3-7, 2000 Proceedings (Lecture Notes in Computer Science)
Edition: 1 edition
Publisher: Springer
Published: July 26, 2000
Language: eng
Format: Paperback
Number of pages: 441
ISBN-13: 9783540676973
Subjects: Artificial intelligence; High level programming languages; Expert Systems; Automata; Computers; Medical / Nursing; Congresses; General; Artificial Intelligence - General; AI Logics; Automated Deduction; Computers / Artificial Intelligence; Formal Verification; Logic Reason Calculi; Mathematical Logics; Modal Logics; Tableaux Methods; Theorem Proving; Automatic theorem proving; Computer Science
Description: Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, TABLEAUX 2000, St Andrews, Scotland, UK, July 3-7, 2000 Proceedings<br />Author: Roy Dyckhoff<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-67697-3<br /> DOI: 10.1007/10722086<br /><br />Table of Contents:<p></p><ul><li>Tableau Algorithms for Description Logics
</li><li>Modality and Databases
</li><li>Local Symmetries in Propositional Logic
</li><li>Design and Results of TANCS-2000 Non-classical (Modal) Systems Comparison
</li><li>Consistency Testing: The RACE Experience
</li><li>Benchmark Analysis with FaCT
</li><li>MSPASS: Modal Reasoning by Translation and First-Order Resolution
</li><li>TANCS-2000 Results for DLP
</li><li>Evaluating *SAT on TANCS 2000 Benchmarks
</li><li>A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations
</li><li>A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus
</li><li>An Analytic Calculus for Quantified Propositional Gödel Logic
</li><li>A Tableau Method for Inconsistency-Adaptive Logics
</li><li>A Tableau Calculus for Integrating First-Order and Elementary Set Theory Reasoning
</li><li>Hypertableau and Path-Hypertableau Calculi for some Families of Intermediate Logics
</li><li>Variants of First-Order Modal Logics
</li><li>Complexity of Simple Dependent Bimodal Logics
</li><li>Properties of Embeddings from Int to S4
</li><li>Term-Modal Logics
</li><li>A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics</li></ul>