GRASP—a new search algorithm for satisfiability

@inproceedings{Silva1996GRASPaNS,
  title={GRASP—a new search algorithm for satisfiability},
  author={Jo{\~a}o Silva and Karem A. Sakallah},
  booktitle={ICCAD 1996},
  year={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… 

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.

GRASP: A Search Algorithm

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.

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.

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.

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.

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.

Combining Preorder and Postorder Resolution in a Satisfiability Solver

  • A. V. Gelder
  • Computer Science
    Electron. Notes Discret. Math.
  • 2001

Investigations into Satisfiability Search

The logical foundations of the backtracking mechanism are explored alongside formulations for reasoning in relevant logics which results in the development of a malleable back tracking mechanism that subsumes other intelligent backtracking proof construction techniques and allows the incorporation of proof rearrangement strategies.

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.

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.
...

References

SHOWING 1-10 OF 29 REFERENCES

Improvements to propositional satisfiability search algorithms

This dissertation examines complete search algorithms for SAT, the satisfiability problem for propositional formulas in conjunctive normal form, and argues that any efficient SAT search algorithm should perform only a few key technique at each node of the search tree.

Search algorithms for satisfiability problems in combinational switching circuits

A configurable search-based algorithm for SAT that can be used for implementing different circuit analysis tools and a new model for path sensitization that permits modeling test pattern generation and timing analysis with linear size representations are introduced.

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.

Algorithms for Testing the Satisfiability of Propositional Formulae

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.

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.

Nogood Recording for static and dynamic constraint satisfaction problems

A new class of constraint recording algorithms called Nogood Recording is proposed that may be used for solving both static and dynamic CSPs and offers an interesting compromise, polynomially bounded in space, between an ATMS-like approach and the usual static constraint satisfaction algorithms.

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 extends

An Assumption-Based TMS

  • J. Kleer
  • Computer Science
    Artif. Intell.
  • 1986

SEARCH STATE EQUIVALENCE FOR REDUNDANCY IDENTIFICATION AND TEST GENERATION

New extensions to the EST' algoritlm, which accelerates combinational circuit Redundancy Identification and Automatic Test Pattern Generation algorithms, in particular SOCRATES, ensure that each portion of the ATPG search space is explored only once.