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

Coverity's PR counsel just forwarded me a message from Ben Chelf, clarifying his note posted Wednesday: Thanks for posting Ben Chelf's comments so quickly. Upon reading the posting, Ben realized that ...

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

Amsterdam, March 8, 2021 - IOS Press is pleased to announce the publication of the second edition of the classic Handbook of Satisfiability. Originally published in 2009 and part of the Frontiers in ...