Abstract
In this paper we address the problem of strengthening the inferential capabilities of an interactive theorem prover with complex and reusable proof procedures. We focus on the construction of proof procedures built out of decision procedures for (decidable) quantifierfree theories. The idea is to build proof procedures in a structured way. A set of deciders provides the low-level reasoning capabilities, while the high-level (i.e. strategical) reasoning procedures are to be synthesized on top of it. The main goal of the paper is to show that this approach has many advantages and is of wide applicability. As a case study we consider the synthesis of a proof procedure for the existential fragment of first order logic built on top of a prepositional decider. This procedure is particularly well suited for describing our approach, since in it there is a neat separation between the prepositional and the first order reasoning components.
Keywords
The authors want to thank Alessandro Armando, Enrico Giunchiglia, and Fausto Giunchiglia for the many invaluable suggestions and comments. This work has been supported by the Italian National Research Council (CNR), Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo (Special Project on Information Systems and Parallel Computing).
Preview
Unable to display preview. Download preview PDF.
References
A. Armando and E. Giunchiglia. Embedding Complex Decision Procedures inside an Interactive Theorem Prover. Annals of Mathematics and Artificial Intelligence, 8(3–4):475–502, 1993.
P.B. Andrews. Theorem Proving via General Matings. Journal of the ACM, 28(2):193–214, 1981.
M. Büro and H. Kleine Büning. Report on a SAT competition. Technical Report Nr. 110, FB 17-Mathematik/Informatik Universität Paderborn, Nov. 1992.
W. Bibel. Automated Theorem Proving. Vieweg, Braunschweig, 1982.
R.S. Boyer and J.S. More. Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic. Machine Intelligence, 11:83–124, 1988.
B. Dreben and W.D. Goldfarb. The Decision problem — Solvable classes of quantificational formulas. Addison-Wesley Publishing Company Inc., 1979.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201–215, 1960.
P.C. Gilmore. A proof Method for Quantification Theory: its Justification and Realization. IBM Journal on Research and Development, 4:28–35, 1960.
F. Giunchiglia. The Getfol Manual — Getfol version 1. Technical Report 9204-01, DIST — University of Geneva, Genoa, Italy, 1992.
R.G. Jeroslow. Computation-Oriented Reduction of Predicate to Prepositional Logic. Decision Support System, 4:183–197, 1988.
W.H. Joyner. Resolution strategies as decision procedures. Journal of the ACM, 23(3):398–417, 1976.
S.J. Lee and D.A. Plaisted. Eliminating Duplication with the Hyper-Linking Strategy. Technical Report TR90-032, The University of North Carolina — Dept. of Computer Science, Aug. 1990.
G. Nelson and D.C. Oppen. Simplification by Cooperating Decision Procedures. ACM Transactions on Programming Languages and Systems, 1(2), Oct. 1979.
D. Prawitz. An improved proof procedure. Theoria, 26:102–139, 1960.
M. Stickel. Automated Deduction by Theory Resolution. Journal of Automated Reasoning, 4:333–356, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Manzo, M., Pecchiari, P. (1995). Composing decision procedures: the approach and a case study. In: Gori, M., Soda, G. (eds) Topics in Artificial Intelligence. AI*IA 1995. Lecture Notes in Computer Science, vol 992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60437-5_17
Download citation
DOI: https://doi.org/10.1007/3-540-60437-5_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60437-2
Online ISBN: 978-3-540-47468-5
eBook Packages: Springer Book Archive