Any Ground Associative-Commutative Theory Has a Finite Canonical System (1991)
| Venue: | Proceedings 4th Conference on Rewriting Techniques and Applications |
| Citations: | 18 - 4 self |
BibTeX
@INPROCEEDINGS{Narendran91anyground,
author = {Paliath Narendran and Michaël Rusinowitch},
title = {Any Ground Associative-Commutative Theory Has a Finite Canonical System},
booktitle = {Proceedings 4th Conference on Rewriting Techniques and Applications},
year = {1991},
pages = {423--434},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We show that theories presented by a set of ground equations with several associative-commutative (AC) symbols always admit a finite canonical system. This result is obtained through the construction of a reduction ordering which is AC-compatible and total on the set of congruence classes generated by the associativity and commutativity axioms. As far as we know, this is the first ordering with such properties, when several AC function symbols and free function symbols are allowed. Such an ordering is also a fundamental tool for deriving complete theorem proving strategies with built-in associative commutative unification.
