Abstract
We describe GAZER theorem proving system which was designed as a testbed for developing ideas about choosing which definitions and lemmas to use in the search for a proof. GAZER is a sequent calculus based system for first-order logic. The main novelty is the use of a new inference rule, gazing, which enables the system to determine which of a possibly large number of definitions and lemmas to use at any point in the proof. This decision is made on the basis of multiple abstractions of the current conjecture and of the database of definitions and lemmas. We have used gazer to prove theorems from naïve set theory, and a detailed comparison of the success of the gazing inference rule in cutting down the search for proofs of these theorems is presented in [BP89b].
This paper is based on work supported in part by Swarthmore College, through a summer research award to Alex Rothenberg, and through the college Research Support Fund.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
W.W. Bledsoe. The Ut interactive prover. Memo ATP-17B, Mathematics Department, University of Texas, April 1983.
R.S. Boyer and J S. Moore. A Computational Logic. ACM Monograph Series. Academic Press, 1979.
D. Barker-Plummer. The gazer theorem prover: Description and users guide. Technical Report CS-1989-15, Department of Computer Science, Duke University, Durham, North Carolina, 27706, USA, 1989.
D. Barker-Plummer. Gazing: An approach to the problem of definition expansion. Technical Report CS-1989-13, Department of Computer Science, Duke University, Durham, North Carolina, 27706, USA, 1989. To Appear in the Journal of Automated Reasoning.
F.M. Brown. Towards the automation of set theory and its logic. Artificial Intelligence, 10:281–316, 1978.
W.W. Bledsoe and M. Tyson. The Ut interactive prover. Memo ATP-17, Mathematics Department, University of Texas, May 1975.
A. Bundy. Finding a common currency — a new proof plan. Internal Note 159, Department of Artificial Intelligence, University of Edinburgh., January 1983.
G. Gentzen. Untersuchen über das logische schliessen [investigations into logical deduction]. In M.E. Szabo, editor, The Collected Papers of Gerhard Gentzen, chapter 3, pages 68–131. North-Holland, 1969. First appeared in 1935 as an article in Mathemaiische Zeitschrift 39. This work was accepted as Gentzen's Inaugural Dissertation at the University of Göttingen.
D. Plummer. Gazing: A Technique for Controlling the Use of Rewrite Rules. PhD thesis, Department of Artificial Intelligence, University of Edinburgh, May 1988.
E.D. Sacerdoti. Planning in a hierarchy of abstraction spaces. Artificial Intelligence, 5:115–135, 1974.
L. Wos. The problem of definition expansion and contraction. Journal of Automated Reasoning, 3(4), December 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barker-Plummer, D., Rothenberg, A. (1992). The GAZER theorem prover. In: Kapur, D. (eds) Automated Deduction—CADE-11. CADE 1992. Lecture Notes in Computer Science, vol 607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55602-8_212
Download citation
DOI: https://doi.org/10.1007/3-540-55602-8_212
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55602-2
Online ISBN: 978-3-540-47252-0
eBook Packages: Springer Book Archive