GRASP—a new search algorithm for satisfiability

  title={GRASP—a new search algorithm for satisfiability},
  author={Jo{\~a}o P. Marques Silva and Karem A. Sakallah},
  booktitle={ICCAD 1996},
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed search-pruning techniques and facilitates identification of additional ones. GRASP is premised on the inevitability of conflicts during search and its most distinguishing feature is the augmentation of basic backtracking search with a powerful conflict analysis procedure. Analyzing conflicts to determine their causes enables… Expand
GRASP-A new search algorithm for satisfiability
Experimental results obtained from a large number of benchmarks, including many from the field of test pattern generation, indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances. Expand
GRASP: A Search Algorithm
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several search-pruningExpand
GRASP: A Search Algorithm for Propositional Satisfiability
Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances. Expand
An Overview of Backtrack Search Satisfiability Algorithms
An overview of backtrack search SAT algorithms is provided, describing and illustrating a number of techniques that have been empirically shown to be highly effective in pruning the amount of search on significant and representative classes of problem instances. Expand
Conflict-based Selection of Branching Rules in SAT-Algorithms
This paper presents an approach which allows the use of several branching rules to be applied and uses in-formation from non-chronological backtracking to dynamically adapt the probabilities of the branchingrules to be selected, which results in a faster and more robust behaviour of the SAT algorithm. Expand
A BDD-based satisfiability infrastructure using the unate recursive paradigm
Two BDD-based algorithms to solve the SAT problem are presented that attempt to contain the growth of B DD-size while identifying solutions quickly and incorporates an incomplete search to find a solution. Expand
Combining Preorder and Postorder Resolution in a Satisfiability Solver
  • A. V. Gelder
  • Computer Science
  • Electron. Notes Discret. Math.
  • 2001
This paper describes an efficient method to integrate several popular reasoning methods with CBJ, which includes binary-clause reasoning, equivalent-literal identification, variable-elimination resolution, and others. Expand
Investigations into Satisfiability Search
In this dissertation we investigate theoretical aspects of some practical approaches used in solving and understanding search problems. We concentrate on the Satisfiability problem, which is a strongExpand
A Study of SAT-Based Branching Heuristics for the CSP
Preliminary empirical results on random problems show that this unexploited information can be used to design new efficient CSP heuristics or to enhance the performance of existing ones, like dom/wdeg. Expand
Toward good elimination orders for symbolic SAT solving
A symbolic SAT solver is implemented based on the use of a variable elimination algorithm, as well as two specific methods for the generation of good elimination orders based on CNF structure, and it is shown how one can heuristically select the better using the notion of width. Expand


Improvements to propositional satisfiability search algorithms
In this dissertation, we examine complete search algorithms for SAT, the satisfiability problem for propositional formulas in conjunctive normal form. SAT is NP-complete, easy to think about, and oneExpand
Search algorithms for satisfiability problems in combinational switching circuits
A number of tasks in computer-aided analysis of combinational circuits, including test pattern generation, timing analysis, delay fault testing and logic verification, can be viewed as particularExpand
Nogood Recording for Static and Dynamic Constraint Satisfaction Problems
A new class of constraint recording algorithms called nogood recording that may be used for solving both dynamic C SPs and usual CSP (called static CSPs here) and offers an interesting compromise, polynomially bounded in space, between an ATMS-like (Assumption-based Truth Maintenance System) approach and the usual constraint satisfaction algorithms. Expand
A Rearrangement Search Strategy for Determining Propositional Satisfiability
Experimental data shows that for one easily computed upper bound the reduction in the size of the search space more than compensates for the overhead involved in selecting the next variable. Expand
Algorithms for Testing the Satisfiability of Propositional Formulae
This work shows by means of a set of experiments that the efficiency of DG is not only theoretical but practical as well, and proposes two relaxation schemes which map instances of SAT into instances of HORN-SAT, which are used to derive two new enumerative algorithms for SAT : HORN 1 and HORN 2. Expand
Combinational test generation using satisfiability
The algorithm, Test Generation Using Satisfiability (TEGUS), solves a simplified test set characteristic equation using straightforward but powerful greedy heuristics, ordering the variables using depth-first search and selecting a variable from the next unsatisfied clause at each branching point. Expand
Dynamic Search-Space Pruning Techniques in Path Sensitization
This paper proposes and demonstrates the effectiveness of several new techniques for search-space pruning for test pattern generation and presents linear-time algorithms for dynamically identifying unique sensitization points and for dynamically maintaining reduced head line sets. Expand
Performance measurement and analysis of certain search algorithms.
Abstract : This thesis applies the methodology of analysis of algorithms to study certain combinatorial problems and search algorithms originating predominantly in the All literature, and extendsExpand
Efficient generation of test patterns using Boolean satisfiability
A combinational circuit can be tested for the presence of a single stuck-at fault by applying a set of inputs that excite a verifiable output response in that circuit. If the fault is present, theExpand
An Assumption-Based TMS
  • J. Kleer
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1986
A new view of problem solving motivated by a new kind of truth maintenance system based on manipulating assumption sets is presented, which is possible to work effectively and efficiently with inconsistent information, context switching is free, and most backtracking is avoided. Expand