000 | 03690nam a22004815i 4500 | ||
---|---|---|---|
001 | 978-3-540-69778-7 | ||
003 | DE-He213 | ||
005 | 20160624102100.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1998 gw | s |||| 0|eng d | ||
020 |
_a9783540697787 _9978-3-540-69778-7 |
||
024 | 7 |
_a10.1007/3-540-69778-0 _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’98 Oisterwijk, The Netherlands, May 5–8, 1998 Proceedings / _cedited by Harrie Swart. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1998. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1998. |
|
300 |
_aX, 325 pp. _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 ; _v1397 |
|
505 | 0 | _aExtended Abstracts of Invited Lectures -- Philosophical Aspects of Computerized Verification of Mathematics -- A Science of Reasoning (Extended Abstract) -- Model Checking: Historical Perspective and Example (Extended Abstract) -- Comparison -- Comparison of Theorem Provers for Modal Logics — Introduction and Summary -- FaCT and DLP -- Prover KT4 -- leanK 2.0 -- Logics Workbench 1.0 -- Optimised Functional Translation and Resolution -- Benchmark Evaluation of ?KE -- Abstracts of the Tutorials -- Implementation of Propositional Temporal Logics Using BDDs -- Computer Programming as Mathematics in a Programming Language and Proof System CL -- Contributed Research Papers -- A Tableau Calculus for Multimodal Logics and Some (Un)Decidability Results -- Hyper Tableau — The Next Generation -- Fibring Semantic Tableaux -- A Tableau Calculus for Quantifier-Free Set Theoretic Formulae -- A Tableau Method for Interval Temporal Logic with Projection -- Bounded Model Search in Linear Temporal Logic and Its Application to Planning -- On Proof Complexity of Circumscription -- Tableaux for Finite-Valued Logics with Arbitrary Distribution Modalities -- Some Remarks on Completeness, Connection Graph Resolution, and Link Deletion -- Simplification and Backjumping in Modal Tableau -- Free Variable Tableaux for a Logic with Term Declarations -- Simplification A General Constraint Propagation Technique for Propositional and Modal Tableaux -- A Tableaux Calculus for Ambiguous Quantifiation -- From Kripke Models to Algebraic Counter-Valuations -- Deleting Redundancy in Proof Reconstruction -- A New One-Pass Tableau Calculus for PLTL -- Decision Procedures for Intuitionistic Propositional Logic by Program Extraction -- Contributed System Descriptions -- The FaCT System -- Implementation of Proof Search in the Imperative Programming Language Pizza -- p-SETHEO: Strategy Parallelism in Automated Theorem Proving. | |
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 |
_aSwart, Harrie. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540644064 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1397 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-69778-0 |
942 |
_2EBK7359 _cEBK |
||
999 |
_c36653 _d36653 |