Abstract
This paper describes how “safe” proof strategies are represented and executed in the interactive theorem prover GETFOL. A formal metatheory (MT) describes and allows to reason about object level inference. A class of MT terms, called logic, tactics, is used to represent proof strategies. The semantic attachment facility and the evaluation mechanism of the GETFOL system have been used to provide the procedural interpretation of logic tactics. The execution of logic tactics is then proved to be “safe” under the termination condition. The implementation within the GETFOL system is described and the synthesis of a logic tactic implementing a normalizer in negative normal form is presented as a case study.
This work has been partly done as part of the MAIA project developed at IRST. It has been partly supported by the Italian National Research Council (CNR), Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo (Special Project on Information Systems and Parallel Computing). The authors thank the members of the Mechanized Reasoning Group for useful feedback and discussions. Fausto Giunchiglia and Paolo Traverso are specially thanked for their previous work on tactics.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Armando and E. Giunchiglia. Embedding Complex Decision Procedures inside an Interactive Theorem Prover. Annals of Artificial Intelligence and Mathematics, 8(3–4), 1993. In press.
P.B. Andrews. Theorem Proving via General Matings. Journal of the ACM, 28(2):193–214, 1981.
W. Bibel. On Matrices with Connections. Journal of the A CM, 28(4):633–645, 1981.
R.S. Boyer and J.S. Moore. A Computational Logic. Academic Press, 1979. ACM monograph series.
R.L. Constable, S.F. Allen, H.M. Bromley, et al. Implementing Mathematics with the NuPRL Proof Development System. Prentice Hall, 1986.
N.G. deBruijn. The mathematical language automath. In Symposium in Automatic Demonstration, Lecture Notes in Mathematics, volume Vol. 125, pages 29–61. Springer-Verlag, 1970.
F. Giunchiglia and A. Armando. A Conceptual Architecture for Introspective Systems. Forthcoming IRST-Technical Report, 1993.
F. Giunchiglia and A. Cimatti. HGKM User Manual — HGKM version 2. Technical Report 9107-05, DIST — University of Genova, Genova, Italy, 1991.
F. Giunchiglia and A. Cimatti. Introspective Metatheoretic Reasoning. Technical Report 9211-21, IRST, Trento, Italy, 1992.
F. Giunchiglia and A. Cimatti. Introspective Metatheoretic Theorem Proving. Technical Report 9211-22, IRST, Trento, Italy, 1992.
F. Giunchiglia. The GETFOL Manual — GETFOL version 1. Technical Report 9204-01, DIST — University of Genova, Genoa, Italy, 1992. Forthcoming IRST-Technical Report.
M.J. Gordon, R. Milner, L. Morris, and C. Wadsworth. A Metalanguage for Interactive Proof in LCF. CSR report series CSR-16-77, Department of Artificial Intelligence, Dept. of Computer Science, University of Edinburgh, 1977.
M.J. Gordon, A.J. Milner, and C.P. Wadsworth. Edinburgh LCF — A mechanized logic of computation, volume 78 of Lecture Notes in Computer Science. Springer Verlag, 1979.
F. Giunchiglia and P. Traverso. Reflective reasoning with and between a declarative metatheory and the implementation code. In Proc. of the 12th International Joint Conference on Artificial Intelligence, pages 111–117, Sydney, 1991. Also IRST-Technical Report 9012-03, IRST, Trento, Italy.
F. Giunchiglia and P. Traverso. GETFOL User Manual — GETFOL version 1. Manual 9109-09, IRST, Trento, Italy, 1991. Also MRG-DIST Technical Report 9107-01, DIST, University of Genova.
F. Giunchiglia and P. Traverso. A Metatheory of a Mechanized Object Theory. Technical Report 9211-24, IRST, Trento, Italy, 1992.
F. Giunchiglia and P. Traverso. Program tactics and logic tactics. Technical Report 9301-01, IRST, Trento, Italy, 1993.
F. Giunchiglia, P. Traverso, A. Cimatti, and P. Pecchiari. A System for Multi-Level Reasoning. In A. Yonozawa and B.C. Smith, editors, Proc. IMSA '92 International Workshop on Reflection and Meta-level Architecture, pages 190–195, Tokyo, 1992. Also IRST-Technical Report 9211-18, IRST, Trento, Italy.
Z. Manna and R. Waldinger. A deductive approach to program synthesis. ACM Transactions on Programming Languages and Systems, 2:90–121, 1980.
L. Paulson. The Foundation of a Generic Theorem Prover. Journal of Automated Reasoning, 5:363–396, 1989.
D. Prawitz. Natural Deduction — A proof theoretical study. Almquist and Wiksell, Stockholm, 1965.
A. Robinson. A Machine oriented Logic Based on the resolution principle. Journal of the ACM, 12:23–41, 1965.
C. Walther. Argument-Bounded Algorithms as a Basis for Automated Termination Proofs. In Proc. of the 9th Conference on Automated Deduction, 1988.
R.W. Weyhrauch. Prolegomena to a Theory of Mechanized Formal Reasoning. Artif. Intell., 13(1):133–176, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Armando, A., Cimatti, A., Viganò, L. (1993). Building and executing proof strategies in a formal metatheory. In: Torasso, P. (eds) Advances in Artificial Intelligence. AI*IA 1993. Lecture Notes in Computer Science, vol 728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57292-9_37
Download citation
DOI: https://doi.org/10.1007/3-540-57292-9_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57292-3
Online ISBN: 978-3-540-48038-9
eBook Packages: Springer Book Archive