left

Solver with Polynomial Order

right
AProVE Help SystemTechniquesTechniques working on SCCsSolver with Polynomial Order

Description

Given an SCC P over a TRS R this techniques tries to find a polynomial order > with Here U(P,π) are the usable rules of P regarding the argument filtering π that is implicit in the polynomial order.
If such an order is found, all strictly decreasing DPs are removed from P. After the removal the Dependency Graph for the remaining DPs is computed again. The set of SCCs of this new graph is the final result of this technique.
See [TGSK '04, GTSKF '03b] for references.

Application and Configuration

The user has two configuration possibilities for this technique. First, he can configure the polynomial order in more detail by pressing the Configure POLO-button. Second, he can select the method of how to search for the strict constraint. AProVE offers three different search modes:
Processing SCCs by solving polynomial constraints is quite fast if one uses linear polynomial interpretations. These already turn out to be sufficient for many examples resulting in a very good tradeoff between efficiency and power.