Jump to content

GRASP (SAT solver)

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Sthomas2798 (talk | contribs) at 08:11, 21 January 2021 (Undid revision 897239149 by 140.146.203.11 (talk) and added reference). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

GRASP is a well known SAT instance solver. It was developed by João Marques Silva, a Portuguese computer science researcher. It stands for Generic seaRch Algorithm for the Satisfiability Problem[1].

References

  • Marques-Silva, J. P. and Sakallah, K. A. (1996) GRASP: A New Search Algorithm for Satisfiability. In Proceedings of International Conference on Computer-Aided Design, pp. 220-227, Santa Clara, California, U.S.A.
  1. ^ J.P. Marques-Silva; Karem A. Sakallah (November 1996). "GRASP-A New Search Algorithm for Satisfiability". Digest of IEEE International Conference on Computer-Aided Design (ICCAD). pp. 220–227. CiteSeerX 10.1.1.49.2075. doi:10.1109/ICCAD.1996.569607. ISBN 978-0-8186-7597-3.
Retrieved from "https://en.wikipedia.org/w/index.php?title=GRASP_(SAT_solver)&oldid=1001777756"