Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 60,58
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Condizione: New. pp. 538.
Lingua: Inglese
Editore: Springer-Verlag New York Inc, 2007
ISBN 10: 3540735941 ISBN 13: 9783540735946
Da: Revaluation Books, Exeter, Regno Unito
EUR 83,48
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 1st edition. 522 pages. 9.25x6.00x1.25 inches. In Stock.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - A 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.
Lingua: Inglese
Editore: Berlin, Heidelberg: Springer-Verlag, 2007
ISBN 10: 3540735941 ISBN 13: 9783540735946
Da: Antiquariat Bernhardt, Kassel, Germania
EUR 70,20
Quantità: 1 disponibili
Aggiungi al carrelloBroschiert Broschiert. Condizione: Sehr gut. XII, 522 Seiten, Lecture Notes in Artificial Intelligence, Band 4603. Zust: Gutes Exemplar. Mit Vorbesitzereintrag. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 780.
Lingua: Inglese
Editore: Springer Berlin Heidelberg Jul 2007, 2007
ISBN 10: 3540735941 ISBN 13: 9783540735946
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 53,49
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A 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. 536 pp. Englisch.
Da: Majestic Books, Hounslow, Regno Unito
EUR 82,22
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 538 Illus.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 81,16
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 538.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2007
ISBN 10: 3540735941 ISBN 13: 9783540735946
Da: moluna, Greven, Germania
EUR 48,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A comprehensive overview: all current aspects of automated deduction are addressedPapers are organized in topical sections on a number of subjectsIncludes online files and updatesA veritable one-stop-shop for anyone looking to ge.
Lingua: Inglese
Editore: Springer, Springer Jul 2007, 2007
ISBN 10: 3540735941 ISBN 13: 9783540735946
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 536 pp. Englisch.