Skip to main content
SpringerLink
Log in

An Algorithm for the Retrieval of Unifiers from Discrimination Trees

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We present a modification of the unification algorithm that 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 is reduced.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chang, C.-L. and Lee, R. C.-T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.

    Google Scholar 

  2. Christian, J.: Flatterms, discrimination nets, and fast term rewriting, J. Automated Reasoning 10 (1993), 95–113.

    Google Scholar 

  3. Gottlob, G. and Leitsch, A.: Fast subsumption algorithms, Proc. EUROCAL'85, LNCS 204, 1985, pp. 64–77.

  4. Graf, P.: Extended path-indexing, Alan Bundy (ed.), Proc. CADE 12, 1994, pp. 514–528.

  5. Joyner, W. H.: Resolution strategies as decision procedures, ACM 23(1) (1976), 398–417.

    Google Scholar 

  6. Kowalski, R. and Hayes, P. J.: Semantic trees in automated theorem proving, B. Meltzer and D. Michie (eds), Machine Intelligence 4, 1969.

  7. Loveland, D. W.: Automated Theorem Proving, A Logical Basis, North-Holland Publishing Company, Amsterdam, 1978.

    Google Scholar 

  8. McCune, W.: Experiments with discrimination-tree indexing and path indexing for term retrieval, J. Automated Reasoning 9 (1992), 147–167.

    Google Scholar 

  9. McCune, W.: OTTER 3.0 Reference Manual and Guide + source, obtainable from info.mcs.anl.gov, 1994.

  10. de Nivelle, H.: Resolution games and non-liftable resolution orderings, Proc. CSL'94, Springer-Verlag, 1994, pp. 279–293.

  11. de Nivelle, H.: An algorithm for the retrieval of unifiers from discrimination trees, L. Pereira and Orlowska (eds), Proc. JELIA'96, 1996.

  12. Paterson, M. S. and Wegman, M. N.: Linear unification, J. Comput. System Sci. 16(2) (1978), 158–167.

    Google Scholar 

  13. Robinson, J. A.: A machine oriented logic based on the resolution principle, ACM 12 (1965), 23–41.

    Google Scholar 

  14. Robinson, J. A.: Automated deduction with hyperresolution, Int. J. Computer Mathematics 1 (1965), 227–234.

    Google Scholar 

  15. Stickel, M.: The path-indexing method for indexing terms, Technical Note 473, Artificial Intelligence Center SRI International, Menlo Park CA, 1989.

    Google Scholar 

  16. Wos, L.: A note on McCune's article on discrimination trees, J. Automated Reasoning 9 (1992), 145–146.

    Google Scholar 

  17. Zamov, N. K.: On a bound for the complexity of terms in the resolution method, Trudy Mat. Inst. Steklov 128 (1972), 5–13.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, PO BOX 94079, 1090 GB, Amsterdam, The Netherlands

    Hans de Nivelle

Authors
  1. Hans de Nivelle
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

de Nivelle, H. An Algorithm for the Retrieval of Unifiers from Discrimination Trees. Journal of Automated Reasoning 20, 5–25 (1998). https://doi.org/10.1023/A:1005992522805

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1005992522805

Search

Navigation