Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
hugomg
on May 19, 2019
|
parent
|
context
|
favorite
| on:
Modern SAT solvers: fast, neat and underused
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)
rcfox
on May 19, 2019
[–]
How similar is that to answer set programming?
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
