On the structure of the Boolean satisfiability problem: a survey
TN Alyahya, MEB Menai, H Mathkour - ACM Computing Surveys (CSUR), 2022 - dl.acm.org
The Boolean satisfiability problem (SAT) is a fundamental NP-complete decision problem in
automated reasoning and mathematical logic. As evidenced by the results of SAT …
automated reasoning and mathematical logic. As evidenced by the results of SAT …
The international SAT solver competitions
Abstract The International SAT Solver Competition is today an established series of
competitive events aiming at objectively evaluating the progress in state-of-the-art …
competitive events aiming at objectively evaluating the progress in state-of-the-art …
Zchaff2004: An efficient sat solver
YS Mahajan, Z Fu, S Malik - … Conference on Theory and Applications of …, 2004 - Springer
Abstract The Boolean Satisfiability Problem (SAT) is a well known NP-Complete problem.
While its complexity remains a source of many interesting questions for theoretical computer …
While its complexity remains a source of many interesting questions for theoretical computer …
: gazing in the black box of SAT solving
Boolean satisfiability is a fundamental problem in computer science with a wide range of
applications including planning, configuration management, design and verification of …
applications including planning, configuration management, design and verification of …
[PDF][PDF] The sat competition 2014
The area of Boolean satisfiability (SAT) solving has seen tremendous progress over the last
years. Many problems (eg, in hardware and software verification) that seemed to be …
years. Many problems (eg, in hardware and software verification) that seemed to be …
[PDF][PDF] Preface to the special volume on the SAT 2005 competitions and evaluations
D Le Berre, L Simon - Journal on Satisfiability, Boolean Modeling …, 2006 - researchgate.net
In 2005 there were numerous “competitive events” in the area of automated reasoning (in
the broad sense): The Tenth CASC competition [23], the First Satisfiability Modulo Theory …
the broad sense): The Tenth CASC competition [23], the First Satisfiability Modulo Theory …
Satisfiability solvers
Publisher Summary The past few years have seen enormous progress in the performance of
Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known …
Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known …
[HTML][HTML] Overview and analysis of the SAT Challenge 2012 solver competition
A Balint, A Belov, M Järvisalo, C Sinz - Artificial Intelligence, 2015 - Elsevier
Programs for the Boolean satisfiability problem (SAT), ie, SAT solvers, are nowadays used
as core decision procedures for a wide range of combinatorial problems. Advances in SAT …
as core decision procedures for a wide range of combinatorial problems. Advances in SAT …
[PDF][PDF] Proceedings of sat competition 2020: Solver and benchmark descriptions
The area of Boolean satisfiability (SAT) solving has seen tremendous progress over the last
years. Many problems (eg, in hardware and software verification) that seemed to be …
years. Many problems (eg, in hardware and software verification) that seemed to be …
SAT competition 2018
The SAT Competition series, which started in 2002, is arguably one of the central driving
forces of SAT solver development and its benchmark suites have been used in evaluations …
forces of SAT solver development and its benchmark suites have been used in evaluations …