Name
Abstract | ||
|---|---|---|
We present the first fully syntactic (i.e., non-interpretation-based) AC-compatible recursive path ordering (RPO). It is simple, and hence easy to implement, and its behaviour is intuitive as in the standard RPO. The ordering is AC-total and defined uniformly for both ground and nonground terms, as well as for partial precedences. More important, it is the first one that can deal incrementally with partial precedences, an aspect that is essential, together with its intuitive behaviour, for interactive applications such as Knuth–Bendix completion. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1006/inco.2002.3158 | Rewriting Techniques and Applications |
Keywords | Field | DocType |
termination,term orderings,built-in associative and commutative theories,term rewriting | Path-ordering,Discrete mathematics,Algebra,Computer science,Algorithm,Rewriting,Lexicographical order,Parsing,Syntax,Recursion | Journal |
Volume | Issue | ISSN |
178 | 2 | Information and Computation |
ISBN | Citations | PageRank |
3-540-66201-4 | 19 | 1.12 |
References | Authors | |
12 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Albert Rubio | 1 | 228 | 19.44 |