Paper Info
Title
Termination of Associative-Commutative Rewriting by Dependency Pairs
Abstract
A new criterion for termination of rewriting has been described by Arts and Giesl in 1997. We show how this criterion can be generalized to rewriting modulo associativity and commutativity. We also show how one can build weak AC-compatible reduction orderings which may be used in this criterion.
Year
DOI
Venue
1998
10.1007/BFb0052374
RTA
Keywords
Field
DocType
dependency pairs,associative-commutative rewriting
Discrete mathematics,Dependency pairs,Associative property,Commutative property,Modulo,Algorithm,Decidability,Rewriting,Mathematics,Equational theory
Conference
Volume
ISSN
ISBN
1379
0302-9743
3-540-64301-X
Citations 
PageRank 
References 
14
1.22
22
Authors
2
Name
Order
Citations
PageRank
Claude Marché181447.43
Xavier Urbain228616.54