The silent (r)evolution of SAT

Fichte, Johannes K.; Le Berre, Daniel; Hecher, Markus; Szeider, Stefan

doi:10.1145/3560469

Record link:

http://hdl.handle.net/20.500.12708/190276

Title:

Citation:

Fichte, J. K., Le Berre, D., Hecher, M., & Szeider, S. (2023). The silent (r)evolution of SAT. Communications of the ACM, 66(6), 64–72. https://doi.org/10.1145/3560469

Publisher DOI:

10.1145/3560469

Publication Type:

Article - Original Research Article

Language:

English

Authors:

Fichte, Johannes K.
Le Berre, Daniel
Hecher, Markus
Szeider, Stefan

Organisational Unit:

E192-01 - Forschungsbereich Algorithms and Complexity

Journal:

Communications of the ACM

ISSN:

0001-0782

Date (published):

Jun-2023

Number of Pages:

Publisher:

ASSOC COMPUTING MACHINERY

Peer reviewed:

Yes

Keywords:

Propositional Satisfiability; Optimization; Constraint Programming

Abstract:

Today's powerful, robust SAT solvers have become primary tools for solving hard computational problems.

Project title:

START: Y 698-N23 (FWF - Österr. Wissenschaftsfonds)
Hybrid Parameterized Problem Solving in Practice: P32830-N (FWF - Österr. Wissenschaftsfonds)
Revealing and Utilizing the Hidden Structure for Solving Hard Problems in AI: ICT19-065 (WWTF Wiener Wissenschafts-, Forschu und Technologiefonds)

Project (external):

Austrian Science Fund (FWF)

Project ID:

J4656

Research Areas:

Logic and Computation: 100%

Science Branch:

1020 - Informatik: 80%
1010 - Mathematik: 20%

License:

CC BY-NC-ND 4.0