Skip to main content
SpringerLink
Log in

Rigid E-unification simplified

  • Classical Logic — Extensions
  • Conference paper
  • First Online:
Book cover Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX 1995)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 918))

Abstract

If E is a set of equations and s and t are terms, then a rigid E-unifier for s and t is a substitution σ such that Eσ“=sσ≐tσ, where any free variables are treated as constants, they are not implicitly quantified.

In [4] it is shown that for a finite set E and terms s and t it is decidable whether or not there is a rigid E-unifier for s and t. However, the proof is complex and concepts like unfailing completion and term orderings play a dominant role. In the present paper a simpler method and proof are given.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Becher, U. Petermann: ‘Rigid Unification by Completion and Paramodulation'. In B. Nebel, L. Dreschler-Fischer (Eds.): ‘KI-94: Advances in Artificial Intelligence'. Lecture Notes in Artificial Intelligence 861, Springer (1994), pp.319–330.

    Google Scholar 

  2. B. Beckert: ‘Ein vervollständigungsbasiertes Verfahren zur Behandlung von Gleichheit in Tableaukalkül mit freien Variablen'. Master's Thesis Karlsruhe (TH) (1993), in German.

    Google Scholar 

  3. M. Fitting: ‘First-Order Logic and Automated Theorem Proving'. Springer Verlag (1990).

    Google Scholar 

  4. J.H. Gallier, P. Nerendran, S. Raatz, W. Snyder: ‘Theorem Proving Using Equational Matings and Rigid E-Unification'. Journal of the ACM 39(2) (1992), pp. 377–429.

    Article  Google Scholar 

  5. J. Goubault: ‘Rigid E-Unifiability is DEXPTIME-Complete'. Proceedings of the Ninth Annual Symposium on Logic in Computer Science, IEEE Computer Society Press (1994).

    Google Scholar 

  6. J. Goubault: ‘A Rule-Based Algorithm for Rigid E-Unification'. In: ‘3rd Kurt Gödel Colloquium’ 93'. Lecture Notes in Computer Science 713, Springer (1993).

    Google Scholar 

  7. J.W. Lloyd: ‘Foundations of Logic Programming'. Springer, (1984). id., Second, Extended Edition (1987).

    Google Scholar 

  8. W.M.J. Ophelders, H.C.M de Swart: ‘Tableaux versus Resolution; A Comparison'. Fundamenta Informaticae 18 (1993), pp. 109–127.

    Google Scholar 

  9. R.E. Shostak: ‘An Algorithm for Reasoning about Equality', Communications of the ACM 21 (1978), pp. 583–585.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Co-operation Centre of Tilburg and Eindhoven Universities (SOBU), c/o Tilburg University, P.O.Box 90153, 5000, LE Tilburg, Netherlands

    Eric de Kogel

Authors
  1. Eric de Kogel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Peter Baumgartner Reiner Hähnle Joachim Possega

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Kogel, E. (1995). Rigid E-unification simplified. In: Baumgartner, P., Hähnle, R., Possega, J. (eds) Theorem Proving with Analytic Tableaux and Related Methods. TABLEAUX 1995. Lecture Notes in Computer Science, vol 918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59338-1_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-59338-1_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59338-6

  • Online ISBN: 978-3-540-49235-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation