Name
Abstract | ||
|---|---|---|
Ordered paramodulation and Knuth-Bendix completion are known to remain complete when using non-monotonic orderings. However, these results do not imply the compatibility of the calculus with essential redundancy elimination techniques such as demodulation, i.e., simplification by rewriting, which constitute the primary mode of computation in most successful automated theorem provers. In this paper we present a complete ordered paramodulation calculus for non-monotonic orderings which is compatible with powerful redundancy notions including demodulation, hence strictly improving the previous results and making the calculus more likely to be used in practice. As a side effect, we obtain a Knuth-Bendix completion procedure compatible with simplification techniques, which can be used for finding, whenever it exists, a convergent term rewrite system for a given set of equations and a (possibly non-totalizable) reduction ordering. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s10817-011-9244-z | J. Autom. Reasoning |
Keywords | Field | DocType |
Automated theorem proving,Equational reasoning,Ordered paramodulation,Knuth-Bendix completion | Monotonic function,Demodulation,Discrete mathematics,Equational reasoning,Automated theorem proving,Algorithm,Redundancy (engineering),Automated theorem provers,Rewriting,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
50 | 1 | 0168-7433 |
Citations | PageRank | References |
3 | 0.41 | 20 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Miquel Bofill | 1 | 148 | 19.04 |
| Albert Rubio | 2 | 228 | 19.44 |