On the effectiveness of backjumping and trivial truth in quantified boolean formulas satisfiability?
نویسندگان
چکیده
Trivial truth and backjumping are two optimization techniques that have been proposed for deciding quantified boolean formulas (QBFs) satisfiability. Both these techniques can greatly improve the overall performance of a QBF solver, but they are the expression of opposite philosophies. On one hand, trivial truth is a “look-ahead” policy: it is applied when descending the search tree to (try to) prune it. On the other hand, backjumping is a “look-back” policy: it is applied when backtracking to (try to) avoid useless explorations. Neither of these optimizations subsumes the other: it is easy to come up with examples in which trivial truth behaves much better than backjumping, and the other way around. In this paper we experimentally evaluate these two optimizations both on randomly generated and on real world test cases.
منابع مشابه
Backjumping for Quantified Boolean Logic Satisfiability
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Many decision procedures have been proposed in the last few years, most of them based on the Davis, Logemann, Loveland procedure (DLL) for propositional satisfiability (SAT). In this paper we show how it is possible to e...
متن کاملDichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas
In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems, showed that all these problems are either in P or NP-complete, and gave a simple criterion to determine which of the two cases holds. This result is surprising in light of Ladner’s theorem, which implies that there are an infinite...
متن کاملA backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming under the Stable Model Semantics (SDLP). It builds upon related techniques that had originally been introduced for constraint solving, which have been adapted to propositional satisfiability testing, and recently also to non-disjunctive logic programming under the stable model semantics (SLP) [1,2]. We focus on ba...
متن کاملEvaluating Backjumping for Disjunctive Logic Programming Valutazione del Backjumping per Programmazione Logica Disgiuntiva
SOMMARIO/ABSTRACT In questo articolo presentiamo la tecnica del backjump-ing per la Programmazione Logica Disgiuntiva, prendendo spunto dai lavori svolti per solutori per Constraint e log-ica proposizionale. A differenza dei lavori citati, ci fo-calizzaremo su backjumping senza (clause) learning. Pre-senteremo un fondamento teorico per questa tecnica sfrut-tando le peculiarità della logica su c...
متن کاملModels and quantifier elimination for quantified Horn formulas
In this paper, quantified Horn formulas (QHORN) are investigated. We prove that the behavior of the existential quantifiers depends only on the cases where at most one of the universally quantified variables is zero. Accordingly, we give a detailed characterization of QHORN satisfiability models which describe the set of satisfying truth assignments to the existential variables. We also conside...
متن کامل