Satisfiability Solving

- Natural & Formal Sciences -
Mathematics & Logic Dictionary
The algorithmic procedure that decides whether a given propositional or Boolean formula admits at least one assignment of truth values that makes the formula true; commonly applied to formulas in conjunctive normal form (CNF) and implemented by SAT solvers.