000			04542nam a22005295i 4500
001			978-3-540-73595-3
003			DE-He213
005			20160624102109.0
007			cr nn 008mamaa
008			100301s2007 gw | s |||| 0|eng d
020			_a9783540735953 _9978-3-540-73595-3
024	7		_a10.1007/978-3-540-73595-3 _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 Deduction – CADE-21 _h[electronic resource] : _b21st International Conference on Automated Deduction Bremen, Germany, July 17-20, 2007 Proceedings / _cedited by Frank Pfenning.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007.
300			_aXII, 524 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 ; _v4603
505	0		_aSession 1. Invited Talk: Colin Stirling -- Games, Automata and Matching -- Session 2. Higher-Order Logic -- Formalization of Continuous Probability Distributions -- Compilation as Rewriting in Higher Order Logic -- Barendregt’s Variable Convention in Rule Inductions -- Automating Elementary Number-Theoretic Proofs Using Gröbner Bases -- Session 3. Description Logic -- Optimized Reasoning in Description Logics Using Hypertableaux -- Conservative Extensions in the Lightweight Description Logic -- An Incremental Technique for Automata-Based Decision Procedures -- Session 4. Intuitionistic Logic -- Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4 -- A Labelled System for IPL with Variable Splitting -- Session 5. Invited Talk: Ashish Tiwari -- Logical Interpretation: Static Program Analysis Using Theorem Proving -- Session 6. Satisfiability Modulo Theories -- Solving Quantified Verification Conditions Using Satisfiability Modulo Theories -- Efficient E-Matching for SMT Solvers -- -Decision by Decomposition -- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic -- Session 7. Induction, Rewriting, and Polymorphism -- Improvements in Formula Generalization -- On the Normalization and Unique Normalization Properties of Term Rewrite Systems -- Handling Polymorphism in Automated Deduction -- Session 8. First-Order Logic -- Automated Reasoning in Kleene Algebra -- SRASS - A Semantic Relevance Axiom Selection System -- Labelled Clauses -- Automatic Decidability and Combinability Revisited -- Session 9. Invited Talk: K. Rustan M. Leino -- Designing Verification Conditions for Software -- Session 10. Model Checking and Verification -- Encodings of Bounded LTL Model Checking in Effectively Propositional Logic -- Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems -- The KeY system 1.0 (Deduction Component) -- KeY-C: A Tool for Verification of C Programs -- The Bedwyr System for Model Checking over Syntactic Expressions -- System for Automated Deduction (SAD): A Tool for Proof Verification -- Session 11. Invited Talk: Peter Baumgartner -- Logical Engineering with Instance-Based Methods -- Session 12. Termination -- Predictive Labeling with Dependency Pairs Using SAT -- Dependency Pairs for Rewriting with Non-free Constructors -- Proving Termination by Bounded Increase -- Certified Size-Change Termination -- Session 13. Tableaux and First-Order Systems -- Encoding First Order Proofs in SAT -- Hyper Tableaux with Equality -- System Description: E- KRHyper -- System Description: Spass Version 3.0.
650		0	_aComputer science.
650		0	_aSoftware engineering.
650		0	_aLogic design.
650		0	_aArtificial intelligence.
650	1	4	_aComputer Science.
650	2	4	_aArtificial Intelligence (incl. Robotics).
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aLogics and Meanings of Programs.
650	2	4	_aSoftware Engineering.
700	1		_aPfenning, Frank. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540735946
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v4603
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-540-73595-3
942			_2EBK7703 _cEBK
999			_c36997 _d36997