CNF satisfiability
Description: A decision problem in propositional logic that asks whether a conjunctive normal form formula has an assignment of truth values satisfying all its clauses.
Primary topic: Advanced Graph Theory Research (29%)
OpenAlex ID: keywords/cnf-satisfiability
