Abstract
This paper presents a proof condensation (or redundancy elimination) procedure and heuristic rules that are used to enhance the tableau-based theorem prover HARP. The proof condensation procedure makes proofs easier to construct and more readable by excising redundancies from proof trees. Since the entire language of first-order logic is used without preprocessing, heuristics can be formulated to capture efficient and human-like deduction strategies. We also present evidence that the combination of these two techniques enable HARP to solve challenging problems such as Schubert's Steamroller.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E.W.Beth. The Foundations of Mathematics. North-Holland, 1965.
W. Bibel. "A Comparative Study of Several Proof Procedures". Artificial Intelligence (18, 1982), pp 269–293.
W.W.Bledsoe. The UT Interactive Prover. University of Texas at Austin, ATP-17B, 1983.
D.N. Cohen. Knowledge Based Theorem Proving and Learning. UMI Research Press, Ann Arbor, Michigan, 1981.
A.G.Cohn. "On the solution of Schubert's Steamroller in Many Sorted Logic". IJCAI85, pp 1169–1173.
M.C. Fitting. Proof Methods for Modal and Intuitionistic Logics. Reidel, Dordrecht, Holland, 1983.
J.Hintikka. Form and Content in Quantification Theory. Acta Philosophica Fennica 8, 1955.
R.C. Jeffrey. Formal Logic: Its Scope and Limits. McGraw-Hill, New York, 1967.
D. Loveland. Automated Theorem Proving: A Logical Basis. North Holland, New York, 1978.
N.V. Murray. "Completely Non-Clausal Theorem Proving". Artificial Intelligence (18, 1982), pp 67–85.
N.Nilsson. Principles of Artificial Intelligence. Tioga, Palo Alto, 1980.
J.A. Robinson. Logic: Form and Function. North Holland, New York, 1981.
W. Schonfeld. "Prolog extensions based on Tableau Calculus". IJCAI 85, pp 730–732.
R.M. Smullyan. First-Order Logic. Springer Verlag, Berlin, 1968.
W. Stegmuller, M.V. v.Kibed, Strukturtypen der Logik. Springer-Verlag, New York, 1984.
C.Walther. "A many-sorted calculus based on resolution and paramodulation". IJCAI 83, Vol. 2, pp 882–891.
C.Walther. "A mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution". Artificial Intelligence, (May 1985), pp 217–224.
G. Wrightson. Semantic Tableaux, Unification and Links. Technical Report CSD-ANZARP-84-001, 1984, Victoria University, Wellington, New Zealand.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oppacher, F., Suen, E. (1986). Controlling deduction with proof condensation and heuristics. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_105
Download citation
DOI: https://doi.org/10.1007/3-540-16780-3_105
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16780-8
Online ISBN: 978-3-540-39861-5
eBook Packages: Springer Book Archive