Boolean Satisfiability (SAT) problems are critical in fields such as artificial intelligence and cryptography, where efficient solutions are essential. Conventional probabilistic solvers often ...

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

Local search method is a rising star for solving combinatorial optimization problems in recent years, and many state-of-the-art local search-based incomplete Maximum Satisfiability (MaxSAT) solvers ...

Researchers report that a multi-scale graph neural network called NeuroMGCN improves SAT phase prediction and raises solving rates by 4.1 and 5.2 percent over Kissat in the SATCOMP-2023 and ...