CiME: Completion modulo E

1. T. Baird, G. Peterson, and R. Wilkerson. Complete sets of reductions modulo Associativity, Commutativity and Identity. In Proc. 3rd Rewriting Techniques and Applications, Chapel Hill, LNCS 355, pages 29–44. Springer-Verlag, Apr. 1989.

   Google Scholar 

2. A. Boudet, E. Contejean, and C. Marché. AC-complete unification and its application to theorem proving. In H. Ganzinger, editor, 7th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, Rutgers University, NJ, USA, July 1996. Springer-Verlag. To appear.

   Google Scholar 

3. B. Buchberger. An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Ideal. PhD thesis, University of Innsbruck, Austria, 1965. (in German).

   Google Scholar 

4. B. Buchberger and R. Loos. Algebraic simplification. In Computer Algebra, Symbolic and Algebraic Computation. Computing Supplementum 4. Springer-Verlag, 1982.

   Google Scholar 

5. S. Eker. Improving the efficiency of AC matching and unification. Rapport de DEA, INRIA Lorraine, 1993.

   Google Scholar 

6. J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM J. Comput., 15(4):1155–1194, 1986.

   Article  Google Scholar 

7. J.-P. Jouannaud and C. Marché. Termination and completion modulo associativity, commutativity and identity. Theoretical Comput. Sci., 104:29–51, 1992.

   Article  Google Scholar 

8. D. E. Knuth and P. B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263–297. Pergamon Press, 1970.

   Google Scholar 

9. D. S. Lankford and A. M. Ballantyne. Decision procedures for simple equational theories with permutative axioms: Complete sets of permutative reductions. Research Report Memo ATP-37, Department of Mathematics and Computer Science, University of Texas, Austin, Texas, USA, Aug. 1977.

   Google Scholar 

10. X. Leroy and M. Mauny. The Caml Light system, release 0.5. INRIA, Rocquencourt, 1992.

    Google Scholar 

11. R. Loos. Term reduction systems and algebraic algorithms. In Proceedings of the Fifth GI Workshop on Artificial Intelligence, pages 214–234, Bad Honnef, West Germany, 1981. Available as Informatik Fachberichte, Vol. 47.

    Google Scholar 

12. C. Marché. Normalised rewriting and normalised completion. In Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science, pages 394–403, Paris, France, July 1994. IEEE Comp. Soc. Press.

    Google Scholar 

13. C. Marché. Normalized rewriting: an alternative to rewriting modulo a set of equations. Journal of Symbolic Computation, 1996. to appear.

    Google Scholar 

14. G. E. Peterson and M. E. Stickel. Complete sets of reductions for some equational theories. J. ACM, 28(2):233–264, Apr. 1981.

    Article  Google Scholar 

Download references