An algorithm for the retrieval of unifiers from discrimination trees
We present a modification of the unification algorithm which is adapted to the extraction of simultaneously unifiable literals from discrimination trees. The algorithm is useful for efficient implementation of binary resolution, hyperresolution, and paramodulation. The algorithm is able to traverse simultaneously more than one discrimination tree and to construct a unifier at the same time. In this way backtracking can be minimized.
KeywordsAutomated Theorem Proving Implementation Algorithms
Unable to display preview. Download preview PDF.
- [Chnglee73]C-L. Chang, R. C-T. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.Google Scholar
- [Graf94]P. Graf, Extended Path-Indexing, CADE 12, Ed. Alan Bundy, pp. 514–528, 1994.Google Scholar
- [KowHay69]R. Kowalski, P.J. Hayes, Semantic Trees in Automated Theorem Proving, Machine Intelligence 4, ed. B. Meltzer and D. Michie, 1969.Google Scholar
- [Lovlnd78]D. W. Loveland, Automated Theorem Proving, A Logical Basis, North Holland Publishing Company, Amsterdam, New York, Oxford, 1978.Google Scholar
- [McCune94]W. McCune, OTTER 3.0 Reference Manual and Guide + source, obtainable from info.mcs.anl.gov, 1994.Google Scholar
- [Nivelle94]H. de Nivelle, Resolution Games and Non-Liftable Resolution Orderings, In CSL'94, pp. 279–293, Springer Verlag, 1994.Google Scholar
- [Robins65a]J. A. Robinson, Automated Deduction with Hyperresolution, International Journal of Computer Mathematics 1, pp. 227–234, 1965.Google Scholar
- [Stickel89]M. Stickel, The Path-Indexing Method for Indexing Terms, Technical Note 473, Artificial Intelligence Center SRI International, Menlo Park CA, 1989.Google Scholar
- [Zam72]N.K. Zamov: On a Bound for the Complexity of Terms in the Resolution Method, Trudy Mat. Inst. Steklov 128, pp. 5–13, 1972.Google Scholar