## Algorithms for the Satisfiability (SAT) Problem: A Survey (1996)

Venue: | DIMACS Series in Discrete Mathematics and Theoretical Computer Science |

Citations: | 131 - 3 self |

### BibTeX

@INPROCEEDINGS{Gu96algorithmsfor,

author = {Jun Gu and Paul W. Purdom and John Franco and Benjamin W. Wah},

title = {Algorithms for the Satisfiability (SAT) Problem: A Survey},

booktitle = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},

year = {1996},

pages = {19--152},

publisher = {American Mathematical Society}

}

### Years of Citing Articles

### OpenURL

### Abstract

. The satisfiability (SAT) problem is a core problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computer-aided design, computeraided manufacturing, machine vision, database, robotics, integrated circuit design, computer architecture design, and computer network design. Traditional methods treat SAT as a discrete, constrained decision problem. In recent years, many optimization methods, parallel algorithms, and practical techniques have been developed for solving SAT. In this survey, we present a general framework (an algorithm space) that integrates existing SAT algorithms into a unified perspective. We describe sequential and parallel SAT algorithms including variable splitting, resolution, local search, global optimization, mathematical programming, and practical SAT algorithms. We give performance evaluation of some existing SAT algorithms. Finally, we provide a set of practical applications of the sat...

### Citations

11504 |
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, Johnson
- 1979
(Show Context)
Citation Context ...hms. Finally, we provide a set of practical applications of the satisfiability problems. 1. Introduction An instance of the satisfiability (SAT) problem is a Boolean formula that has three components =-=[101, 188]-=-: ffl A set of n variables: x 1 , x 2 , ..., xn . ffl A set of literals. A literal is a variable (Q = x) or a negation of a variable (Q =sx). ffl A set of m distinct clauses: C 1 , C 2 , ..., Cm . Eac... |

9064 | Introduction to Algorithms - Cormen, Leiserson, et al. - 1990 |

4208 |
Artificial Intelligence - A Modern Approach; 2nd Edition
- Russell, Norvig
- 2002
(Show Context)
Citation Context ...istics were proposed during 1985 and 1987 for solving the SAT and CSP problems [206]. 4 The min-conflict heuristics aim at performing local conflict minimization in Boolean, discrete, and real spaces =-=[454]-=-: 5 Min-conflict heuristics are important to handle constraints in a constrained optimization problem. Min-Conflict Heuristic (Boolean Space) [206]. Multiple values to be assigned to a variable are re... |

4060 |
Stochastic Relaxation, Gibbs Distribution and the Bayesian Restoration of Images
- Geman, Geman
- 1984
(Show Context)
Citation Context ...41], the shape and object matching problem [67, 115, 247], syntactic shape analysis [116, 246, 310], shape from shading problem [12, 50, 173, 262, 263, 265, 264, 274, 364, 412], and image restoration =-=[193]-=-. ffl Robotics: related vision problem [88, 273], packing problem [133], and trajectory and task planning problems [46, 152]. ffl Computer-aided manufacturing: task planning [393], design [391, 392], ... |

3933 | Optimization by simulated annealing
- Kirkpatrick, Gelatt, et al.
- 1983
(Show Context)
Citation Context ...he randomized local search. Greedy local search procedure gets stuck in flat places as well as at local minima. Many search techniques, such as statistical optimization [74, 467], simulated annealing =-=[308]-=-, stochastic evolution [457], and conflict minimization [206, 380, 485, 491], are either local search or variations of local search. For most search problems encountered, in terms of computing time an... |

3153 | Graph-based algorithms for Boolean function manipulation
- Bryant
- 1986
(Show Context)
Citation Context ... Resolution [449] 1971: Consistency algorithms [95, 206, 271, 541] 1978: Loveland's Davis-Putnam (DPL) [117, 357] 1986: Parallel consistency chips [206, 226, 227] 1986: Binary decision diagrams (BDD) =-=[17, 59]-=- 1988: Chip and conquer [192] 1990: DPL plus heuristic (DPLH) [284] 1989: Local search & backtracking [212] 1993: Backtracking and probing [433] 1994: Parallel DP algorithm [38] 1994: Matrix inequalit... |

2564 |
The Design and Analysis of Computer Algorithms
- Aho, Hopcroft, et al.
- 1974
(Show Context)
Citation Context ...algorithm is slow under conditions that make the corresponding simplified algorithm slow.) A number of special SAT problems, such as 2-satisfiability and Horn clauses, are solvable in polynomial time =-=[5, 101, 397]-=-. There are several linear time algorithms [18, 155] and polynomial time algorithms [402, 462] existing. ffl Discrete, unconstrained algorithms. In this approach, the number of unsatisfiablesCNF (or s... |

2221 |
Genetic Algorithms + Data Structures = Evolution Programs, 3 edn
- Michalewicz
- 1996
(Show Context)
Citation Context ...388], Wah and Shang's Discrete Lagrangian Method (DLM) [538, 540], Glover and Hansen's tabu list [199, 239], stochastic methods such as simulated annealing (SA) [308, 74], and genetic algorithms (GA) =-=[253, 377]-=-. In Section 8.8, we examine the effects of some of these strategies. 8.1. UniSAT: Universal SAT Input Models. In UniSAT models, we extend discrete search space x 2 f0; 1g n into real space y 2 E n , ... |

1356 |
Combinatorial Optimization: Algorithms and Complexity
- Papadimitriou, Steiglitz
- 1998
(Show Context)
Citation Context ...ithms. Methods in this class were developed based on the fact that CNF or DNF formulas can be transformed to instances of Integer Programming, and possibly solved using Linear Programming relaxationss=-=[35, 258, 259, 285, 303, 301, 401, 548]-=-. Many approaches, including branch-and-bound [35], cutting-plane [259, 257], branch-and-cut [260], interior-point [303, 301], and improved interior-point [479], have been proposed to solve the intege... |

1259 |
Graph Theory
- Harary
- 1969
(Show Context)
Citation Context ... 2 3 6 0.03 3 7 0.3 ffl Mathematics: finding n-ary relations such as transitive closure [67], detecting graph and subgraph isomorphisms [105, 373, 375, 399, 442, 519, 558], the graph coloring problem =-=[57, 243, 369, 375]-=-, mathematical cryptology [408, 447], the automata homomorphism problem [198], finding spanning trees and Euler tours in a graph [396], solving the traveling salesman problems[287, 288, 332, 400], and... |

1204 |
Human problem solving
- Newell, Simon
- 1972
(Show Context)
Citation Context ...d inference [22], logical programming [96, 98, 139, 329], abductive inference for synthesizing composite hypotheses [297], semantic information processing [22, 161, 397], puzzles and cryptoarithmetic =-=[189, 242, 275, 367, 368, 394]-=-, truth maintenance [122, 124, 127, 138, 371], production system [278, 381, 382], the soma cube and instant insanity problem [191], theorem proving [269, 316, 427, 557], and neural network computings[... |

1171 |
and Nonlinear Programming
- Luenberger, â€śLinear
(Show Context)
Citation Context ...here i = 1; :::; m and j = 1; :::; n. On real space E n , also let: ffl w j be the jth integer variable, and ffl w be a vector of n integer variables, where i = 1; :::; m and j = 1; :::; n. Following =-=[359]-=-, a real-valued function f defined on a subset of E n is said to be continuous at y if f(y k ) ! f(y). A set of real-valued functions f 1 , f 2 , ..., fm on E n form a vector function f = (f 1 ; f 2 ;... |

1124 |
A computing procedure for quantification theory
- Davis, Putnam
- 1960
(Show Context)
Citation Context ...ning a pure literal can be removed without loss. An important improvement to the basic resolution algorithm is to first remove clauses containing pure literals (before resolving on non-pure literals) =-=[118]-=-. Although resolution can be applied to SAT, the main reason for interest in resolution is that it can be applied to the more difficult problem of solving sentences of first order predicate logic. The... |

1052 |
Consistency in Networks of Relations
- Mackworth
- 1977
(Show Context)
Citation Context ...ctions are defined with discrete values. If one handles a discrete search problem with consistency checking or constraint resolution, the approach belongs to the class of discrete constrained methodss=-=[228, 361, 384, 542]-=-. Alternatively, one can formulate the constraints into an objective function and minimize the objective function without looking at any problem constraints. Algorithms in this category are usually ca... |

977 |
A machine-oriented logic based on the resolution principle
- Robinson
- 1965
(Show Context)
Citation Context ... ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? : Constrained 8 ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ! ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? : 1960: Davis-Putnam (DP) algorithm [118] 1965: Resolution =-=[449]-=- 1971: Consistency algorithms [95, 206, 271, 541] 1978: Loveland's Davis-Putnam (DPL) [117, 357] 1986: Parallel consistency chips [206, 226, 227] 1986: Binary decision diagrams (BDD) [17, 59] 1988: Ch... |

942 | Symbolic Boolean manipulation with ordered binary decision diagrams
- Bryant
- 1992
(Show Context)
Citation Context ...rder chosen for the function (e.g., fa,b,cg in Figure 28). Since the early introduction of BDDs, several extensions have been proposed to reduce BDD sizes in practical applications. In an ordered BDD =-=[59, 60]-=-, the input variables are ordered, and every path from the root node to the leaf node visits the input variables in an ascending order. In practice, a simple topological based ordering heuristic [363]... |

877 |
Computer Vision
- Ballard, Brown
- 1982
(Show Context)
Citation Context ..., and logical arithmetic [93]. ffl Computer science and artificial intelligence: the constraint satisfaction problems[13, 191, 206, 361, 451], the n-queens problem [191, 242, 485], extended inference =-=[22]-=-, logical programming [96, 98, 139, 329], abductive inference for synthesizing composite hypotheses [297], semantic information processing [22, 161, 397], puzzles and cryptoarithmetic [189, 242, 275, ... |

814 | Constraint logic programming
- Jaffar, Lassez
- 1987
(Show Context)
Citation Context ...93]. ffl Computer science and artificial intelligence: the constraint satisfaction problems[13, 191, 206, 361, 451], the n-queens problem [191, 242, 485], extended inference [22], logical programming =-=[96, 98, 139, 329]-=-, abductive inference for synthesizing composite hypotheses [297], semantic information processing [22, 161, 397], puzzles and cryptoarithmetic [189, 242, 275, 367, 368, 394], truth maintenance [122, ... |

773 |
A machine program for theorem proving
- Davis, Longemann, et al.
- 1962
(Show Context)
Citation Context ...? ? ? ? ! ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? : 1960: Davis-Putnam (DP) algorithm [118] 1965: Resolution [449] 1971: Consistency algorithms [95, 206, 271, 541] 1978: Loveland's Davis-Putnam (DPL) =-=[117, 357]-=- 1986: Parallel consistency chips [206, 226, 227] 1986: Binary decision diagrams (BDD) [17, 59] 1988: Chip and conquer [192] 1990: DPL plus heuristic (DPLH) [284] 1989: Local search & backtracking [21... |

772 |
Data structures and algorithms
- AHO, HOPCROFT, et al.
- 1985
(Show Context)
Citation Context ...st solution that has been found so far. Branch and bound is recognized as a generalization of many heuristic search procedures such as A , AO , SSS , B , alpha-beta, and dynamic programming algorithm =-=[6, 343, 556, 539, 537, 536, 328, 333, 341, 410, 266, 556, 555, 549, 554]-=-. 6.6. Some Remarks on Complexity. The worst-case time for all known SAT algorithms is exponential in the first power of the input size. The naive algorithm that tries every variable setting requires ... |

723 | Proof Verification and Hardness of Approximation Problems - Arora, Lund, et al. - 1992 |

707 | A new method for solving hard satisfiability problems
- Selman, Levesque, et al.
- 1992
(Show Context)
Citation Context ...ion is the CNF formulas given by (1.1). A second formulation is the DNF formulas [207] discussed in Section 7.10. (b) Discrete Unconstrained Formulations. A common formulation for CNF formulas exists =-=[209, 212, 472]-=-. The goal is to minimize N (x), the number of unsatisfied clauses, under the interpretation that numeric variable x i = 1 (x i = 0) if Boolean variable x i = true (x i = false), respectively. That is... |

705 |
Approximation algorithms for combinatorial problems
- Johnson
- 1974
(Show Context)
Citation Context ...)::: 92 JUN GU, PAUL W. PURDOM, JOHN FRANCO, AND BENJAMIN W. WAH which is approximately n+m 1 (1=2) +m 2 (1=4) +m 3 (1=8):::. Removing n, which is unimportant, leaves Johnson's heuristic described in =-=[286]-=-. Although this heuristic has not been analyzed on the l-SAT model, experiments have shown it to be quite effective when used in conjunction with unit resolution. 13. Performance Evaluation The most i... |

687 | A new polynomial-time algorithm for linear programming
- Karmarkar
- 1984
(Show Context)
Citation Context ... 0sx is1. The LP relaxation can be solved efficiently with some sophisticated implementations of Dantzig's Simplex method, such as MINOS [389], or some variations of Karmarkar's interior point method =-=[305]-=-. Hooker early reported that by solving a linear programming of SAT, one frequently produces an integer solution [259]. Kamath et al. used MINOS 5.1 to solve linear programming relaxation [303, 301]. ... |

664 | Tabu search
- Glover, Laguna
- 1993
(Show Context)
Citation Context ...acking and random swaps (see Section 7.3 and [207, 221, 209, 227, 210]), Morris' "break-out" strategy [388], Wah and Shang's Discrete Lagrangian Method (DLM) [538, 540], Glover and Hansen's =-=tabu list [199, 239]-=-, stochastic methods such as simulated annealing (SA) [308, 74], and genetic algorithms (GA) [253, 377]. In Section 8.8, we examine the effects of some of these strategies. 8.1. UniSAT: Universal SAT ... |

654 |
A Truth Maintenance System
- Doyle
- 1986
(Show Context)
Citation Context ...elligent Backtracking. This is performed directly to the variable that causes the failure, reducing the effect of thrashing behavior. Methods in this category include dependency-directed backtracking =-=[496, 145]-=-, revised dependencydirected backtracking [414], simple intelligent backtracking [178], and a number of simplifications [56, 119, 120, 121, 123, 125, 190, 241, 452]. Freeman [175] recently present an ... |

593 |
Principles of artificial intelligence
- Nilsson
- 1980
(Show Context)
Citation Context ...thmss[34, 53, 64, 328, 425], term-rewriting [130, 268], production systems[482], multi-valued logic [478], Binary Decision Diagrams [59, 17], chip and conquer [192], resolution and regular resolution =-=[195, 357, 397, 449, 514, 525, 549]-=-, independent set algorithm [281], and matrix inequality system [512], have been proposed. ALGORITHMS FOR THE SATISFIABILITY (SAT) PROBLEM: A SURVEY 11 Many of the discrete constrained algorithms elim... |

526 |
An Introduction to Computing with Neural Nets
- Lippmann
- 1987
(Show Context)
Citation Context ...], truth maintenance [122, 124, 127, 138, 371], production system [278, 381, 382], the soma cube and instant insanity problem [191], theorem proving [269, 316, 427, 557], and neural network computings=-=[13, 14, 129, 251, 354, 272]-=-. ffl Machine vision: image matching problem [22, 88, 450, 553], line and edge labeling problems [76, 159, 515, 541, 561], stereopsis, scene analysis ALGORITHMS FOR THE SATISFIABILITY (SAT) PROBLEM: A... |

494 |
Global Optimization Using Interval Analysis
- Hansen
- 1992
(Show Context)
Citation Context ...mation observed during the search can be preserved. Active research in the past two decades has produced a variety of methods for finding global solutions to nonconvex nonlinear optimization problems =-=[508, 267, 163, 240, 405, 377]-=-. In general, transformational and non-transformational methods are two approaches in solving these problems. Non-transformational approaches include discarding methods, back-to-feasibleregion methods... |

482 |
Increasing tree search efficiency for constraint satisfaction problems
- Haralick, Elliott
- 1980
(Show Context)
Citation Context ...f the number of solutions for a probabilistic model [149]. During the past two decades, many performance studies were performed through sampling techniques [313, 424, 501], 1 experimental simulations =-=[54, 191, 241]-=-, analytical studies [53, 176, 177, 432, 425, 429, 500], as well as the combined effort of the above approaches [191, 266, 313, 424, 500]. 5. SAT Input Models In this section, we describe several basi... |

474 |
Optimal implementation of conjunctive queries in relational data bases
- Chandra, Merlin
- 1977
(Show Context)
Citation Context ... and 3-dimensional object recognition [230, 264]. ffl Database systems: operations on objects [518, 521], database consistency maintenance, query-answering and redundancy-checking, query optimizations=-=[78, 518]-=-, concurrency control [31, 154, 360], distributed database systems [185], truth and belief maintenance [122, 124, 127, 138, 371], the relational homomorphism problem [242, 518], and knowledge organiza... |

469 |
An assumption-based TMS
- Kleer
- 1986
(Show Context)
Citation Context ...or. Methods in this category include dependency-directed backtracking [496, 145], revised dependencydirected backtracking [414], simple intelligent backtracking [178], and a number of simplifications =-=[56, 119, 120, 121, 123, 125, 190, 241, 452]-=-. Freeman [175] recently present an intelligent backtracking algorithm, POSIT, for PrOpositional SatIstiability Testbed. In this algorithm he used Mom's heuristic, detecting failed literals, and minim... |

469 | Termination of rewriting
- Dershowitz
- 1987
(Show Context)
Citation Context ...le truth assignments and check to see if one satisfies the formula. Many improved techniques, such as consistency algorithms [228, 361], backtracking algorithmss[34, 53, 64, 328, 425], term-rewriting =-=[130, 268]-=-, production systems[482], multi-valued logic [478], Binary Decision Diagrams [59, 17], chip and conquer [192], resolution and regular resolution [195, 357, 397, 449, 514, 525, 549], independent set a... |

438 |
The complexity of satisfiability problems
- Schaefer
- 1978
(Show Context)
Citation Context ...er of special SAT problems, such as 2-satisfiability and Horn clauses, are solvable in polynomial time [5, 101, 397]. There are several linear time algorithms [18, 155] and polynomial time algorithms =-=[402, 462]-=- existing. ffl Discrete, unconstrained algorithms. In this approach, the number of unsatisfiablesCNF (or satisfiable DNF) clauses is formulated as the value of the objective function, transforming the... |

402 |
Binary decision diagrams
- Akers
- 1978
(Show Context)
Citation Context ... and manipulation method for arbitrary Boolean functions. This representation is defined by imposing restrictions on the Binary-Decision-Diagram (BDD) representation introduced by Lee [334] and Akers =-=[9]-=-, such that the resulting form is canonical. The OBDD representation and its manipulation method are an extremely powerful technique in various practical applications. It is particularly useful with f... |

401 |
Network-based heuristics for constraint satisfaction problems
- Dechter, Pearl
- 1987
(Show Context)
Citation Context .... Techniques in this class include partial lookahead, full lookahead 28 JUN GU, PAUL W. PURDOM, JOHN FRANCO, AND BENJAMIN W. WAH [226, 227, 241], forward checking [241, 241], network-based heuristics =-=[361, 128]-=-, and discrete relaxation [226, 227, 312, 451]. Backtracking for Proving Non-Existence. Dubois, Andre, Boufkhad, and Carlier have recently proposed a complete SAT algorithm, CSAT [151]. The CSAT was d... |

399 | Algorithms for Constraint Satisfaction Problems: A Survey
- Kumar
- 1992
(Show Context)
Citation Context ...d significant performance improvements when compared to traditional backtracking search algorithms. The effectiveness of min-conflicts heuristic was further observed by Russel and Norvig [454], Kumar =-=[321, 322]-=-, Johnson [295], Minton et al. [380], and Selman et al. [472]. Early local search algorithm can only handle small size path-finding problem such as TSP. By introducing the min-conflicts heuristics, lo... |

382 | Understanding line drawings of scenes with shadows
- WALTZ
- 1975
(Show Context)
Citation Context ...ctions are defined with discrete values. If one handles a discrete search problem with consistency checking or constraint resolution, the approach belongs to the class of discrete constrained methodss=-=[228, 361, 384, 542]-=-. Alternatively, one can formulate the constraints into an objective function and minimize the objective function without looking at any problem constraints. Algorithms in this category are usually ca... |

378 | Noise Strategies for Improving Local Search
- Selman, Kautz, et al.
- 1994
(Show Context)
Citation Context ...BLEM: A SURVEY 97 Table 5. WSAT (GSAT with random walk)'s real execution performance for hard random 3-SAT problem instances on an SGI Challenge with a 70 MHz MIPS R4400 processor. Time unit: secondss=-=[475]-=-. Problems GSAT Walk n m time flips R time flips R 100 430 .4 7554 8.3 .2 2385 1.0 200 860 22 284693 143 4 27654 1.0 400 1700 122 2:6 \Theta 10 6 67 7 59744 1.1 600 2550 1471 30 \Theta 10 6 500 35 241... |

365 |
Scene labeling by relaxation operations
- Rosenfeld, Hummel, et al.
- 1976
(Show Context)
Citation Context ...artial lookahead, full lookahead 28 JUN GU, PAUL W. PURDOM, JOHN FRANCO, AND BENJAMIN W. WAH [226, 227, 241], forward checking [241, 241], network-based heuristics [361, 128], and discrete relaxation =-=[226, 227, 312, 451]-=-. Backtracking for Proving Non-Existence. Dubois, Andre, Boufkhad, and Carlier have recently proposed a complete SAT algorithm, CSAT [151]. The CSAT was developed for the proof of the non-existence of... |

346 |
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
- Cerny
- 1985
(Show Context)
Citation Context ...es stuck much more often than the randomized local search. Greedy local search procedure gets stuck in flat places as well as at local minima. Many search techniques, such as statistical optimization =-=[74, 467]-=-, simulated annealing [308], stochastic evolution [457], and conflict minimization [206, 380, 485, 491], are either local search or variations of local search. For most search problems encountered, in... |

336 |
Shape from shading
- Horn, Brooks
- 1989
(Show Context)
Citation Context ...EY 107 and semantics-based region growing [22, 76, 158, 159, 160, 515, 541], the shape and object matching problem [67, 115, 247], syntactic shape analysis [116, 246, 310], shape from shading problem =-=[12, 50, 173, 262, 263, 265, 264, 274, 364, 412]-=-, and image restoration [193]. ffl Robotics: related vision problem [88, 273], packing problem [133], and trajectory and task planning problems [46, 152]. ffl Computer-aided manufacturing: task planni... |

332 |
The traveling salesman problem
- Lawler, Lenstra, et al.
- 1995
(Show Context)
Citation Context ...oblem [57, 243, 369, 375], mathematical cryptology [408, 447], the automata homomorphism problem [198], finding spanning trees and Euler tours in a graph [396], solving the traveling salesman problems=-=[287, 288, 332, 400]-=-, and logical arithmetic [93]. ffl Computer science and artificial intelligence: the constraint satisfaction problems[13, 191, 206, 361, 451], the n-queens problem [191, 242, 485], extended inference ... |

326 |
Linear-time algorithms for testing the satisfiability of propositional Horn formulae
- Dowling, Gallier
- 1984
(Show Context)
Citation Context ...in it has at most one positive literal. This class is widely studied, in part because of its close association with Logic Programming. Horn formulas can be solved in linear time using unit resolution =-=[144, 279, 469]-=-. The class of extended Horn formulas was introduced by Chandru and Hooker [79] who were looking for conditions under which a Linear Programming relaxation could be used to find solutions to propositi... |

314 |
On the complexity of derivations in the propositional calculus
- Tseitin
- 1968
(Show Context)
Citation Context ...thmss[34, 53, 64, 328, 425], term-rewriting [130, 268], production systems[482], multi-valued logic [478], Binary Decision Diagrams [59, 17], chip and conquer [192], resolution and regular resolution =-=[195, 357, 397, 449, 514, 525, 549]-=-, independent set algorithm [281], and matrix inequality system [512], have been proposed. ALGORITHMS FOR THE SATISFIABILITY (SAT) PROBLEM: A SURVEY 11 Many of the discrete constrained algorithms elim... |

305 |
Learning and Relearning in Boltzmann Machines
- Hinton, Sejnowski
- 1986
(Show Context)
Citation Context ...], truth maintenance [122, 124, 127, 138, 371], production system [278, 381, 382], the soma cube and instant insanity problem [191], theorem proving [269, 316, 427, 557], and neural network computings=-=[13, 14, 129, 251, 354, 272]-=-. ffl Machine vision: image matching problem [22, 88, 450, 553], line and edge labeling problems [76, 159, 515, 541, 561], stereopsis, scene analysis ALGORITHMS FOR THE SATISFIABILITY (SAT) PROBLEM: A... |

290 |
Global Optimization: Deterministic Approaches
- Horst, Tuy
- 1996
(Show Context)
Citation Context ... the objective function. Global optimization is concerned with the characterization and computation of global minima and maxima of unconstrained nonlinear functions and constrained nonlinear problems =-=[162, 163, 267, 405]-=-. Global optimization problems belong to the class of NP-hard problems. The concept of optimization is well rooted as a principle underlying the analysis of many complex decision problems. When one de... |

290 |
and easy distributions of SAT problems
- Hard
- 1992
(Show Context)
Citation Context ...he DP algorithm for 100 to 500 clauses. The computing time used by a program for the DP algorithm ([118, 117, 357]) is shown for the 3-SAT model (solid line) and the average 3-SAT model (dotted line) =-=[207, 212, 383, 109]-=-. Random formulas generated in the left region are usually satisfiable, and the procedure is fast. Random formulas in the right region are usually unsatisfiable, and the procedure is fast. For random ... |

287 |
A sufficient condition for backtrack-free search
- Freuder
- 1982
(Show Context)
Citation Context ...babilistic model [149]. During the past two decades, many performance studies were performed through sampling techniques [313, 424, 501], 1 experimental simulations [54, 191, 241], analytical studies =-=[53, 176, 177, 432, 425, 429, 500]-=-, as well as the combined effort of the above approaches [191, 266, 313, 424, 500]. 5. SAT Input Models In this section, we describe several basic SAT input models and their characteristics. 1 Knuth [... |

286 | Local search strategies for satisfiability testing
- Selman, Kautz, et al.
- 1996
(Show Context)
Citation Context ... solve a SAT problem with a few hundred variables. An incomplete SAT algorithm such as WSAT can solve SAT problem instances with 2,000 variables on an SGI Challenge with a 70 MHz MIPS R4400 processor =-=[475, 474]-=-. The randomized local search algorithm, e.g., SAT1.5, can solve various SAT problem instances with over 10,000 variables on a SUN SPARC 20 workstation comfortably [209, 212, 219]. Most practical SAT ... |