Page "Boolean satisfiability problem" Paragraph 16
from
Wikipedia
One of the most important restrictions of SAT is HORNSAT, where the formula is a conjunction of Horn clauses.
This problem is solved by the polynomial-time Horn-satisfiability algorithm, and is in fact P-complete.
It can be seen as P's version of the Boolean satisfiability problem.
Page 1 of 1.
1.881 seconds.