News for hackers. Stuff that matters.

A comment on Modern SAT solvers: fast, neat and underused.

Re:Modern SAT solvers: fast, neat and underused by gajomi on Sunday May 19, 2019 @12:25PM (#19954064)
Stupid question... Are there equivalent (in the sense of being fast and having nice interfaces) solvers for #SAT problems? A whole pile of inference in machine learning can be framed in this way which makes me curious.
[ Parent | on HN ]
Re:Modern SAT solvers: fast, neat and underused by hugomg on Sunday May 19, 2019 @04:46PM (#19955415)
In case others aren't familiar with the termiology: #SAT is the counting version of the SAT problem, which tries to find how many different solutions exist to a set of constraints)
[ Parent | on HN ]
Re:Modern SAT solvers: fast, neat and underused by rcfox on Sunday May 19, 2019 @06:43PM (#19956031)
How similar is that to answer set programming?
[ Parent | on HN ]
Re:Modern SAT solvers: fast, neat and underused by nickpsecurity on Sunday May 19, 2019 @12:36PM (#19954114)
Im on my phone so will have to just dump links. Just found these in DuckDuckGo:

https://sites.google.com/site/marcthurley/sharpsat

http://www.ii.uib.no/~telle/bib/STV15.pdf

http://www.cs.toronto.edu/~fbacchus/Papers/DBaaai07.pdf

https://github.com/dfremont/maxcount

[ Parent | on HN ]