Automated deduction--a basis for applications.
Saved in:
| Imprint: | Dordrecht ; Boston : Kluwer Academic Publishers, c1998. |
|---|---|
| Description: | 3 v. ; 25 cm. |
| Language: | English |
| Series: | Applied logic series v.8-10 |
| Subject: | |
| Format: | Print Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/3365187 |
Table of Contents:
- Volume I. Foundations
- Calculi and Methods
- Preface
- Part 1. Tableau and Connection Calculi. Introduction
- 1. Analytic Tableaux
- 2. Clausal Tableaux
- 3. Variants of Clausal Tableaux
- 4. Cuts in Tableaux
- 5. Compressions and Extensions
- Part 2. Special Calculi and Refinements. Introduction
- 6. Theory Reasoning
- 7. Unification Theory
- 8. Rigid E-Unification
- 9. Sorted Unification and Tree Automata
- 10. Dimensions of Types in Logic Programming
- 11. Equational Reasoning in Saturation-Based Theorem Proving
- 12. Higher-Order Rewriting and Equational Reasoning
- 13. Higher-Order Automated Theorem Proving
- Index
- Volume II
- Introduction
- 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
- Part 2. Representation and Optimization Techniques. Introduction
- 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
- Part 3. Parallel Inference Systems. Introduction
- 9. Parallel Term Rewriting with PaReDuX
- 10. Parallel Theorem Provers Based on SETHEO
- 11. Massively Parallel Reasoning
- Part 4. Comparison and Cooperation of Theorem Provers. Introduction
- 12. Extension Methods in Automated Deduction
- 13. A Comparison of Equality Reasoning Heuristics
- 14. Cooperating Theorem Provers
- Index
- Volume III. Applications
- Part 1. Automated Theorem Proving in Mathematics. Introduction
- 1. Lattice-Ordered Groups in Deduction
- 2. Superposition Theorem Proving for Commutative Rings
- 3. How to Augment a Formal System with a Boolean Algebra Component
- 4. Proof Planning: A practical Approach to Mechanized Reasoning in Mathematics
- Part 2. Automated Deduction in Software Engineering and hardware Design. Introduction
- 5. Program Synthesis
- 6. Termination Analysis for Functional Programs
- 7. The WAM Case Study: Verifying Compiler Correctness for Prolog with KIV
- 8. Using Automated Theorem Provers in Verification of Protocols
- 9. Theorem Proving in Large Theories
- 10. Analyzing Rule Sets for the Calculation of Banking Fees by a Theorem Prover with Constraints
- 11. Deduction-Based Software Component Retrieval
- 12. Rewrite Based hardware Verification with ReDuX
- Index
