Abstract
Given a binary relation on the set of ground terms over some signature, we define an abstract rewrite closure for . An abstract rewrite closure can be interpreted as a specialized ground tree transducer (pair of bottom-up tree automata) and can be used to efficiently decide the reachability relation . It is constructed using a completion like procedure. Correctness is established using proof ordering techniques. The procedure is extended, in a modular way, to deal with signatures containing cancellative associative commutative function symbols.
This research was supported in part by the National Science Foundation under grants CCR-9902031 and CCR-0082560, and NASA Langley Research Center under contract NAS1-00079.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
L. Bachmair. Canonical Equational Proofs. Birkhäuser, Boston, 1991.
L. Bachmair and N. Dershowitz. Completion for rewriting modulo a congruence. Theoretical Computer Science, 67(2 & 3):173–201, October 1989.
L. Bachmair and N. Dershowitz. Equational inference, canonical proofs, and proof orderings. Journal of the ACM, 41:236–276, 1994.
L. Bachmair and H. Ganzinger. Ordered chaining calculi for first-order theories of binary relations. Technical Report MPI-I-95-2-009, 1995.
L. Bachmair, I.V. Ramakrishnan, A. Tiwari, and L. Vigneron. Congruence closure modulo associativity and commutativity. In Frontiers of Combining Systems, 3rd Intl Workshop FroCoS 2000, pages 245–259. Springer, 2000. LNAI 1794.
L. Bachmair and A. Tiwari. Abstract congruence closure and specializations. In D. McAllester, editor, CADE, pages 64–78. Springer, 2000. LNAI 1831. Full version to appear in J. of Automated Reasoning, http://www.csl.sri.com/users/tiwari/.
T. Becker and V. Weispfenning. Gröbner bases: a computational approach to commutative algebra. Springer-Verlag, Berlin, 1993.
H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available at: http://www.grappa.univ-lille3.fr/tata, 1997.
M. Dauchet, T. Heuillard, P. Lescanne, and S. Tison. Decidability of the confluence of ground termrewriting systems. In Proc IEEE Symposium on Logic in Computer Science, LICS, pages 353–359. IEEE Computer Society Press, 1987.
C. Kirchner, editor. Rewriting Techniques and Applications, RTA-93, Montreal, Canada, 1993. Springer-Verlag. LNCS 690.
A. Levy and J. Agusti. Bi-rewriting, a termrewriting technique for monotone order relations. In Kirchner, pages 17–31. LNCS 690.
E. W. Mayr. Persistence of vector replacement systems is decidable. Acta Informatica 15, pages 309–318, 1981. NewsletterInfo: 8.
D. A. Plaisted. Polynomial time termination and constraint satisfaction tests. In Kirchner [10], pages 405–420. LNCS 690.
S. Rao Kosaraju. Decidability of reachability in vector addition systems. In Proc. 14th annual ACM symposium on theory of computing, pages 267–281, May 1982.
A. Rubio and R. Nieuwenhuis. A precedence-based total AC-compatible ordering. In Kirchner [10], pages 374–388. LNCS 690.
A. Tiwari. Rewrite closure for ground and cancellative AC theories. Available: http://www.csl.sri.com/users/tiwari/fsttcs01.html, 2001. Full version of this paper.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tiwari, A. (2001). Rewrite Closure for Ground and Cancellative AC Theories. In: Hariharan, R., Vinay, V., Mukund, M. (eds) FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2001. Lecture Notes in Computer Science, vol 2245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45294-X_28
Download citation
DOI: https://doi.org/10.1007/3-540-45294-X_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43002-5
Online ISBN: 978-3-540-45294-2
eBook Packages: Springer Book Archive