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 ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results