|
GSRC Calibrating Achievable Design Bookshelf: GRASP - SAT Solver (578 words) |
 | The GRASP algorithm is among the best known methods of solving the problem of Propositional Satisfiability (SAT). |
| 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. |
| In particular, GRASP is compared with TEGUS (available at University of California at Berkeley) and POSIT (available at University of Pennsylvania). |
| >ASSAT: Answer Set by SAT solvers (431 words) |
| ASSAT (Answer Sets by SAT solvers) is a system for computing answer sets of a logic program by using SAT solvers. |
| satz-rand, and Grasp, which are SAT solvers based on systematic search algorithms, and Walksat 41, a SAT solver based on stochastic local search algorithms. |
| ASSAT: Computing answer sets of a logic program by SAT solvers This is a revised version of the paper that appeared in Artificial Intelligence 157(1-2): 115-137 (2004). |
Feeds |
Contact