![]() |
Semantic Labelling |
![]() |
AProVE Help System → Techniques → Techniques working on SCCs → | Semantic Labelling |
If (M, φ) is a quasi-model of P ∪ R for >, then there are no infinite lab(P) ∪ Decr(Σ#,M,>)-chains over lab(R) ∪ Decr(Σ,M,>) if and only if there are no P-chains over R.
The Semantic Labelling in AProVE is used in conjunction with modular removal of rules (MRR), i.e. the quality of a model is assessed by the number of rules, dependency pairs or cycles that could be deleted by labeling P and R using the model, applying MRR and unlabeling the resulting SCCs.
Semantic Labelling increases the number of function symbols and rules significantly. As thus, it should only be applied when termination of the original term rewrite system R could not be shown using other techniques. As the search space explodes with the arities of functions symbols in R and the number of variables occurring in a rule, Semantic Labelling should normally only be applied to string rewrite systems or systems which are almost string rewrite systems.