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 ...

Neural network optimisation for logic satisfiability addresses the fundamental challenge of determining whether a given Boolean formula can be assigned truth values that make the formula true.