Citation Context

...Ying Zhao, Lintao Zhang, Sharad Malik Department of Electrical Engineering Princeton University {yingzhao, lintaoz, sharad}@ee.princeton.edu Many publicly available SAT solvers (e.g. GRASP [8], POSIT =-=[5]-=-, SATO [13], rel_sat [2], WalkSAT [9]) have been developed, most employing some combination of two main strategies: the Davis-Putnam (DP) backtrack search and heuristic local search. Heuristic local s...

Citation Context

...olean Constraint Propagation (BCP) [39] or as derivation of implications in the electronic CAD literature [1]. Most of the recently proposed improvements to the basic Davis-Putnam procedure [3], [6], =-=[11]-=-, [12], [22], [30], [36], [39] can be distinguished based on their decision making heuristics or their use of preprocessing or relaxation techniques. Common to all these approaches, however, is . J.P....

Citation Context

...arantee good average-case performance. The RACER architecture incorporates the following standard optimization techniques: dependency-directed backtracking [22] and DPLL-style semantic branching (see =-=[6]-=- for an overview of the literature). Among a set of new optimization techniques, the integration of these techniques into DL reasoners for concept consistency has been described in [15]. The implement...

Citation Context

... exists. Various EDA applications ranging from formal verification [2][3] to ATPG [1] use efficient SAT solvers as the basis for reasoning and searching. Many dedicated solvers (e.g. GRASP [6], POSIT =-=[5], S-=-ATO [8], rel_sat [7], Walksat [4], Chaff [9]) based on various algorithms (e.g. Davis Putnam [10], local search [4], Stälmark’s algorithm [11]) have been proposed to solve the SAT problem efficient...

Citation Context

...esis [5], equivalence checking [6,9], and model checking [4] reduce to the satisfiability problem. In the last decade substantial progress has been made in the development of practical SAT algorithms =-=[1,2,8,11,12,13,15,18]-=-. All of them are search algorithms that aim at finding a satisfying assignment by variable splitting. Search algorithms of that kind are descendants of the DPLL-algorithm [7]. DPLL-algorithm can be c...

Citation Context

...r hand, a proved effective splitting rule is to choose a variable x such that the value f 2 (x)sf 2 (:x) is maximal, where f 2 (L) is one plus the number of occurrences of literal L in binary clauses =-=[2, 5]-=-. We tried to combine the above two rules into one as follows: Let 0 ! as1 and n be the number of shortest non-Horn clauses in the current set. At first, we collect all the variable names appearing in...

Citation Context

...x) that present only one expansion possibility and to detect a clash when a disjunction in (x) has no expansion possibilities. This simplification has been called boolean constraint propagation (BCP) =-=[20]-=-. In effect, the inference rule ¬C1,... ,¬Cn,C1 ⊔ ...⊔ Cn ⊔ D D Downloaded from http://jigpal.oxfordjournals.org at Serial Record on August 13, 2010 is being used to simplify the conjunctive concept r...

Citation Context

...e new techniques disabled cannot solve any of the benchmarks in Table 3 in less than 4 hours (14400 seconds.) The techniques for improving the obvious algorithm are based on failed literal detection (=-=Freeman, 1995-=-; Li & Anbulagan, 1997), and for formulae 9X8Y \Phi on performing computation with the universal variables Y before all variables in X have been assigned a truth-value. First, before performing exhaus...