Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Karrot_Kream
on May 26, 2023
|
parent
|
context
|
favorite
| on:
Modern SAT solvers: fast, neat and underused (2018...
Take a look at
https://en.wikipedia.org/wiki/Boolean_satisfiability_problem...
(based on Schaefer's "The complexity of satisfiability problems"). Horn clause satisfiability problems (HORN SAT) fall in P-c.
xavxav
on May 27, 2023
[–]
Oh right this is just Horn clauses, not CHCs
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
