Advanced indexing operations on substitution trees

  • Peter Graf
  • Christoph Meyer
Session 7B
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1104)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Butler and R. Overbeek. Formula databases for high-performance resolution/paramodulation systems. Journal of Automated Reasoning, 12:139–156, 1994.CrossRefGoogle Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    P. Graf. Substitution tree indexing. In 6th International Conference on Rewriting Techniques and Applications RTA-95, pages 117–131. Springer LNCS 914, 1995.Google Scholar
  4. 4.
    P. Graf. Term Indexing. Springer LNAI 1053, 1996.Google Scholar
  5. 5.
    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.CrossRefGoogle Scholar
  6. 6.
    W. McCune. Experiments with discrimination-tree indexing and path-indexing for term retrieval. Journal of Automated Reasoning, 9(2):147–167, October 1992.CrossRefGoogle Scholar
  7. 7.
    C. Meyer. Parallel Unit Resulting Resolution. Diploma thesis, Universität des Saarlandes, Saarbrücken, Germany, 1996. Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    J. A. Robinson. Automated deduction with hyper-resolution. International Journal of Comp. Mathematics, 1:227–234, 1965.Google Scholar
  10. 10.
    J.A.Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23–41, 1965.CrossRefGoogle Scholar
  11. 11.
    L. Wos. Note on McCune's article on discrimination trees. Journal of Automated Reasoning, 9(2):145–146, 1992.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations