Completion for rewriting modulo a congruence
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Gro¨bner bases: a computational approach to commutative algebra
Gro¨bner bases: a computational approach to commutative algebra
Equational inference, canonical proofs, and proof orderings
Journal of the ACM (JACM)
Canonical Equational Proofs
Proceedings of the 5th International Conference on Rewriting Techniques and Applications
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Congruence Closure Modulo Associativity and Commutativity
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Rewrite Closure for Ground and Cancellative AC Theories
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Polynomial Time Termination and Constraint Satisfaction Tests
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
A Precedence-Based Total AC-Compatible Ordering
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Abstract Congruence Closure and Specializations
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On the Confluence of Linear Shallow Term Rewrite Systems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On the Confluence of Linear Shallow Term Rewrite Systems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Rewrite Closure for Ground and Cancellative AC Theories
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
On the Normalization and Unique Normalization Properties of Term Rewrite Systems
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
| Hi-index | 0.00 |
Given a binary relation E ∪ R on the set of ground terms over some signature, we define an abstract rewrite closure for E ∪ R. 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 →E ∪ E- ∪ R*. 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.