go-v.orgcodex
Menu
Page tools

codex · Philosophy

Maximum satisfiability problem

In computational complexity theory, the maximum satisfiability problem (MAX-SAT) is the problem of determining the maximum number of clauses, of a given Boolean formula in conjunctive normal form, that can be made true by an assignment of truth values to the variables of the formula. It is a generalization of the Boolean satisfiability problem, which asks whether there exists a truth assignment that makes all clauses true.

Wikipedia contributors, "Maximum satisfiability problem", Wikipedia, revision 1265876281, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex