Y
Hacker News
new
|
ask
|
show
|
jobs
by
Karrot_Kream
1116 days ago
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.
1 comments
xavxav
1115 days ago
Oh right this is just Horn clauses, not CHCs
link