Recent decades have witnessed remarkable progress in the study of Boolean satisfiability – the problem of determining whether a given propositional formula can be satisfied – and its natural extension ...
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 ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results