On nontermination of Knuth-Bendix algorithm-Reference-Cited by-同舟云学术

On nontermination of Knuth-Bendix algorithm

Published:1986 Issue: Volume: Page:146-156
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Hermann Mikuláš,Prívara Igor

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-16761-7_64.pdf

Reference8 articles.

1. Avenhaus,J.: On the termination of the Knuth-Bendix completion algorithm, 120/84, Universität Kaiserslautern, 1984

2. 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)

3. Dershowitz,N.-Marcus,L.-Tarlecki,A.: Existence, uniqueness, and construction of rewrite systems; unpublished manuscript, 1985

4. Hermann,M.-Prívara,I.: On nontermination of Knuth-Bendix algorithm; Research report VUSEI-AR-OPS-3/85

5. Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems; JACM 27, 4 (1980), 797–821.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. When is an extension of a specification consistent? Decidable and undecidable cases;Journal of Symbolic Computation;1991-09

2. On finite representations of infinite sequences of terms;Conditional and Typed Rewriting Systems;1991

3. Divergence phenomena during completion;Rewriting Techniques and Applications;1991

4. Chain properties of rule closures;Formal Aspects of Computing;1990-03

5. A decidable word problem without equivalent canonical term rewriting system;International Journal of Computer Mathematics;1989-01