Abstract

Semantic labeling is a transformation technique for proving the termination of rewrite systems. The semantic part is given by a quasi-model of the rewrite rules. In this paper we present a variant of semantic labeling in which the quasi-model condition is only demanded for the usable rules induced by the labeling. Our variant is less powerful in theory but maybe more useful in practice.

BibTeX Entry

@inproceedings{HM-RTA06,
 author    = "Nao Hirokawa and Aart Middeldorp",
 title     = "Predictive Labeling",
 booktitle = "Proceedings of the 17th International Conference on
              Rewriting Techniques and Applications",
 series    = "Lecture Notes in Computer Science",
 volume    = "4098",
 pages     = "313--327",
 year      = 2006,
 doi       = "10.1007/11805618\_24"
}