Automated Deduction – CADE-21 21st International Conference on Automated Deduction Bremen, Germany, July 17-20, 2007 Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Pfenning, Frank (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
Σειρά:Lecture Notes in Computer Science, 4603
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04524nam a22005295i 4500
001 978-3-540-73595-3
003 DE-He213
005 20151123192002.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540735953  |9 978-3-540-73595-3 
024 7 |a 10.1007/978-3-540-73595-3  |2 doi 
040 |d GrThAP 
050 4 |a Q334-342 
050 4 |a TJ210.2-211.495 
072 7 |a UYQ  |2 bicssc 
072 7 |a TJFM1  |2 bicssc 
072 7 |a COM004000  |2 bisacsh 
082 0 4 |a 006.3  |2 23 
245 1 0 |a Automated Deduction – CADE-21  |h [electronic resource] :  |b 21st International Conference on Automated Deduction Bremen, Germany, July 17-20, 2007 Proceedings /  |c edited by Frank Pfenning. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2007. 
300 |a XII, 524 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4603 
505 0 |a Session 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 |a Computer science. 
650 0 |a Software engineering. 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Mathematical Logic and Formal Languages. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Software Engineering. 
700 1 |a Pfenning, Frank.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540735946 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4603 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-73595-3  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)