Fast Knuth-Bendix completion: Summary

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 355 LNCS, Issue , 1989, Pages 551-555

  Christian, Jim ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84919225394     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51081-8_136     Document Type: Conference Paper

References (8)

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.
6. R. Lusk, W. McCune, R. Overbeek. Implementation of Theorem Provers: An Argonne Perspective. Lecture notes from a seminar at CADE-9.
7. G. Peterson, M. Stickel. (1981) Complete Sets of Reductions for Some Equational Theories. JACM 28, 233-264.
8. D. H. Warren. (1983) An Abstract Prolog Instruction Set. SRI Technical Note 309.