000 04068nam a22005655i 4500
001 978-3-540-31822-4
003 DE-He213
005 20240423125910.0
007 cr nn 008mamaa
008 100316s2005 gw | s |||| 0|eng d
020 _a9783540318224
_9978-3-540-31822-4
024 7 _a10.1007/11554554
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aAutomated Reasoning with Analytic Tableaux and Related Methods
_h[electronic resource] :
_bInternational Conference, TABLEAUX 2005, Koblenz, Germany, September 14-17, 2005, Proceedings /
_cedited by Bernhard Beckert.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXIV, 346 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 Artificial Intelligence,
_x2945-9141 ;
_v3702
505 0 _aInvited 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.
650 0 _aArtificial intelligence.
650 0 _aMachine theory.
650 0 _aComputer programming.
650 0 _aSoftware engineering.
650 1 4 _aArtificial Intelligence.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aProgramming Techniques.
650 2 4 _aSoftware Engineering.
700 1 _aBeckert, Bernhard.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540289319
776 0 8 _iPrinted edition:
_z9783540815594
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v3702
856 4 0 _uhttps://doi.org/10.1007/11554554
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c182878
_d182878