Termination of LCTRSs
Logic in Computer Science
2016-01-14 v1
Abstract
Logically Constrained Term Rewriting Systems (LCTRSs) provide a general framework for term rewriting with constraints. We discuss a simple dependency pair approach to prove termination of LCTRSs. We see that existing techniques transfer to the constrained setting in a natural way.
Cite
@article{arxiv.1601.03206,
title = {Termination of LCTRSs},
author = {Cynthia Kop},
journal= {arXiv preprint arXiv:1601.03206},
year = {2016}
}
Comments
proceedings for WST 2013