Disjunctive Normal Form SAT (Boolean Satisfiability)

From Algorithm Wiki
(Redirected from DNF-SAT)
Jump to navigation Jump to search

Description

DNF-SAT restricts the boolean formula to disjunctive normal form (DNF), meaning it is the OR of ANDs.

Related Problems

Generalizations: SAT

Related: Conjunctive 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, Horn SAT, Dual-Horn SAT, Renamable Horn, MaxSAT

Parameters

$n$: number of variables

Table of Algorithms

Currently no algorithms in our database for the given problem.