04607nam 22006375 450 99646541320331620200701081247.010.1007/11554554(CKB)1000000000213247(SSID)ssj0000316400(PQKBManifestationID)11285845(PQKBTitleCode)TC0000316400(PQKBWorkID)10275554(PQKB)10749660(DE-He213)978-3-540-31822-4(MiAaPQ)EBC3067667(PPN)123097452(EXLCZ)99100000000021324720100316d2005 u| 0engurnn|008mamaatxtccrAutomated Reasoning with Analytic Tableaux and Related Methods[electronic resource] International Conference, TABLEAUX 2005, Koblenz, Germany, September 14-17, 2005, Proceedings /edited by Bernhard Beckert1st ed. 2005.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2005.1 online resource (XIV, 346 p.) Lecture Notes in Artificial Intelligence ;3702Bibliographic Level Mode of Issuance: MonographPrinted edition: 9783540289319 Includes bibliographical references and index.Invited Talks -- Query Processing in Peer-to-Peer Systems: An Epistemic Logic Approach -- Description Logics in Ontology Applications -- Automated Reasoning in the Context of the Semantic Web -- Formal Versus Rigorous Mathematics: How to Get Your Papers Published -- Research Papers -- Consistency of Variable Splitting in Free Variable Systems of First-Order Logic -- On the Dynamic Increase of Multiplicities in Matrix Proof Methods for Classical Higher-Order Logic -- A Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic -- Cyclic Proofs for First-Order Logic with Inductive Definitions -- A Tableau-Based Decision Procedure for a Fragment of Graph Theory Involving Reachability and Acyclicity -- Embedding Static Analysis into Tableaux and Sequent Based Frameworks -- A Calculus for Type Predicates and Type Coercion -- A Tableau Calculus with Automaton-Labelled Formulae for Regular Grammar Logics -- Comparing Instance Generation Methods for Automated Reasoning -- An Order-Sorted Quantified Modal Logic for Meta-ontology -- A Redundancy Analysis of Sequent Proofs -- A Tableau Algorithm for Description Logics with Concrete Domains and GCIs -- The Space Efficiency of OSHL -- Efficient Query Processing with Compiled Knowledge Bases -- Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic -- Automatic ‘Descente Infinie’ Induction Reasoning -- A Decision Procedure for the Alternation-Free Two-Way Modal ?-Calculus -- On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency -- System Descriptions -- Pdk: The System and Its Language -- Proof Output and Transformation for Disconnection Tableaux -- LoTREC: Logical Tableaux Research Engineering Companion -- A Tableau-Based Explainer for DL Subsumption -- CondLean 3.0: Improving CondLean for Stronger Conditional Logics -- The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic Logic -- Unit Propagation in a Tableau Framework.Lecture Notes in Artificial Intelligence ;3702Artificial intelligenceMathematical logicComputer programmingSoftware engineeringArtificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Programming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Software Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/I14029Artificial intelligence.Mathematical logic.Computer programming.Software engineering.Artificial Intelligence.Mathematical Logic and Formal Languages.Programming Techniques.Software Engineering.006.3Beckert Bernhardedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465413203316Automated Reasoning with Analytic Tableaux and Related Methods2556460UNISA