English

A Characterization of Quasi-Decreasingness

Logic in Computer Science 2016-09-13 v1

Abstract

In 2010 Schernhammer and Gramlich showed that quasi-decreasingness of a DCTRS R is equivalent to \mu-termination of its context-sensitive unraveling Ucs(R) on original terms. While the direction that quasi-decreasingness of R implies \mu-termination of Ucs(R) on original terms is shown directly; the converse - facilitating the use of context-sensitive termination tools like MU-TERM and VMTL - employs the additional notion of context-sensitive quasi-reductivity of R. In the following, we give a direct proof of the fact that \mu-termination of Ucs(R) on original terms implies quasi-decreasingness of R. Moreover, we report our experimental findings on DCTRSs from the confluence problems database (Cops), extending the experiments of Schernhammer and Gramlich.

Cite

@article{arxiv.1609.03345,
  title  = {A Characterization of Quasi-Decreasingness},
  author = {Thomas Sternagel and Christian Sternagel},
  journal= {arXiv preprint arXiv:1609.03345},
  year   = {2016}
}

Comments

WST 2016

R2 v1 2026-06-22T15:46:49.157Z