000 03899nam a22004815i 4500
001 978-3-540-45008-5
003 DE-He213
005 20160624101955.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 _a9783540450085
_9978-3-540-45008-5
024 7 _a10.1007/10722086
_2doi
050 4 _aQ334-342
050 4 _aTJ210.2-211.495
072 7 _aUYQ
_2bicssc
072 7 _aTJFM1
_2bicssc
072 7 _aCOM004000
_2bisacsh
082 0 4 _a006.3
_223
245 1 0 _aAutomated Reasoning with Analytic Tableaux and Related Methods
_h[electronic resource] :
_bInternational Conference, TABLEAUX 2000, St Andrews, Scotland, UK, July 3-7, 2000 Proceedings /
_cedited by Roy Dyckhoff.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2000.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2000.
300 _aX, 440 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1847
505 0 _aInvited 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.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aDyckhoff, Roy.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540676973
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1847
856 4 0 _uhttp://dx.doi.org/10.1007/10722086
942 _2EBK5119
_cEBK
999 _c34413
_d34413