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

Brossura

ISBN 10: 9048150515 ISBN 13: 9789048150519

Casa editrice: Springer, 2010

Riassunto

1. BASIC CONCEPTS OF INTERACTIVE THEOREM PROVING Interactive Theorem Proving ultimately aims at the construction of powerful reasoning tools that let us (computer scientists) prove things we cannot prove without the tools, and the tools cannot prove without us. Interaction typi­ cally is needed, for example, to direct and control the reasoning, to speculate or generalize strategic lemmas, and sometimes simply because the conjec­ ture to be proved does not hold. In software verification, for example, correct versions of specifications and programs typically are obtained only after a number of failed proof attempts and subsequent error corrections. Different interactive theorem provers may actually look quite different: They may support different logics (first-or higher-order, logics of programs, type theory etc.), may be generic or special-purpose tools, or may be tar­ geted to different applications. Nevertheless, they share common concepts and paradigms (e.g. architectural design, tactics, tactical reasoning etc.). The aim of this chapter is to describe the common concepts, design principles, and basic requirements of interactive theorem provers, and to explore the band­ width of variations. Having a 'person in the loop', strongly influences the design of the proof tool: proofs must remain comprehensible, - proof rules must be high-level and human-oriented, - persistent proof presentation and visualization becomes very important.

Su questo libro

Contenuti

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. PartTwo: 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. Schum

Dettagli dell'edizione

• Editore: Springer
• Data di pubblicazione: 2010
• Lingua: Inglese
• ISBN 10: 9048150515
• ISBN 13: 9789048150519
• Rilegatura: Copertina flessibile
• Numero di pagine: 452
• Redattore: Bibel Wolfgang, Schmitt P.H.
• Contatto del produttore: non disponibile
• Persona responsabile: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Germania