left

Non Overlappingness Check

right
AProVE Help SystemTechniquesTechniques working on TRSsNon Overlappingness Check

Description

This technique checks whether a given TRS R is non-overlapping. Then one can prove termination of R by only proving innermost-termination of R. See [Gra 96] for references.

Application and Configuration

There is no configuration possible.
For proving termination one should always integrate this technique as the check costs nearly no time and innermost termination is easier to prove as (full) termination.