Abstract
We describe the theory and implementation of a process which finds complete sets of reductions modulo equational theories which contain one or more associative and commutative operators with identity (ACI theories). We emphasize those features which distinguish this process from the similar one which works modulo associativity and commutativity. A primary difference is that for some rules in ACI complete sets, restrictions are required on the substitutions allowed when the rules are applied. Without these restrictions, termination cannot be guaranteed. We exhibit six examples of ACI complete sets that were generated by an implementation.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
L. Bachmair and N. Dershowitz, “Completion for rewriting modulo a congruence,” Rewriting Techniques and Applications, Lecture Notes in Computer Science 256, Springer-Verlag (1987), pp. 192–203.
T. Baird, “Complete sets of reductions modulo a class of equational theories which generate infinite congruence classes,” Ph.D. Dissertation, University of Missouri—Rolla, Rolla, MO, (1988).
R. Forgaard and J. V. Guttag, “A term rewriting system generator with failure-resistant Knuth-Bendix," Technical Report, MIT Laboratory for Computer Science, Massachussets Institute of Technology, Cambridge, MA (1984).
J.-P. Jouannaud and H. Kirchner, “Completion of a set of rules modulo a set of equations,” SIAM Journal of Computing, 15 (1986), pp. 1155–1194.
D. Knuth and P. Bendix, “Simple word problems in universal algebras,” Computational Problems in Abstract Algebras, J. Leech, ed., Pergamon Press, Oxford, England, (1970), pp. 263–297.
D. Lankford and A. Ballantyne, “Decision procedures for simple equational theories with commutative-associative axioms: complete sets of commutative-associative reductions,” Memo ATP-39, Dept. of Mathematics and Computer Science, University of Texas, Austin, Texas (1977).
B. Mayfield, “The role of term symmetry in equational unification and completion procedures,”, Ph.D. Dissertation, University of Missouri—Rolla, Rolla, MO, 1988.
G. Peterson and M. Stickel, “Complete sets of reductions for some equational theories,” J. ACM, 28 (1981), pp. 233–264.
M. Stickel, “A unification algorithm for associative-commutative functions,” J. ACM, 28 (1981), pp. 423–434.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baird, T.B., Peterson, G.E., Wilkerson, R.W. (1989). Complete sets of reductions modulo associativity, commutativity and identity. In: Dershowitz, N. (eds) Rewriting Techniques and Applications. RTA 1989. Lecture Notes in Computer Science, vol 355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51081-8_98
Download citation
DOI: https://doi.org/10.1007/3-540-51081-8_98
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51081-9
Online ISBN: 978-3-540-46149-4
eBook Packages: Springer Book Archive