GRASP SAT Solver Home Page

This page contains links to the source code distribution of GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a Propositional Satisfiability (SAT) solver, as well as a man page for its most recent version. ou may want to check my home page, for additional information on SAT. (This page includes links to publications, technical reports, talks, applications, and software.)

NOTE: The GRASP SAT solver is made available solely for research and educational purposes. contact me for other utilizations.

Source Code for GRASP

• Updated version which compiles under Linux RedHat 9. This version is available here. In order to install (under RH 9), just type 'make depend; make all'.
  (DATE: Oct/2004.)

• The most recent version of source code of GRASP can be found here. This version includes a preliminary implementation of recursive learning on SAT solvers, and allows randomization of the branching heuristics. Moreover, this distribution is in general much easier to install than the complete GRASP source.
  If you just want the executable, a statically linked Linux executable is available here, and a statically linked Solaris executable is available here.
  (DATE: Feb/2000.
  Notice: If you got a copy of this version of GRASP before February, 2000, then you should upgrade to the most recent version.)

• A more complete source tree, with a couple of versions of GRASP (including the most recent version, and the original stable version), can be found here.
  (DATE: Sep/1999)

• A stable version of the source code of GRASP can be found here.
  (DATE: Sep/1997)

  
  

• For solving instances of SAT on combinational circuits, our group has developed CGRASP, that is built on top of GRASP. More information on CGRASP can be found here.

Man page for GRASP

The manual page for GRASP can be accessed here.

Utilities

If you are interested in interfacing the SAT solver, I also keep a Perl scripts web page, that contains several translators and other utilities. Moreover, links to Perl scripts associated with my research work on SAT/BCP can be found here.

Resources on SAT

A few links and resources on propositional satisfiability are maintained here.