Name
Abstract | ||
|---|---|---|
The Knuth-Bendix ordering is usually preferred over the lexicographic path ordering in successful implementations of resolution and superposition, but it is incompatible with certain requirements of hierarchic superposition calculi. Moreover, it does not allow non-linear definition equations to be oriented in a natural way. We present an extension of the Knuth-Bendix ordering that makes it possible to overcome these restrictions. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-75560-9_26 | LPAR |
Keywords | Field | DocType |
lpo-like property,hierarchic superposition calculus,non-linear definition equation,certain requirement,lexicographic path,successful implementation | Path-ordering,Superposition principle,Computer science,Ordinal number,Algorithm,Theoretical computer science,Implementation,Lexicographical order | Conference |
Volume | ISSN | ISBN |
4790 | 0302-9743 | 3-540-75558-6 |
Citations | PageRank | References |
12 | 0.72 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michel Ludwig | 1 | 113 | 7.67 |
| Uwe Waldmann | 2 | 300 | 26.30 |