LEADER 05636nam 22007335 450 001 9910484284303321 005 20251226200324.0 010 $a3-540-73595-X 024 7 $a10.1007/978-3-540-73595-3 035 $a(CKB)1000000000490352 035 $a(SSID)ssj0000316396 035 $a(PQKBManifestationID)11241379 035 $a(PQKBTitleCode)TC0000316396 035 $a(PQKBWorkID)10263655 035 $a(PQKB)10677803 035 $a(DE-He213)978-3-540-73595-3 035 $a(MiAaPQ)EBC3063411 035 $a(MiAaPQ)EBC6413235 035 $a(PPN)123163714 035 $a(BIP)32371935 035 $a(BIP)14225734 035 $a(EXLCZ)991000000000490352 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomated Deduction - CADE-21 $e21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007, Proceedings /$fedited by Frank Pfenning 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XII, 524 p.) 225 1 $aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v4603 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-73594-1 320 $aIncludes bibliographical references and index. 327 $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 Methodsfor 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. 330 $aA veritable one-stop-shop for anyone looking to get up to speed on what is going down in the field of automated deduction right now. This book contains the refereed proceedings of the 21st International Conference on Automated Deduction, CADE-21, held in Bremen, Germany, in July 2007. The 28 revised full papers and 6 system descriptions presented were selected from 64 submissions. All current aspects of automated deduction are addressed, ranging from theoretical and methodological issues to presentation and evaluation of theorem provers and logical reasoning systems. 410 0$aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v4603 606 $aArtificial intelligence 606 $aMachine theory 606 $aComputer science 606 $aSoftware engineering 606 $aArtificial Intelligence 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 606 $aSoftware Engineering 615 0$aArtificial intelligence. 615 0$aMachine theory. 615 0$aComputer science. 615 0$aSoftware engineering. 615 14$aArtificial Intelligence. 615 24$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aSoftware Engineering. 676 $a511.3 702 $aPfenning$b Frank 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484284303321 996 $aAutomated Deduction – CADE-21$9772519 997 $aUNINA