TY - JOUR
T1 - Jumping and escaping
T2 - Modular termination and the abstract path ordering
AU - Dershowitz, Nachum
PY - 2012/12/14
Y1 - 2012/12/14
N2 - Combinatorial commutation properties for reordering a sequence consisting of two kinds of steps, and for separating the well-foundedness of their combination into well-foundedness of each, are investigated. A weak commutation property, called "jumping", along with a weakened version of the lifting property, called "escaping" and requiring only an eventual lifting, are used for proving well-foundedness of a generic, abstract version of the recursive path orderings.
AB - Combinatorial commutation properties for reordering a sequence consisting of two kinds of steps, and for separating the well-foundedness of their combination into well-foundedness of each, are investigated. A weak commutation property, called "jumping", along with a weakened version of the lifting property, called "escaping" and requiring only an eventual lifting, are used for proving well-foundedness of a generic, abstract version of the recursive path orderings.
KW - Commutation
KW - Path orderings
KW - Termination
KW - Well-founded orderings
UR - http://www.scopus.com/inward/record.url?scp=84868586322&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2012.09.013
DO - 10.1016/j.tcs.2012.09.013
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84868586322
SN - 0304-3975
VL - 464
SP - 35
EP - 47
JO - Theoretical Computer Science
JF - Theoretical Computer Science
ER -