Horn SAT (Boolean Satisfiability)
Jump to navigation
Jump to search
Description
Horn SAT restricts the boolean formula to the conjunction of Horn clauses, i.e. clauses with at most one positive literal
Related Problems
Generalizations: Conjunctive Normal Form SAT
Subproblem: Dual-Horn SAT, Renamable Horn
Related: SAT, Disjunctive Normal Form SAT, 1-in-3SAT, Monotone 1-in-3SAT, Monotone Not-Exactly-1-in-3SAT, All-Equal-SAT, Not-All-Equal 3-SAT (NAE 3SAT), Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT), k-SAT, 2SAT, 3SAT, 3SAT-5, 4SAT, Monotone 3SAT, XOR-SAT, Renamable Horn, MaxSAT
Parameters
$n$: number of variables
Table of Algorithms
Currently no algorithms in our database for the given problem.