Automatic decidability (2002) [3 citations — 0 self]
Download:
|
|
by Christopher Lynch, Barbara Morawska
In Proc. LICS-17
http://www.clarkson.edu/~clynch/PAPERS/lynchc_automatic.ps
Add To MetaCart
Abstract:
We give a set of inference rules with constant constraints. Then we show how to extend a set of equational clauses, so that if the application of these inference rules halts on these clauses, then the theory is decidable by applying a standard set of Paramodulation inference rules. In addition, we can determine the number of clauses generated in this decision procedure. For some theories, such as the theory of lists, there are O(n \Theta lg(n)) clauses. For others it is polynomial. And for others it is simply exponential such as the theory of (extensional) arrays. 1
Citations
| 606 | Term Rewriting and All That – Baader, Nipkow - 1998 |
| 414 | Termination of rewriting – Dershowitz - 1987 |
| 187 | Rewrite-based equational theorem proving with selection and simplification – Bachmair, Ganzinger - 1994 |
| 138 | Fast decision procedures based on congruence closure – Nelson, Oppen - 1980 |
| 86 | Techniques for program verification – Nelson - 1981 |
| 33 | A decision procedure for an extensional theory of arrays – Stump, Barrett, et al. - 2001 |
| 32 | Complexity analysis based on ordered resolution – Basin, Ganzinger |
| 27 | Shostakâs congruence closure as completion – Kapur - 1997 |
| 22 | Abstract congruence closure and specializations – Bachmair, Tiwari - 2000 |
| 10 | Uniform Derivation of Decision Procedures by Superposition – Armando, Ranise, et al. - 2001 |
