5 ms·
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
by gajomi 7y ago
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.
- nickpsecurity 7y agoIm on my phone so will have to just dump links. Just found these in DuckDuckGo: https://sites.google.com/site/marcthurley/sharpsat https://sites.google.com/site/marcthurley/sharpsat http://www.ii.uib.no/~telle/bib/STV15.pdf http://www.ii.uib.no/~telle/bib/STV15.pdf http://www.cs.toronto.edu/~fbacchus/Papers/DBaaai07.pdf http://www.cs.toronto.edu/~fbacchus/Papers/DBaaai07.pdf https://github.com/dfremont/maxcount https://github.com/dfremont/maxcount
- hugomg 7y agoIn 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)
- rcfox 7y agoHow similar is that to answer set programming?