Abstract
Indexing techniques support the retrieval and maintenance of large sets of terms. There is also an indexing method called substitution tree indexing that efficiently handles sets of substitutions. We present three advanced indexing operations for substitution trees: The multi-merge for the simultaneous unification of sets of substitutions, the subsumption operation on two sets of substitutions, and the selection of ‘lightest’ substitutions of a set of substitutions. The indexing operations can be combined to obtain powerful reasoning tools for theorem provers.
This work was supported by the German Science Foundation (DFG).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Butler and R. Overbeek. Formula databases for high-performance resolution/paramodulation systems. Journal of Automated Reasoning, 12:139–156, 1994.
C.L. Chang and R.C.T. Lee. Symbolic Logic and Mechanical Theorem Proving. Computer Science and Applied Mathematics. Academic Press, New York, New York, 1973.
P. Graf. Substitution tree indexing. In 6th International Conference on Rewriting Techniques and Applications RTA-95, pages 117–131. Springer LNCS 914, 1995.
P. Graf. Term Indexing. Springer LNAI 1053, 1996.
J.D. McCharen, R. Overbeek, and L. Wos. Complexity and related enhancements for automated theorem-proving programs. Computers and Mathematics with Applications, 2:1–16, 1976.
W. McCune. Experiments with discrimination-tree indexing and path-indexing for term retrieval. Journal of Automated Reasoning, 9(2):147–167, October 1992.
C. Meyer. Parallel Unit Resulting Resolution. Diploma thesis, Universität des Saarlandes, Saarbrücken, Germany, 1996. http://www.mpi-sb.mpg.de/papers/masters_theses/meyer.ps.gz.
H.J. Ohlbach. Abstraction tree indexing for terms. In Proceedings of the 9th European Conference on Artificial Intelligence, pages 479–484. Pitman Publishing, London, August 1990.
J. A. Robinson. Automated deduction with hyper-resolution. International Journal of Comp. Mathematics, 1:227–234, 1965.
J.A.Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23–41, 1965.
L. Wos. Note on McCune's article on discrimination trees. Journal of Automated Reasoning, 9(2):145–146, 1992.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Graf, P., Meyer, C. (1996). Advanced indexing operations on substitution trees. In: McRobbie, M.A., Slaney, J.K. (eds) Automated Deduction — Cade-13. CADE 1996. Lecture Notes in Computer Science, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61511-3_113
Download citation
DOI: https://doi.org/10.1007/3-540-61511-3_113
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61511-8
Online ISBN: 978-3-540-68687-3
eBook Packages: Springer Book Archive