In this paper, we investigate the feasibility of applying algorithms based on the Uniform Confidence bounds applied to Trees [12] to the satisfiability of CNF formulas. We develop a new family of algorithms based on the idea of balancing exploitation (depth-first search) and exploration (breadth-first search), that can be combined with two different techniques to generate random playouts or wit...

In order to better understand SAT-based planning and, more broadly, the good performance of current DPLL-based SAT solvers on real-world instances, we design three CNF formula families, two of which are derived from synthetic planning domains. The formulas are parameterized both in their size and in the amount of inherent structure. We investigate DPLL search tree size via the intermediate noti...

The DPLL procedure has found great success in SAT, where search terminates on the first solution discovered. We show that this procedure is equally promising in a problem where exhaustive search is used, given that it is augmented with appropriate caching. Specifically, we propose two DPLL-based algorithms that construct OBDDs for CNF formulas. These algorithms have a worst-case complexity that...

The Boolean satisfiability problem (SAT) can be solved efficiently with variants of the DPLL algorithm. For industrial SAT problems, DPLL with conflict analysis dependent dynamic decision heuristics has proved to be particularly efficient, e.g. in Chaff. In this work, algorithms that initialize the variable activity values in the solver MiniSAT v1.14 by analyzing the CNF are evolved using genet...

The paper is concerned with the relevant practical problem of selecting a small unsatisfiable subset of clauses inside an unsatisfiable CNF formula. Moreover, it deals with the algorithmic problem of improving an enumerative (DPLL-style) approach to SAT, in order to overcome some structural defects of such approach. Within a complete solution framework, we are able to evaluate the difficulty of...

We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut procedure to guide the search away from the conflicting states.

Taiji-1 is the first demonstrated experimental satellite of Taiji program in China. Phasemeter one key components laser interferometer which responsible for phase extraction heterodyne signals. In this paper, we present architecture and implementation phasemeter. The DPLL used generally regarded as best choice space missions. We test phasemeter on ground results show that reaches sensitivity 60...

We present a new inference system for first-order logic, named SGGS, which stands for semantically-guided goal-sensitive theorem proving. SGGS generalizes the model-based reasoning of the Davis-Putnam-Logemann-Loveland (DPLL) procedure. Starting from an initial interpretation, which makes it semantically guided, SGGS uses a sequence of constrained clauses to represent a current model, instance ...

The analysis of the solving complexity of random 3-SAT instances using the Davis-Putnam-Loveland-Logemann (DPLL) algorithm slightly below threshold is presented. While finding a solution for such instances demands exponential effort with high probability, we show that an exponentially small fraction of resolutions require a computation scaling linearly in the size of the instance only. We compu...