On nontermination of Knuth-Bendix algorithm
The well-known Knuth-Bendix completion algorithm which computes a confluent and finitely terminating term rewriting system from a given set of equations, can either terminate with success or abort or even nonterminate. Very little is known about the origin of nontermination of this algorithm. We study the structural properties of rewrite rules which cause nontermination. The notion of the crossed rules is introduced for these purposes. We look for sufficient conditions guaranteeing nontermination of algorithm in the presence of crossed rules. A special attention is devoted to a verifiable condition of such kind.
KeywordsCritical Pair Verifiable Condition Meta Rule Simple Word Problem Subterm Property
Unable to display preview. Download preview PDF.
- Av 84.Avenhaus,J.: On the termination of the Knuth-Bendix completion algorithm, 120/84, Universität Kaiserslautern, 1984Google Scholar
- De 85a.Dershowitz,N.: Termination of rewriting; Report R-85-1220, University of Illinois at Urbana-Champaign, presented at 1st Int. Conf. on Rewriting Techniques and Applications (Dijon, France, May 85)Google Scholar
- De 85b.Dershowitz,N.-Marcus,L.-Tarlecki,A.: Existence, uniqueness, and construction of rewrite systems; unpublished manuscript, 1985Google Scholar
- HP 85.Hermann,M.-Prívara,I.: On nontermination of Knuth-Bendix algorithm; Research report VUSEI-AR-OPS-3/85Google Scholar
- Hu 80a.Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems; JACM 27, 4 (1980), 797–821.Google Scholar
- Hu 80b.Huet, G.: A complete proof of correctness of the Knuth-Bendix completion algorithm; Rapport 25, INRIA, 1980, also JCSS 23 (1980), 11–21Google Scholar
- KB 70.Knuth,D.E.-Bendix,P.: Simple word problems in universal algebras; in Computational Problems in Abstract Algebra (Ed. J.Leech), Pergamon PressGoogle Scholar
- Ki 85.Kirchner,H.: Preuves par complétion dans les variétés d'algèbres; Thèse de doctorat d'Etat, Université de NancyGoogle Scholar