GRASP: A Search Algorithm for Propositional Satisfiability

@article{MarquesSilva1999GRASPAS,
  title={GRASP: A Search Algorithm for Propositional Satisfiability},
  author={Joao Marques-Silva and K. Sakallah},
  journal={IEEE Trans. Computers},
  year={1999},
  volume={48},
  pages={506-521}
}
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques that proved to be quite powerful on a wide variety of SAT problems. Some of these techniques are specific to SAT, whereas others are similar in spirit to approaches in other fields of Artificial Intelligence. GRASP is premised on the inevitability of conflicts during the search and its most… Expand
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
Heuristic-Based Backtracking Relaxation for Propositional Satisfiability
TLDR
Experimental results on hundreds of instances derived from real-world problems show that the new technique is able to speed SAT solvers, while aborting fewer instances, and clearly motivate the integration of heuristic backtracking in SATsolvers. Expand
Systematic versus Local Search and GA Techniques for Incremental SAT
TLDR
The goal here is to check whether a solution to a SAT problem continues to be a solution anytime a new set of clauses is added and if not, whether the solution can be modified efficiently to satisfy the old formula and the new clauses. Expand
Friends or Foes? An AI Planning Perspective on Abstraction and Search
TLDR
It is proved that all abstraction (over-approximation) methods known in planning cannot improve the best-case behavior of informed search, and this result is potentially relevant also for model checking, where SAT-based techniques have recently been combined with abstraction. Expand
Heuristic-Based Backtracking Relaxation for
In recent years backtrack search algorithms for propositional satisfiability (SAT) have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully solveExpand
A minimal-state processing search algorithm for satisfiability problems
TLDR
This paper presents an approximation algorithm, called a minimal-state processing search algorithm for SAT (MIPS-SAT), which repeatedly transits minimal states in terms of the cost function for searching a solution through a construction stage and a refinement stage. Expand
Understanding and Improving a Modern SAT Solver
TLDR
This work proposes a framework for presenting and analyzing a modern DLLbased SAT solver, and provides a basic backtracking algorithm that explicitly shows the process of resolution refutation construction and proposes an enhancement to the minimized 1UIP scheme, called local conflict clause recording. Expand
Exploring Constraint Satisfiability Techniques in Formal Verification
  • L. Fang
  • Mathematics, Computer Science
  • 2008
TLDR
A novel double-layer conflict-driven learning to store only those “primary” conflict clauses back into the clause database while keeping the other clauses as pseudo Boolean constraints, which opens the door on how to assess the usefulness of conflict induced clauses. Expand
A new greedy randomised adaptive search procedure for solving the maximum satisfiability problem
The maximum satisfiability problem (Max-Sat) is one of the most known variant of satisfiability problems. The objective is to find the best assignment for a set of Boolean variables that gives theExpand
Integrating Simplication Techniques in SAT Algorithms
Propositional Satisfiability (SAT) is fundamental in solving many application problems in Artificial Intelligence and in other fields of Computer Science and Engineering. In the past, it has alreadyExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 61 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
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
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
Satisfiability testing with more reasoning and less guessing
TLDR
A new algorithm for testing satisfiability of propositional formulas in conjunctive normal form (CNF) does substantially less ``guessing'' than previously reported algorithms, while keeping a polynomial time bound on the work done between guesses. Expand
Experimental Results on the Crossover Point in Satisfiability Problems
TLDR
Empirically, it is found that for random 3-SAT problems below the crossover point, the average time complexity of satisfiability problems seems empirically to grow linearly with problem size, and at and above therossover point the complexity seems to grow exponentially, but the rate of growth seems to be greatest near the crossoverpoint. Expand
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
Nogood Recording for Static and Dynamic Constraint Satisfaction Problems
TLDR
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 New Method for Solving Hard Satisfiability Problems
TLDR
A greedy local search procedure called GSAT is introduced for solving propositional satisfiability problems and its good performance suggests that it may be advantageous to reformulate reasoning tasks that have traditionally been viewed as theorem-proving problems as model-finding tasks. Expand
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
...
1
2
3
4
5
...