Abstract
Automated and interactive theorem proving are the two main directions in the field of deduction. Most chapters of this book belong to either the one or the other, whether focusing on theory, on methods or on systems. This reflects the fact that, for a long time, research in computer-aided reasoning was divided into these two directions, driven forward by different communities. Both groups offer powerful tools for different kinds of tasks, with different solutions, leading to different performance and application profiles. Some important examples are: ACL2 (Kaufmann and Moore, 1988), HOL (Gordon, 1988), IMPS (Farmer et al., 1996), Isabelle (Paulson, 1994), KIV (Reif et al., 1997) (see also Chapter II.1.1), NQTHM (Boyer and Moore, 1979), and PVS (Owre et al., 1992) for the interactive (or tactical) theorem proving community; and KoMeT (Bibel et al., 1994), Otter (Wos et al., 1992), Protein (Baumgartner and Furbach, 1994), Setheo (Goller et al., 1994), Spass (Weidenbach et al., 1996), and 3 TAP (Beckert et al., 1996) for the automated theorem proving community.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Archer, M., G. Fink, and L. Yang: 1993, `Linking Other Theorem Provers to HOL using PM: Proof Manager’. In: L. Claesen and M. Gordon (eds.): Higher Order Logic Theorem Proving and its Applications: 4th International Workshop, HUG’92.
Ballarin, C., K. Homann, and J. Calmet: 1995, `Theorems and Algorithms: An Interface between Isabelle and Maple’. In: A. H. M. Levelt (ed.): International Symposium on Symbolic and Algebraic Computation. pp. 150–157.
Baumgartner, R and U. Furbach: 1994, `PROTEIN: A Prover with a Theory Extension Interface’. In: A. Bundy (ed.): Proc. 12th CADE, Nancy, France, Vol. 814 of LNCS. pp. 769–773.
Beckert, B.: 1994, `A Completion-Based Method for Mixed Universal and Rigid E-Unification’. In: A. Bundy (ed.): Proc. 12th CADE, Nancy, France, Vol. 814 of LNCS. pp. 678–692.
Beckert, B., R. Hähnle, R Oel, and M. Sulzmann: 1996, `The Tableau-Based Theorem Prover 3TAP, Version 4.0’. In: M. McRobbie and J. Slanley (eds.): Proc. 13th CADE, New Brunswick/NJ, USA, Vol. 1104 of LNCS. pp. 303–307.
Beckert, B., R. Hähnle, and P. H. Schmitt: 1993, `The Even More Liberalized 5-Rule in Free Variable Semantic Tableaux’. In: G. Gottlob, A. Leitsch, and D. Mundici (eds.): Proc. 3rd Kurt Gödel Colloquium (KGC), Brno, Czech Republic. pp. 108–119.
Beckert, B. and C. Pape: 1996, `Incremental Theory Reasoning Methods for Semantic Tableaux’. In: R Miglioli, U. Moscato, D. Mundici, and M. Ornaghi (eds.): Proc. 5th TABLEAUX, Terrasini/Palermo, Italy, Vol. 1071 of LNCS. pp. 93–109.
Bibel, W., S. Brüning, U. Egly, and T. Rath: 1994, `KoMeT’. In: A. Bundy (ed.): Proc. 12th CADE, Nancy, France, Vol. 814 of LNCS. pp. 783–787.
Börger, E. and D. Rosenzweig: 1995, `The WAM—Definition and Compiler Correctness’. In: C. Beierle and L. Plumer (eds.): Logic Programming: Formal Methods and Practical Applications. North-Holland, pp. 21–90.
Boyer, R. and J. Moore: 1988, `Integrating decision procedures into heuristic theorem provers: A case study with linear arithmetic.’. Machine Intelligence 11. Oxford University Press.
Boyer, R. S. and J. S. Moore: 1979, A Computational Logic. Academic Press.
Busch, H.: 1994, `First-Order Automation for Higher-Order-Logic Theorem Proving’. In: T. F. Melham and J. Camilleri (eds.): Higher Order Logic Theorem Proving and its Applications: 7th International Workshop, Vol. 859 of LNCS. pp. 97–112.
Constable, R. L., S. E Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, D. J. Howe, T. B. Knoblock, N. P. Mendier, P. Panagaden, J. T. Sasaki, and S. F. Smith: 1986, Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall.
Daim, B., J. Gehne, T. Honigmann, L. Walther, and A. Wolf: 1995, `Integrating Logical Function with ILF’. System description, Humboldt-Universität zu Berlin.
Farmer, W. M., J. D. Guttman, and E J. T. Fâbrega: 1996, `IMPS: an update description’. In: M. McRobbie and J. Slanley (eds.): Proc. 13th CADE, New Brunswick/NJ, USA. pp. 298–302.
Fermüller, C., A. Leitsch, T. Tammet, and N. Zamov: 1993, Resolution Methods for the Decision Problem,Vol. 679 of LNCS. Springer-Verlag.
Fitting, M.: 1990, First-Order Logic and Automated Theorem Proving. Springer, New York, first edition.
Goller, C., R. Letz, K. Mayr, and J. Schumann: 1994, `SETHEO V3.2: Recent Developments — System Abstract’. In: A. Bundy (ed.): Proc. 12th CADE, Nancy, France, Vol. 814 of LNCS. pp. 778–782.
Gordon, M.: 1988, `HOL: A Proof Generating System for Higher-order Logic’. In: G. Birtwistle and P. Subrahmanyam (eds.): VLSI Specification and Synthesis. Kluwer Academic Publishers.
Hähnle, R. and S. Klingenbeck: 1996, `A-Ordered Tableaux’. J. of Logic and Computation 6 (6), 819–834.
Hähnle, R. and C. Pape: 1997, `Ordered Tableaux: Extensions and Applications’. In: D. Galmiche (ed.): Proc. International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Pont-à-Mousson, France, Vol. 1227 of LNCS. pp. 173–187.
Harrison, J. and L. Théry: 1993, `Extending the HOL Theorem Prover with a Computer Algebra System to Reason about the Reals’. In: J. J. Joyce and C.-J. H. Seger (eds.): Higher Order Logic Theorem Proving and its Applications: 6th International Workshop, HUG’93, Vancouver, Canada, Vol. 780 of LNCS. pp. 174–184.
Hutter, D., B. Langenstein, F. Koob, W. Reif, C. Sengler, W. Stephan, M. Ullmann, M. Wittmann, and A. Wolpers: 1995, `The VSE Development Method - A Way to Engineer High-Assurance Software Systems’. In: B. Gotzheim (ed.): GI/ITG Tagung Formale Beschreibungstechniken fir verteilte Systeme.
Hutter, D. and C. Sengler: 1996, `INKA: The Next Generation’. In: M. McRobbie (ed.): Proc. 13th CADE, New Brunswick/NJ, USA, Vol. 1104 of LNCS. pp. 288–292.
Joyce, J. and C. Seger: 1994, `The HOL-Voss System: Model-Checking inside a General-Purpose Theorem-Prover’. In: J. J. Joyce and C.-J. H. Seger (eds.): Higher Order Logic Theorem Proving and its Applications: 6th International Workshop, HUG’93. pp. 185 –198.
Kaufmann, M. and J. Moore: 1988, `Design Goals of ACL2’. Technical report 101, Computational Logic Inc.
Letz, R., J. Schumann, S. Bayerl, and W. Bibel: 1992, `SETHEO: A High-Perfomance Theorem Prover’. J. of Automated Reasoning 8 (2), 183–212.
Owre, S., S. Rajan, J. Rushby, N. Shankar, and M. Srivas: 1996, `PVS: Combining Specification, Proof Checking, and Model Checking’. In: R. Alur and T. A.
Henzinger (eds.): Computer-Aided Verification, CAV ‘86,Vol. 1102 of LNCS. New Brunswick, NJ, pp. 411–414.
Owre, S., J. M. Rushby, and N. Shankar: 1992, `PVS: A Prototype Verification System’. In: D. Kapur (ed.): Pmc. 11th CADE, Saratoga Springs/NY, USA, Vol. 607 of LNCS. Saratoga, NY, pp. 748–752.
Paulson, L. C.: 1994, Isabelle: A Generic Theorem Prover. Springer LNCS 828. Plaisted, D. A. and S. Greenbaum: 1986, `A Structure-Preserving Clause Form Translation’. Journal of Symbolic Computation 2, 293–304.
Reif, W.: 1995, W.: 1995, `The KIV-approach to Software Verification’. In: M. Broy and S. Jähnichen (eds.): KORSO: Methods, Languages, and Tools for the Construction of Correct Software—Final Report, LNCS 1009. Springer-Verlag.
Reif, W., G. Schellhorn, and K. Stenzel: 1997, `Proving System Correctness with KIV 3.0’. In: Proc. 14th CADE, Townsville, Australia, Vol. 1249 of LNCS. pp. 69–72.
Reif, W. and K. Stenzel: 1993, `Reuse of Proofs in Software Verification’. In: R. Shyamasundar (ed.): Proc. FST TCS, Bombay, India, Vol. 761 of LNCS. pp. 284–293.
Schellhorn, G. and W Ahrendt: 1997, `Reasoning about Abstract State Machines: The WAM Case Study’. Journal of Universal Computer Science (JUCS) 3(4), 377–380. Available at the URL: http://hyperg.iicm.tu-graz.ac.at/jucs/.
Schmitt, P. H.: 1994, `Proving WAM Compiler Correctness’. Interner Bericht 33/94, Universität Karlsruhe, Fakultät für Informatik.
Schneider, K., R. Kumar, and T. Kropf: 1992, `Integrating a first-order automatic prover in the HOL environment’. In: Higher Order Logic Theorem Proving and its Applications: 4th International Workshop, HUG’91.
Stenz, G.: 1997, `Beweistransformation in Gentzenkalkülen’. Diplomarbeit, Fakultät für Informatik, Universität Karlsruhe.
Strecker, M. and M. Sorea: 1997, `Integrating an Equality Prover into a Software Development System based on Type Theory’. In: G. Brewka, C. Habel, and B. Nebel (eds.): Proc. KI’97, Vol. 1303 of LNCS. pp. 147–158.
Weidenbach, C., B. Gaede, and G. Rock: 1996, `SPASS & FLOTTER, Version 0.42’. In: M. McRobbie and J. Slanley (eds.): Proc. 13th CADE, New Brunswick/NJ, USA, Vol. 1104 of LNCS. pp. 141–145.
Wos, L., R. Overbeek, E. Lusk, and J. Boyle: 1992, Automated Reasoning, Introduction and Applications (2nd ed.). McGraw Hill.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Ahrendt et al. (1998). Integrating Automated and Interactive Theorem Proving. In: Bibel, W., Schmitt, P.H. (eds) Automated Deduction — A Basis for Applications. Applied Logic Series, vol 9. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0435-9_4
Download citation
DOI: https://doi.org/10.1007/978-94-017-0435-9_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5051-9
Online ISBN: 978-94-017-0435-9
eBook Packages: Springer Book Archive