Rigid E-Unification Revisited

  • Ashish Tiwari
  • Leo Bachmair
  • Harald Ruess
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1831)

Abstract

This paper presents a sound and complete set of abstract transformation rules for rigid E-unification. Abstract congruence closure, syntactic unification and paramodulation are the three main components of the proposed method. The method obviates the need for using any complicated term orderings and easily incorporates suitable optimization rules. Characterization of substitutions as congruences allows for a comparatively simple proof of completeness using proof transformations. When specialized to syntactic unification, we obtain a set of abstract transition rules that describe a class of efficient syntactic unification algorithms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)Google Scholar
  2. 2.
    Bachmair, L., Ramakrishnan, C., Ramakrishnan, I.V., Tiwari, A.: Normalization via rewrite closures. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 190–204. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  3. 3.
    Bachmair, L., Ramakrishnan, I.V., Tiwari, A., Vigneron, L.: Congruence closure modulo associativity and commutativity. In: Kirchner, H. (ed.) FroCos 2000. LNCS(LNAI), vol. 1794, pp. 245–259. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  4. 4.
    Bachmair, L., Tiwari, A.: Abstract congruence closure and specializations. In: McAllester, D. (ed.) 17th Intl Conf on Automated Deduction (2000)Google Scholar
  5. 5.
    Becher, G., Petermann, U.: Rigid unification by completion and rigid paramodulation. In: Dreschler-Fischer, L., Nebel, B. (eds.) KI 1994. LNCS(LNAI), vol. 861, pp. 319–330. Springer, Heidelberg (1994)Google Scholar
  6. 6.
    Beckert, B.: A completion-based method for mixed universal and rigid E- unification. In: Bundy, A. (ed.) CADE 1994. LNCS(LNAI), vol. 814, pp. 678–692. Springer, Heidelberg (1994)Google Scholar
  7. 7.
    Degtyarev, A., Voronkov, A.: The undecidability of simultaneous rigid E- unification. Theoretical Computer Science 166(1-2), 291–300 (1996)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Degtyarev, A., Voronkov, A.: What you always wanted to know about rigid E-unification. Journal of Automated Reasoning 20(1), 47–80 (1998)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Gallier, J., Narendran, P., Plaisted, D., Snyder, W.: Rigid E-unification: Np- completeness and applications to equational matings. Information and Computation 87, 129–195 (1990)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Gallier, J., Narendran, P., Raatz, S., Snyder, W.: Theorem proving using equational matings and rigid E-unification. Journal of the Association for Computing Machinery 39(2), 377–429 (1992)MATHMathSciNetGoogle Scholar
  11. 11.
    Goubault, J.: A rule-based algorithm for rigid E-unification. In: Mundici, D., Gottlob, G., Leitsch, A. (eds.) KGC 1993. LNCS, vol. 713, pp. 202–210. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  12. 12.
    Kapur, D.: Shostak’s congruence closure as completion. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 23–37. Springer, Heidelberg (1997)Google Scholar
  13. 13.
    de Kogel, E.: Rigid E-unification simplified. In: Baumgartner, P., Posegga, J., Hähnle, R. (eds.) TABLEAUX 1995. LNCS(LNAI), vol. 918, pp. 17–30. Springer, Heidelberg (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Ashish Tiwari
    • 1
  • Leo Bachmair
    • 1
  • Harald Ruess
    • 2
  1. 1.Department of Computer ScienceSUNY at Stony BrookStony BrookU.S.A
  2. 2.SRI InternationalMenlo ParkU.S.A

Personalised recommendations