Statements (32)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
Boolean satisfiability problem |
| gptkbp:canBe |
linear-time algorithm
|
| gptkbp:complexity |
P
|
| gptkbp:definedIn |
Horn clause
|
| gptkbp:hasProperty |
at most one positive literal per clause
|
| gptkbp:hasSpecialCase |
gptkb:SAT
|
| https://www.w3.org/2000/01/rdf-schema#label |
Horn-SAT
|
| gptkbp:input |
gptkb:Horn_formula
|
| gptkbp:introducedIn |
1951
|
| gptkbp:isCoNPComplete |
false
|
| gptkbp:isEasierThan |
general SAT
|
| gptkbp:isLogSpaceComplete |
true
|
| gptkbp:isMonotone |
false
|
| gptkbp:isNPComplete |
false
|
| gptkbp:isPolynomialTime |
true
|
| gptkbp:output |
satisfiability (yes/no)
|
| gptkbp:relatedTo |
gptkb:government_agency
gptkb:3-SAT gptkb:2-SAT unit propagation |
| gptkbp:studiedBy |
gptkb:Alfred_Horn
|
| gptkbp:subspecies |
gptkb:SAT
gptkb:CNF-SAT |
| gptkbp:usedIn |
gptkb:artificial_intelligence
gptkb:Prolog gptkb:Datalog automated reasoning logic programming database theory |
| gptkbp:bfsParent |
gptkb:Boolean_satisfiability_problem
|
| gptkbp:bfsLayer |
6
|