Boolean Satisfiability (SAT) epitomizes NP-completeness, and so what is arguably the best known class of intractable problems. NP-complete decision problems are pervasive in all areas of computing, with literally thousands of well-known examples. Nevertheless, SAT solvers routinely challenge the problem’s intractability by solving propositional formulas with millions of variables, many representing the translation from some other NP-complete or NP-hard problem. The practical effectiveness of SAT solvers has motivated their use as oracles for NP, enabling new algorithms that solve an ever-increasing range of hard computational problems. This paper provides a brief overview of this ongoing effort, summarizing some of the recent past and present main successes, and highlighting directions for future research.
CITATION STYLE
Marques-Silva, J. (2018). Computing with SAT oracles: Past, present and future. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10936 LNCS, pp. 264–276). Springer Verlag. https://doi.org/10.1007/978-3-319-94418-0_27
Mendeley helps you to discover research relevant for your work.