The Boolean satisfiability problem (SAT) asks whether a given logical formula can be made true by assigning values to its variables. As the canonical NP-complete decision problem, SAT underpins a vast ...

Determining the satisfiability of propositional formulas—whether there exists an assignment of truth values to variables that renders a conjunction of clauses true—lies at the heart of modern ...