GRASP-A new search algorithm for satisfiability

@article{MarquesSilva1996GRASPANS,
  title={GRASP-A new search algorithm for satisfiability},
  author={Joao Marques-Silva and Karem A. Sakallah},
  journal={Proceedings of International Conference on Computer Aided Design},
  year={1996},
  pages={220-227}
}
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
A New Search Algorithm for Satisfiability
This report introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed search-pruning techniquesExpand
CSE-TR-GRASP — A New Search Algorithm for Satisfiability
This report introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed search-pruning techniquesExpand
GRASP: A Search Algorithm for Propositional Satisfiability
TLDR
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
Eliminating redundancies in SAT search trees
TLDR
In this paper, a branching criterion initially introduced by Purdom is revisited and extended and it is shown that redundancies during the search process can be avoided without adding new constraints explicitly. Expand
An Overview of Backtrack Search Satisfiability Algorithms
TLDR
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
TLDR
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
Tuning the VSIDS decision heuristic for bounded model checking
  • Ohad Shacham, E. Zarpas
  • Computer Science
  • Proceedings. 4th International Workshop on Microprocessor Test and Verification - Common Challenges and Solutions
  • 2003
TLDR
This work tuned the VSIDS (variable state independent decaying sum) decision heuristics embedded in zchaff in order to improve the efficiency of the DPLL SAT algorithm, which is especially effective for BMC problems. Expand
A BDD-based satisfiability infrastructure using the unate recursive paradigm
TLDR
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
A BDD-based satisfiability infrastructure using the unate recursive paradigm
Binary Decision Diagrams have been widely used to solve the Boolean satisfiability (SAT) problem. The individual constraints can be represented using BDDs and the conjunction of all constraintsExpand
Improving Propositional Satisfiability Algorithms by Dyna mic Selection of Branching Rules
The problem of proving that a propositional boolean formula is satisfiable (SAT) is one of the fundamental problems in computer science. The most popular SAT algorithms are based on the well knownExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 48 REFERENCES
GRASP—a new search algorithm for satisfiability
TLDR
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
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
TLDR
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. Expand
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
A Rearrangement Search Strategy for Determining Propositional Satisfiability
TLDR
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
TLDR
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
TLDR
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
TLDR
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
Nogood Recording for static and dynamic constraint satisfaction problems
TLDR
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. 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
...
1
2
3
4
5
...