04617nam 22006135 450 991076756030332120200701225016.03-540-45008-410.1007/10722086(CKB)1000000000548797(SSID)ssj0000321538(PQKBManifestationID)11232826(PQKBTitleCode)TC0000321538(PQKBWorkID)10279782(PQKB)10467648(DE-He213)978-3-540-45008-5(MiAaPQ)EBC3087414(PPN)155196405(EXLCZ)99100000000054879720121227d2000 u| 0engurnn|008mamaatxtccrAutomated Reasoning with Analytic Tableaux and Related Methods International Conference, TABLEAUX 2000 St Andrews, Scotland, UK, July 3-7, 2000 Proceedings /edited by Roy Dyckhoff1st ed. 2000.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2000.1 online resource (X, 440 p.) Lecture Notes in Artificial Intelligence ;1847Bibliographic Level Mode of Issuance: Monograph3-540-67697-X Includes bibliographical references.Invited Lectures -- Tableau Algorithms for Description Logics -- Modality and Databases -- Local Symmetries in Propositional Logic -- Comparison -- Design and Results of TANCS-2000 Non-classical (Modal) Systems Comparison -- Consistency Testing: The RACE Experience -- Benchmark Analysis with FaCT -- MSPASS: Modal Reasoning by Translation and First-Order Resolution -- TANCS-2000 Results for DLP -- Evaluating *SAT on TANCS 2000 Benchmarks -- Research Papers -- A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations -- A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus -- An Analytic Calculus for Quantified Propositional Gödel Logic -- A Tableau Method for Inconsistency-Adaptive Logics -- A Tableau Calculus for Integrating First-Order and Elementary Set Theory Reasoning -- Hypertableau and Path-Hypertableau Calculi for some Families of Intermediate Logics -- Variants of First-Order Modal Logics -- Complexity of Simple Dependent Bimodal Logics -- Properties of Embeddings from Int to S4 -- Term-Modal Logics -- A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics -- Dual Intuitionistic Logic Revisited -- Model Sets in a Nonconstructive Logic of Partial Terms with Definite Descriptions -- Search Space Compression in Connection Tableau Calculi Using Disjunctive Constraints -- Matrix-Based Inductive Theorem Proving -- Monotonic Preorders for Free Variable Tableaux -- The Mosaic Method for Temporal Logics -- Sequent-Like Tableau Systems with the Analytic Superformula Property for the Modal Logics KB, KDB, K5, KD5 -- A Tableau Calculus for Equilibrium Entailment -- Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory -- Tableau Calculus for Only Knowing and Knowing At Most -- A Tableau-Like Representation Framework for Efficient Proof Reconstruction -- The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson’s Arithmetic Q -- System Descriptions -- Redundancy-Free Lemmatization in the Automated Model-Elimination Theorem Prover AI-SETHEO -- E-SETHEO: An Automated3 Theorem Prover.Lecture Notes in Artificial Intelligence ;1847Artificial intelligenceProgramming languages (Electronic computers)Mathematical logicArtificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Programming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Artificial intelligence.Programming languages (Electronic computers).Mathematical logic.Artificial Intelligence.Programming Languages, Compilers, Interpreters.Mathematical Logic and Formal Languages.006.3/33Dyckhoff Royedthttp://id.loc.gov/vocabulary/relators/edtTABLEAUX 2000BOOK9910767560303321Automated Reasoning with Analytic Tableaux and Related Methods2556460UNINA