On Fourier's algorithm for linear arithmetic constraints
Journal of Automated Reasoning
A General Setting for Flexibly Combining and Augmenting Decision Procedures
Journal of Automated Reasoning
Boolean Algebra Admits No Convergent Term Rewriting System
RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Uniform Derivation of Decision Procedures by Superposition
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
The Use of Explicit Plans to Guide Inductive Proofs
Proceedings of the 9th International Conference on Automated Deduction
Solving problems by formula manipulation in logic and linear inequalities
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Hi-index | 0.00 |
We address the problem of automatic synthesis of decision procedures. Our synthesis mechanism consists of several stages and sub-mechanisms and is well-suited to the proof-planning paradigm. The system (adeptus), that we present in this paper, synthesised a decision procedure for ground arithmetic completely automatically and it used some specific method generators in generating a decision procedure for linear arithmetic, in only a few seconds of cputime. We believe that this approach can lead to automated assistance in constructing decision procedures and to more reliable implementations of decision procedures.