The Silent (R)evolution of SAT
Download3560469.pdf (790.0Kb)
Publisher Policy
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
The propositional satisfiability problem (SAT) was the first problem to be shown NP-complete by Cook and Levin. SAT remained the embodiment of theoretical worst-case hardness. However, in stark contrast to its theoretical hardness, the SAT problem has emerged as an essential tool for efficiently solving a wide variety of computational problems. SAT solving technology has continuously advanced since a breakthrough around the millennium, which catapulted practical SAT solving by orders of magnitudes ahead. Today, the many flavors of SAT technology can be found in all areas of technological innovation.
Date issued
2023-05-24Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence LaboratoryPublisher
ACM|Communications of the ACM
Citation
Hecher, Markus, Fichte, Johannes, Le Berre, Daniel and Szeider, Stefan. 2023. "The Silent (R)evolution of SAT."
Version: Final published version
ISSN
0001-0782