Congruence closure modulo associativity and commutativity?

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

Volumn 1794, Issue , 2000, Pages 245-259

  Bachmair, L ^a   Ramakrishnan, I V ^a   Tiwari, A ^a   Vigneron, L ^b  

^a Stony Brook University   (United States)

^b LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ASSOCIATIVE-COMMUTATIVE; ASSOCIATIVITY; COMMUTATIVITY; COMPLETION ALGORITHMS; CONGRUENCE CLOSURE; REWRITE RULES; REWRITE SYSTEMS; TRANSITION RULE;

ARTIFICIAL INTELLIGENCE;

EID: 23044517715     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10720084_16     Document Type: Conference Paper

References (19)

1. L. Bachmair. Canonical Equational Proofs. Birkhäuser, Boston, 1991.
2. L. Bachmair and N. Dershowitz. Completion for rewriting modulo a congruence. Theoretical Computer Science, 67(2 & 3):173-201, Oct. 1989.
3. L. Bachmair, C. Ramakrishnan, I. Ramakrishnan, and A. Tiwari. Normalization via rewrite closures. In P. Narendran and M. Rusinowitch, editors, Proc. 10th Int. Conf. on Rewriting Techniques and Applications, volume 1631 of Lecture Notes in Computer Science, pages 190-204. Springer-Verlag, Trento, Italy, 1999.
4. A. M. Ballantyne and D. S. Lankford. New decision algorithms for finitely presented commutative semigroups. Comp. and Maths. with Appls., 7:159-165, 1981.
5. T. Becker and V. Weispfenning. Gröbner bases: a computational approach to commutative algebra. Springer-Verlag, Berlin, 1993.
6. N. Dershowitz and J. P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science (Vol. B: Formal Models and Semantics), Amsterdam, 1990. North-Holland.
7. N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Communications of the ACM, 22(8):465-476, 1979.
8. E. Domenjoud and F. Klay. Shallow AC theories. In Proceedings of the 2nd CCL Workshop, La Escala, Spain, Sept. 1993.
9. D. Kapur. Shostak's congruence closure as completion. In H. Comon, editor, Proceedings of the 8th International Conference on Rewriting Techniques and Applications, pages 23-37, 1997. Vol. 1232 of Lecture Notes in Computer Science, Springer, Berlin.
10. U. Koppenhagen and E. W. Mayr. An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals. In Y. D. Lakshman, editor, Proceedings of the International Symposium on Symbolic and Algebraic Computation, pages 55-62, 1996.
11. C. Marche. On ground AC-completion. In R. V. Book, editor, 4th International Conference on Rewriting Techniques and Applications, pages 411-422, 1991. Vol. 488 of Lecture Notes in Computer Science, Springer, Berlin.
12. E. W. Mayr and A. R. Meyer. The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics, 46:305-329, 1982.
13. P. Narendran and M. Rusinowitch. Any ground associative-commutative theory has a finite canonical system. In R. V. Book, editor, 4th International Conference on Rewriting Techniques and Applications, pages 423-434, 1991. Vol. 488 of Lecture Notes in Computer Science, Springer, Berlin.
14. G. Nelson and D. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, October 1979.
15. G. Nelson and D. Oppen. Fast decision procedures based on congruence closure. Journal of the Association for Computing Machinery, 27(2):356-364, Apr. 1980.
16. G. E. Peterson and M. E. Stickel. Complete sets of reductions for some equational theories. J. ACM, 28(2):233-264, Apr. 1981.
17. C. Ringeissen. Cooperation of decision procedures for the satisfiability problem. In F. Baader and K. U. Schulz, editors, Frontiers of Combining Systems, pages 121-139, 1996. Kluwer Academic Publishers.
18. A. Rubio and R. Nieuwenhuis. A precedence-based total AC-compatible ordering. In C. Kirchner, editor, Proceedings of the 5 Intl. Conference on Rewriting Techniques and Applications, pages 374-388, 1993. Vol. 690 of Lecture Notes in Computer Science, Springer.
19. C. Tinelli and M. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In F. Baader and K. U. Schulz, editors, Frontiers of Combining Systems, pages 103-119, 1996. Kluwer Academic Publishers.