The Silent (R)evolution of SAT
Name
3560469.pdf
Size
790.09 KB
Format
Adobe PDF
Checksum (MD5)
48f7186f26af7174acb551e7d04f7b18
Author(s)
Hecher, Markus
Fichte, Johannes
Le Berre, Daniel
Szeider, Stefan
Date Issued
May 24, 2023
Publisher
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
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3560469
