An algorithm for finding canonical sets of ground rewrite rules in polynomial time
Journal of the ACM (JACM)
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Simplify: a theorem prover for program checking
Journal of the ACM (JACM)
AI Communications - CASC
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
New results on rewrite-based satisfiability procedures
ACM Transactions on Computational Logic (TOCL)
Satisfiability solving for software verification
International Journal on Software Tools for Technology Transfer (STTT)
Splitting without backtracking
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
The spec# programming system: an overview
CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
A fast linear-arithmetic solver for DPLL(T)
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Integrating linear arithmetic into superposition calculus
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Tapas: Theory Combinations and Practical Applications
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
On Deciding Satisfiability by DPLL($\Gamma+{\mathcal T}$) and Unsound Theorem Proving
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Combinable Extensions of Abelian Groups
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Natural domain SMT: a preliminary assessment
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
On Deciding Satisfiability by Theorem Proving with Speculative Inferences
Journal of Automated Reasoning
Superposition modulo non-linear arithmetic
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
An Instantiation Scheme for Satisfiability Modulo Theories
Journal of Automated Reasoning
E-Matching with free variables
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Hierarchic superposition with weak abstraction
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Simple and efficient clause subsumption with feature vector indexing
Automated Reasoning and Mathematics
SMELS: Satisfiability Modulo Equality with Lazy Superposition
Journal of Automated Reasoning
| Hi-index | 0.00 |
Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient and suitable for integrated theory reasoning. The most efficient SMT solvers rely on refutationally incomplete methods for incorporating quantifier reasoning. We describe a calculus and a system that tightly integrates Superposition and DPLL(T). In the calculus, all non-unit ground clauses are delegated to the DPLL(T) core. The integration is tight, dependencies on case splits are tracked as hypotheses in the saturation engine. The hypotheses are discharged during backtracking. The combination is refutationally complete for first-order logic, and its implementation is competitive in performance with E-matching based SMT solvers on problems they are good at.