Name
Abstract | ||
|---|---|---|
For many years, all existing completeness results for Knuth–Bendix completion and ordered paramodulation required the term ordering ≻ to be well-founded, monotonic and total(izable) on ground terms. Then, it was shown that well-foundedness and the subterm property were enough for ensuring completeness of ordered paramodulation. Here we show that the subterm property is not necessary either. By using a new restricted form of rewriting, we obtain a completeness proof of ordered paramodulation for Horn clauses with equality, where well-foundedness of the ordering suffices. Apart from the theoretical significance of this result, some potential applications motivating the interest of dropping the subterm property are given. The proof of the results included in this article, being still technical in some parts, is pretty much shorter and easier to read than the one we have in the preliminary version of this work presented at the CADE, 2002 conference (Bofill, and Rubio, 2002, CADE, Vol. 2392 of LNAI, pp. 456–470). |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1093/logcom/exn073 | J. Log. Comput. |
Keywords | Field | DocType |
preliminary version,horn clause,ground term,existing completeness result,subterm property,completeness proof,potential application,theoretical significance,new restricted form,bendix completion,well-founded orderings | Monotonic function,Discrete mathematics,Horn clause,Algorithm,Rewriting,Completeness (statistics),Mathematics | Journal |
Volume | Issue | ISSN |
19 | 2 | 0955-792X |
Citations | PageRank | References |
1 | 0.36 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Miquel Bofill | 1 | 148 | 19.04 |
| Albert Rubio | 2 | 228 | 19.44 |