Descripción del título
Automated Deduction - A Bas...
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
Monografía
monografia Rebiun27320268 https://catalogo.rebiun.org/rebiun/record/Rebiun27320268 m o d | cr nn 008mamaa 130125s1998 ne | o |||| 0|eng d 94-017-0435-X 10.1007/978-94-017-0435-9 doi CBUC 991001069384206712 CBUC 991013456353006708 CBUC 991003832299906714 CBUC 991011079297606709 eng HPL bicssc PHI011000 bisacsh 160 23 Automated Deduction - A Basis for Applications Volume I Foundations - Calculi and Methods Volume II Systems and Implementation Techniques Volume III Applications electronic resource] edited by Wolfgang Bibel, P.H. Schmitt 1st ed. 1998 Dordrecht Springer Netherlands Imprint: Springer 1998 Dordrecht Dordrecht Springer Netherlands Imprint: Springer 1 online resource (XIV, 434 p.) 1 online resource (XIV, 434 p.) Text txt computer c online resource cr Applied Logic Series 1386-2790 9 Includes index One Interactive Theorem Proving -- 1. Structured Specifications and Interactive Proofs with KIV -- 2. Proof Theory at Work: Program Development in the Minlog System -- 3. Interactive and automated proof construction in type theory -- 4. Integrating Automated and Interactive Theorem Proving -- Two Representation and Optimization Techniques -- 5. Term Indexing -- 6. Developing Deduction Systems: The Toolbox Style -- 7. Specifications of Inference Rules: Extensions of the PTTP Technique -- 8. Proof Analysis, Generalization and Reuse -- Three Parallel Inference Systems -- 9. Parallel Term Rewriting with PaReDuX -- 10. Parallel Theorem Provers Based on SETHEO -- 11. Massively Parallel Reasoning -- Four Comparision and Cooperation of Theorem Provers -- 12. Extension Methods in Automated Deduction -- 13. A Comparison of Equality Reasoning Heuristics -- 14. Cooperating Theorem Provers 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 English Logic Mathematical logic Artificial intelligence Software engineering Computer science—Mathematics Logic Mathematical Logic and Foundations Artificial Intelligence Software Engineering/Programming and Operating Systems Symbolic and Algebraic Manipulation Bibel, Wolfgang. editor. edt. http://id.loc.gov/vocabulary/relators/edt Schmitt, P.H. editor. edt. http://id.loc.gov/vocabulary/relators/edt 0-7923-5130-4 90-481-5051-5 Applied Logic Series 1386-2790 9