Fast Knuth-Bendix completion: Summary-Reference-Cited by-同舟云学术

Fast Knuth-Bendix completion: Summary

Published:1989 Issue: Volume: Page:551-555
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Christian Jim

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-51081-8_136.pdf

Reference8 articles.

1. J-P. Jouannaud, H. Kirchner. (1984) Completion of a Set of Rules Modulo a Set of Equations. Proceedings 11th POPL, Salt Lake City.

2. C. Kirchner. (1987) Methods and Tools for Equational Unification. Proceedings of the Colloquium on the Resolution of Equations in Algebraic Structures, Lakeway, Texas.

3. D. Knuth and P. Bendix. (1970) Simple Word Problems in Universal Algebras. in J. Leech, ed., Computational Problems in Abstract Algebra, 263–297, Pergamon Press, Oxford, U.K.

4. D. Lankford, M. Ballantyne. (1977) Decision Procedures for Simple Equational Theories with Commutative Axioms: Complete Sets of Commutative Reductions. U.T. Austin Math Tech Report ATP-35.

5. P. Lincoln and J. Christian. (1988) Adventures in Associative-Commutative Unification. Proceedings CADE-9 358–367. Full version to appear in Journal of Symbolic Computation.

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

1. A Low-Level Index for Distributed Logic Programming;Electronic Proceedings in Theoretical Computer Science;2020-09-19

2. Multi-Completion with Termination Tools;Journal of Automated Reasoning;2012-04-14

3. On gaining efficiency in completion-based theorem proving;Rewriting Techniques and Applications;1996

4. WALDMEISTER: High performance equation theorem proving;Design and Implementation of Symbolic Computation Systems;1996

5. Design and implementation of jump tables for fast indexing of logic programs;Programming Languages: Implementations, Logics and Programs;1995