Download:
|
by Robert Nieuwenhuis, Jos'e Miguel Rivero
Yale University/ Glasgow University
http://www.lsi.upc.es/~roberto/papers/nric2000.ps.gz
Add To MetaCart
Abstract:
Abstract. We introduce new algorithms for deciding the satisfiability of constraints for the full recursive path ordering with status (RPO), and hence as well for other path orderings like LPO, MPO, KNS and RDO, and for all possible total precedences and signatures. The techniques are based on a new notion of solved form, where fundamental properties of orderings like transitivity and monotonicity are taken into account. Apart from simplicity and elegance from the theoretical point of view, the main contribution of these algorithms is on efficiency in practice. Since guessing is minimized, and, in particular, no linear orderings between the subterms are guessed, a practical improvement in performance of several orders of magnitude over previous algorithms is obtained, as shown by our experiments. 1
Citations
|
414
|
Termination of rewriting
– Dershowitz
- 1987
|
|
72
|
Constraints and theorem proving
– Ganzinger, Nieuwenhuis
- 2001
|
|
71
|
Theorem proving with ordering and equality constrained clauses
– Nieuwenhuis, Rubio
- 1995
|
|
68
|
M.: Deduction with symbolic constraints. Revue Française d’Intelligence Artificielle 4(3
– Kirchner, Kirchner, et al.
- 1990
|
|
53
|
1992], Theorem proving with ordering constrained clauses, in `Automated Deduction -- CADE'11
– Nieuwenhuis, Rubio
|
|
52
|
Solving symbolic ordering constraints
– Comon
- 1990
|
|
48
|
Two generalizations of the recursive path ordering. Unpublished note
– Kamin, Levy
- 1980
|
|
40
|
Simple LPO constraint solving methods
– Nieuwenhuis
- 1993
|
|
34
|
Satisfiability of systems of ordinal notations with the subterm property is decidable
– Jouannaud, Okada
- 1991
|
|
22
|
Ordering constraints on trees
– Comon, Treinen
- 1994
|
|
19
|
The Saturate System
– Ganzinger, Nieuwenhuis, et al.
- 1995
|
|
19
|
On the recursive decomposition ordering with lexicographical status and other related orderings
– Lescanne
- 1990
|
|
17
|
Decision problems in ordered rewriting
– Comon, Narendran, et al.
- 1998
|
|
17
|
A path ordering for proving termination of term rewriting systems
– Kapur, Narendran, et al.
- 1985
|
|
11
|
On recursive path ordering
– Krishnamoorthy, Narendran
- 1985
|
|
11
|
Solved forms for path ordering constraints
– Nieuwenhuis, Rivero
- 1999
|
|
6
|
RPO constraint solving is in NP
– Narendran, Rusinowitch, et al.
- 1999
|
