A theorem-proving approach to the Knuth-Bendix completion algorithm
The process of algebraic abstract data type completion has some similarities with resolution theorem-proving. In particular, some proof strategies developed in the field of computational logic are applicable to the Knuth-Bendix algorithm as completion strategies. Computational experiments confirm that these heuristics can indeed be employed to control, and limit, the generation of new rules during the completion process.
KeywordsCritical Pair Proof Strategy Computational Logic Completion Process Term Rewrite System
Unable to display preview. Download preview PDF.
- Huet G.: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. Journ. ACM, Vol 27, No 4, October 1980.Google Scholar
- Huet G.: A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm. Rapport de Recherche No 25, INRIA Le Chesnay, 1980.Google Scholar
- Huet G., Oppen D.C.: Equations and Rewrite Rules: a Survey. Techn. Report CSL-111, SRI international, January 1980.Google Scholar
- Knuth D.E., Bendix P.B.: Simple Word Problems in Universal Algebras. In: "Computational Problems in Abstract Algebra", Ed. Leech J., Pergamon, Oxford 1970, pp 263–297.Google Scholar
- Loos R.G.K: The Algorithm Description Language ALDES (Report). SIGSAM Bulletin of the ACM, Vol 10 Nr 1, Febr 1976.Google Scholar
- Nilsson N.J.: Problem Solving Methods in Artificial Intelligence. McGraw Hill 1971.Google Scholar
- Robinson J.A.: A Machine Oriented Logic Based on the Resolution Principle. Journ. ACM Vol 12 No 1, January 1965.Google Scholar