Use minisat to solve my problem

326 views
Skip to first unread message

dimitros

unread,
May 17, 2013, 12:43:55 PM5/17/13
to min...@googlegroups.com
Hello,
I am new to using SAT Solvers.
I wonder where can  i find and read some useful information of how i can learn more about how sat solvers work and basically how i can transform my problem so that it can be solved using a sat solver like minisat.

Van-Hau Nguyen

unread,
May 17, 2013, 6:18:34 PM5/17/13
to min...@googlegroups.com
Dear Dimitros,

To get some basics, you can look at here: http://gauss.ececs.uc.edu/SAT/tutorials.html

Hope it could help.
Cheers,



--
 
---
You received this message because you are subscribed to the Google Groups "MiniSat" group.
To unsubscribe from this group and stop receiving emails from it, send an email to minisat+u...@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.
 
 



--
Van-Hau Nguyen, PhD student
KRR Group, Faculty of Computer Science
TU Dresden, 01062 Dresden, Germany
https://sites.google.com/site/nguyenvanhau666/

Jose Augusto

unread,
May 17, 2013, 9:18:44 PM5/17/13
to min...@googlegroups.com
You can get a few pdfs from Google.

http://eprints.soton.ac.uk/265340/1/jpms-wodes08.pdf
http://www.csi.ucd.ie/staff/jpms/talks/talksite/jpms-wodes08.pdf (talk)

I know this guy who wrote those (J. Marques-Silva), he works in my
Institute, he developed a welll know SAT algorithm (GRASP), below:

http://embedded.eecs.berkeley.edu/Alumni/wjiang/ee219b/grasp.pdf
http://www.cfdvs.iitb.ac.in/download/Docs/verification/papers/sat/original-papers/silva96grasp.pdf

I also think SAT was the first known NP-complete problem, and so you
can "map" many NP complete problems to a SAT instance AFAIK. So SAT is
tied to many other NP complete problems. Depending on your interests
perhaps you can google more specifically ;-)

HTH

J
Reply all
Reply to author
Forward
0 new messages