Merkzettel Warenkorb
Produktbild: Automated Deduction - A Basis for Applications Volume I Foundations - Calculi and Methods Volume II Systems and Implementation Techniques Volume III A
Band 8 - 12%

Automated Deduction - A Basis for Applications Volume I Foundations - Calculi and Methods Volume II Systems and Implementation Techniques Volume III A

Aus der Reihe Applied Logic Series
12% sparen

187,99 € UVP 213,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Lieferung nach Hause

Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

30.06.1998

Herausgeber

Wolfgang Bibel + weitere

Verlag

Springer Netherland

Seitenzahl

481

Maße (L/B/H)

24,1/16/3,2 cm

Gewicht

1950 g

Auflage

1998

Sprache

Englisch

ISBN

978-0-7923-5129-0

Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

30.06.1998

Herausgeber

Verlag

Springer Netherland

Seitenzahl

481

Maße (L/B/H)

24,1/16/3,2 cm

Gewicht

1950 g

Auflage

1998

Sprache

Englisch

ISBN

978-0-7923-5129-0

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

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 - A Basis for Applications Volume I Foundations - Calculi and Methods Volume II Systems and Implementation Techniques Volume III A
  • Volume I: Foundations. Calculi and Methods. Preface; W. Bibel, P.H. Schmitt. Part One: Tableau and Connection Calculi. Introduction; U. Furbach. 1. Analytic Tableaux; B. Beckert, R. Hähnle. 2. Clausal Tableaux; R. Letz. 3. Variants of Clausal Tableaux; P. Baumgartner, U. Furbach. 4. Cuts in Tableaux; U. Egly. 5. Compressions and Extensions; W. Bibel, et al. Part Two: Special Calculi and Refinements. Introduction; U. Petermann. 6. Theory Reasoning; P. Baumgartner, U. Petermann. 7. Unification Theory; F. Baader, K.U. Schulz. 8. Rigid E-Unification; B. Beckert. 9. Sorted Unification and Tree Automata; C. Weidenbach. 10. Dimensions of Types in Logic Programming; G. Meyer, C. Beierle. 11. Equational Reasoning in Saturation-Based Theorem Proving; L. Bachmair, H. Ganzinger. 12. Higher-Order Rewriting and Equational Reasoning; T. Nipkow, C. Prehofer. 13. Higher-Order Automated Theorem Proving; M. Kohlhase. Index.

    Volume II: Systems and Implementation Techniques. Introduction; T. Nipkow, W. Reif. 1. Structured Specifications and Interactive Proofs with KIV; W. Reif, et al. 2. Proof Theory at Work: Program Development in the Minlog System; H. Benl, et al. 3. Interactive and Automated Proof Construction in Type Theory; M. Strecker, et al. 4. Integrating Automated and Interactive Theorem Proving; W. Ahrendt, et al. Part Two: Representation and Optimization Techniques. Introduction; J. Siekmann, D. Fehrer. 5. Term Indexing; P. Graf, D. Fehrer. 6. Developing Deduction Systems: The Toolbox Style; D. Fehrer. 7. Specifications of Inference Rules: Extensions of the PTTP Technique; G. Neugebauer, U. Petermann. 8. Proof Analysis, Generalization and Reuse; T. Kolbe, C. Walther. Part Three: Parallel Inference Systems. Introduction; W. Küchlin. 9. Parallel Term Rewriting with PaReDuX; R. Bündgen, et al. 10. Parallel Theorem Provers Based on SETHEO; J. Schumann, et al. 11. Massively Parallel Reasoning; S.-E. Bornscheuer, et al. Part Four: Comparison and Cooperation of Theorem Provers. Introduction; J. Avenhaus. 12. Extension Methods in Automated Deduction; M. Baaz, et al. 13. A Comparison of Equality Reasoning Heuristics; J. Denzinger, M. Fuchs. 14. Cooperating Theorem Provers; J. Denzinger, I. Dahn. Index.

    Volume III: Applications. Part One: Automated Theorem Proving in Mathematics. Introduction; M. Kohlhase. 1. Lattice-Ordered Groups in Deduction; I. Dahn. 2. Superposition Theorem Proving for Commutative Rings; J. Stuber. 3. How to Augment a Formal System with a Boolean Algebra Component; H.J. Ohlbach, J. Kühler. 4. Proof Planning: A practical Approach to Mechanized Reasoning in Mathematics; M. Kerber. Part Two: Automated Deduction in Software Engineering and hardware Design. Introduction; J. Schumann. 5. Program Synthesis; C. Kreitz. 6. Termination Analysis for Functional Programs; J. Giesl, et al. 7. The WAM Case Study: Verifying Compiler Correctness for Prolog with KIV; G. Schellhorn, W. Ahrendt. 8. Using Automated Theorem Provers in Verification of Protocols; I. Dahn, J. Schumann. 9. Theorem Proving in Large Theories; W. Reif, G. Schellhorn. 10. Analyzing Rule Sets for the Calculation of Banking Fees by a Theorem Prover with Constraints; F. Stolzenburg, B. Thomas. 11. Deduction-Based Software Component Retrieval; B. Fischer, et al. 12. Rewrite Based hardware Verification with ReDuX; R. Bündgen. Index.