Vor Ort
Merkzettel Warenkorb
  • Produktbild: Automated Deduction – CADE-22
  • Produktbild: Automated Deduction – CADE-22
Band 5663

Automated Deduction – CADE-22 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009. Proceedings

Aus der Reihe Lecture Notes in Computer Science

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

10.07.2009

Abbildungen

XIV, 504 p.

Herausgeber

Renate Schmidt

Verlag

Springer Berlin

Seitenzahl

504

Maße (L/B/H)

23,5/15,5/2,8 cm

Gewicht

779 g

Auflage

2009

Sprache

Englisch

ISBN

978-3-642-02958-5

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

10.07.2009

Abbildungen

XIV, 504 p.

Herausgeber

Renate Schmidt

Verlag

Springer Berlin

Seitenzahl

504

Maße (L/B/H)

23,5/15,5/2,8 cm

Gewicht

779 g

Auflage

2009

Sprache

Englisch

ISBN

978-3-642-02958-5

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Automated Deduction – CADE-22
  • Produktbild: Automated Deduction – CADE-22
  • Session 1. Invited Talk.- Integrated Reasoning and Proof Choice Point Selection in the Jahob System – Mechanisms for Program Survival.- Session 2. Combinations and Extensions.- Superposition and Model Evolution Combined.- On Deciding Satisfiability by DPLL( ) and Unsound Theorem Proving.- Combinable Extensions of Abelian Groups.- Locality Results for Certain Extensions of Theories with Bridging Functions.- Session 3. Minimal Unsatisfiability and Automated Reasoning Support.- Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis.- Does This Set of Clauses Overlap with at Least One MUS?.- Progress in the Development of Automated Theorem Proving for Higher-Order Logic.- Session 4. System Descriptions.- System Description: H-PILoT.- SPASS Version 3.5.- Dei: A Theorem Prover for Terms with Integer Exponents.- veriT: An Open, Trustable and Efficient SMT-Solver.- Divvy: An ATP Meta-system Based on Axiom Relevance Ordering.- Session 5. Invited Talk.- Instantiation-Based Automated Reasoning: From Theory to Practice.- Session 6. Interpolation and Predicate Abstraction.- Interpolant Generation for UTVPI.- Ground Interpolation for Combined Theories.- Interpolation and Symbol Elimination.- Complexity and Algorithms for Monomial and Clausal Predicate Abstraction.- Session 7. Resolution-Based Systems for Non-classical Logics.- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method.- A Refined Resolution Calculus for CTL.- Fair Derivations in Monodic Temporal Reasoning.- Session 8. Termination Analysis and Constraint Solving.- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs.- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic.- Session 9. Invited Talk.-Building Theorem Provers.- Session 10. Rewriting, Termination and Productivity.- Termination Analysis by Dependency Pairs and Inductive Theorem Proving.- Beyond Dependency Graphs.- Computing Knowledge in Security Protocols under Convergent Equational Theories.- Complexity of Fractran and Productivity.- Session 11. Models.- Automated Inference of Finite Unsatisfiability.- Decidability Results for Saturation-Based Model Building.- Session 12. Modal Tableaux with Global Caching.- A Tableau Calculus for Regular Grammar Logics with Converse.- An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability.- Session 13. Arithmetic.- Volume Computation for Boolean Combination of Linear Arithmetic Constraints.- A Generalization of Semenov’s Theorem to Automata over Real Numbers.- Real World Verification.