Acta Informatica

, Volume 28, Issue 2, pp 95–119 | Cite as

Automating the Knuth Bendix ordering

  • Jeremy Dick
  • John Kalmus
  • Ursula Martin
Article

Abstract

Knuth and Bendix proposed a very versatile technique for ordering terms, based upon assigning weights to operators and then to terms by adding up the weights of the operators they contain. Our purpose in this paper is as follows. First we give some examples to indicate the flexibility of the method. Then we give a simple and practical algorithm, based on solving systems of linear inequalities, for determining whether or not a set of rules can be ordered by a Knuth Bendix ordering. We also describe how this algorithm may be incorporated in a completion procedure which thus considers all possible choices of weights which orient a given equation.

References

  1. [Be]
    Bellegarde, F.: Rewriting systems of FP expressions to reduce the number sequences yielded. Sci. Comput. Program.6, 11–34 (1986)Google Scholar
  2. [BM 79]
    Boyer, R.S., Moore, J.S.: A computational logic. New York: Academic Press 1979Google Scholar
  3. [BL]
    Ben Cherifa, A., Lescanne, P.: Termination of rewriting systems by polynomial interpretations and its implementation. Sci. Comput. Program.9, 137–160 (1987)Google Scholar
  4. [Ch 83]
    Chvatal, V.: Linear programming. New York: Freeman 1983Google Scholar
  5. [De 82]
    Dershowitz, N.: Orderings for term rewriting systems. Theor. Comp. Sci.17, 279–301 (1982)Google Scholar
  6. [De]
    Dershowitz, N.: Termination of rewriting. J. Symbol. Comput.3, 69–116 (1987)Google Scholar
  7. [DF 85]
    Forgaard, R., Detlefs, D.: A procedure for automatically proving the termination of a set of rewrite rules. Proceedings of the First International Conference on Rewriting Techniques and Applications. (Lect. Notes Comput. Sci., vol. 202) Berlin Heidelberg New York: Springer 1985Google Scholar
  8. [Di 85]
    Dick, A.J.J.: ERIL — Equational reasoning: an interactive laboratory. Rutherford Appleton Laboratory Report RAL-86-010, March 1985Google Scholar
  9. [DK 88]
    Dick, A.J.J., Kalmus J.R.: ERIL (Equational reasoning: an interactive laboratory). User's manual. Version R1.6, Rutherford Appleton Laboratory Report RAL-88-055, September 1988Google Scholar
  10. [Fe 68]
    Feferman, S.: Systems of predicative analysis II: Representation of ordinals. J. Symbol. Logic33, 193–220 (1968)Google Scholar
  11. [Ga 68]
    Gale, D.: The theory of linear economic models. New York: McGraw Hill 1960Google Scholar
  12. [H]
    Huet, G.: Confluent reductions: abstract properties and applications to term rewriting systems. J. Ass. Comp. Mach.27(4) 797–821 (1980), preliminary version in 18th Symposium on Foundations of Computer Science, IEEE, 1977Google Scholar
  13. [HL 78]
    Huet, G., Lankford, D.S.: On the uniform halting problem for term rewriting systems. Rapport Laboria 283, INRIA, March 1978Google Scholar
  14. [Hi 52]
    Higman, G.: Ordering by divisibility in abstract algebras. Proc LMS(3)2, 326–336 (1952)Google Scholar
  15. [HO 80]
    Huet, G., Oppen, D.C.: Equations and rewrite rules: a survey. In: Book, R. (ed.), Formal language theory, perspectives and open problems, pp. 349–405. New York: Academic Press 1980Google Scholar
  16. [KB 70]
    Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational problems in abstract algebra, pp. 263–297. New York: Pergamon Press 1970Google Scholar
  17. [Kr 68]
    Kreko, B.: Linear programming. London: Pitman 1968Google Scholar
  18. [L]
    Lankford, D.S.: Canonical algebraic simplification in computational logic. Mem ATP-25. Automatic Theorem Proving Project. University of Texas, Austin TX, May 1975Google Scholar
  19. [Le 83]
    Lescanne, P.: Computer experiments with the REVE term rewriting system generator, Proc 10th ACM POPL symposium, Austin, TX 1983, pp. 99–108Google Scholar
  20. [Le 86]
    Lescanne, P.: Divergence of the Knuth Bendix completion procedure and termination orderings. Bull. Eur. Assoc. Theoret. Comput. Sci.30, 80–83 (1986)Google Scholar
  21. [Le 87]
    Lescanne, P.: Private communicationGoogle Scholar
  22. [MN 70]
    Manna, Z., Ness, S.: On the termination of Markov algorithms. Proceedings of the Third Hawaii International Conference on System Science, Honolulu, HI, January 1970, pp. 789–792Google Scholar
  23. [Ma 87]
    Martin, U.: How to choose the weights in the Knuth Bendix ordering. Proceedings of the Second International Conference on Rewriting Techniques and Applications (RTA 87), Bordeaux, France, May 1987. (Lect. Notes Comput. Sci., vol. 256, pp. 42–53) Berlin Heidelberg New York: Springer 1987Google Scholar
  24. [O'D 77]
    O'Donnell, M.J.: Computing in systems described by equations (Lect Notes Comput. Sci., vol. 58) Berlin Heidelberg New York: Springer 1977Google Scholar
  25. [Ru 85]
    Rusinowitch, M.: Plaisted ordering and recursive decomposition ordering revisited. Proceedings of the First International Conference on Rewriting Techniques and Applications. (Lect. Notes Comput. Sci., vol. 202) Berlin Heidelberg New York: Springer 1985Google Scholar
  26. [Uz 58]
    Uzawa, H.: An elementary method for linear programming. In: Arrow, K.J., Hurwicz, L., Uzawa, H. (eds.) Studies in linear and non-linear programming, pp. 179–188. Stanford: Stanford University Press 1958Google Scholar

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Jeremy Dick
    • 1
  • John Kalmus
    • 1
  • Ursula Martin
    • 2
  1. 1.Informatics DepartmentRutherford Appleton LaboratoryDidcotUK
  2. 2.Department of Computer Science, Royal Holloway and Bedford New CollegeUniversity of LondonEghamUK

Personalised recommendations