Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Proceedings of the 10th International Conference on Automated Deduction
On Shostak's Decision Procedure for Combinations of Theories
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Elimination of Equality via Transformation with Ordering Constraints
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Presburger''s Article on Integer Arithmetic: Remarks and Translation
Presburger''s Article on Integer Arithmetic: Remarks and Translation
Stanford Pascal Verifier user manual
Stanford Pascal Verifier user manual
STeP: The Stanford Temporal Prover
STeP: The Stanford Temporal Prover
| Hi-index | 0.00 |
The role of decision procedures is often essential in theorem proving. Decision procedures can reduce the search space of heuristic components of a prover and increase its abilities. However, in some applications only a small number of conjectures fall within the scope of the available decision procedures. Some of these conjectures could in an informal sense fall 'just outside' that scope. In these situations a problem arises because lemmas have to be invoked or the decision procedure has to communicate with the heuristic component of a theorem prover. This problem is also related to the general problem of how to flexibly integrate decision procedures into heuristic theorem provers. In this paper we address such problems and describe a framework for the flexible integration of decision procedures into other proof methods. The proposed framework can be used in different theorem provers, for different theories and for different decision procedures. New decision procedures can be simply 'plugged-in' to the system. As an illustration, we describe an instantia of this framework within the Clam proof-planning system, to which it is well suited. We report on some results using this implementation.