Engineering DPLL(T) + Saturation
نویسندگان
چکیده
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.
منابع مشابه
Two simulations about DPLL(T)
In this paper we relate different formulations of the DPLL(T ) procedure. The first formulation is that of [NOT06] based on a system of rewrite rules, which we denote DPLL(T ). The second formulation is an inference system of [Tin02], which we denote LKDPLL(T ). The third formulation is the application of a standard proof-search mechanism in a sequent calculus LK(T ) introduced here. We formali...
متن کامل2 3 A pr 2 01 2 Two simulations about DPLL ( T )
In this paper we relate different formulations of the DPLL(T ) procedure. The first formulation is that of [NOT06] based on a system of rewrite rules, which we denote DPLL(T ). The second formulation is an inference system of [Tin02], which we denote LKDPLL(T ). The third formulation is the application of a standard proof-search mechanism in a sequent calculus LK(T ) introduced here. We formali...
متن کاملDPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic
At CAV’04 we presented the DPLL(T ) approach for satisfiability modulo theories T . It is based on a general DPLL(X) engine whose X can be instantiated with different theory solvers Solver T for conjunctions of literals. Here we go one important step further: we require Solver T to be able to detect all input literals that are T -consequences of the partial model that is being explored by DPLL(...
متن کاملDPLL( T): Fast Decision Procedures
The logic of equality with uninterpreted functions (EUF) and its extensions have been widely applied to processor verification, by means of a large variety of progressively more sophisticated (lazy or eager) translations into propositional SAT. Here we propose a new approach, namely a general DPLL(X) engine, whose parameter X can be instantiated with a specialized solver Solver T for a given th...
متن کاملA DPLL-Based Calculus for Ground Satisfiability Modulo Theories
We describe and discuss DPLL(T ), a parametric calculus for proving the satisfiability of ground formulas in a logical theory T . The calculus tightly integrates a decision procedure for the satisfiability in T of sets of literals into a sequent calculus based on the well-known method by Davis, Putman, Logemann and Loveland for proving the satisfiability of propositional formulas. For being bas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008