Automated deduction by theory resolution
Journal of Automated Reasoning
Complete sets of transformations for general E-unification
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Ordered Semantic Hyper-Linking
Journal of Automated Reasoning
Partial Instantiation Methods for Inference in First-Order Logic
Journal of Automated Reasoning
An Order Theory Resolution Calculus
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A DPLL-Based Calculus for Ground Satisfiability Modulo Theories
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Integration of Equality Reasoning into the Disconnection Calculus
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
On Narrowing, Refutation Proofs and Constraints
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
New Directions in Instantiation-Based Theorem Proving
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005)
Journal of Automated Reasoning
Decision procedures for SAT, SAT modulo theories and beyond. the barcelogictools
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
The model evolution calculus with equality
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Logical Engineering with Instance-Based Methods
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
iProver --- An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
(LIA) - Model Evolution with Linear Integer Arithmetic Constraints
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Incremental Instance Generation in Local Reasoning
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Automated deduction for verification
ACM Computing Surveys (CSUR)
Instantiation-Based Automated Reasoning: From Theory to Practice
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Model evolution with equality modulo built-in theories
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Hierarchic superposition with weak abstraction
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
In this paper we present a method of integrating theory reasoning into the instantiation framework. This integration is done in the black-box style, which allows us to integrate different theories in a uniform way. We prove completeness of the resulting calculus, provided that the theory reasoner is answer-complete and complete for reasoning with ground clauses. One of the distinctive features of our approach is that it allows us to employ off-the-shelf satisfiability solvers for ground clauses modulo theories, as a part of general first-order reasoning. As an application of this approach, we show how it is possible to combine the instantiation calculus with other calculi, such as ordered resolution and paramodulation.