The Silent (R)evolution of SAT

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

Saved in:
Bibliographic Details
Published in:Communications of the ACM 2023-06, Vol.66 (6), p.64-72
Main Authors: Fichte, Johannes K., Berre, Daniel Le, Hecher, Markus, Szeider, Stefan
Format: Magazinearticle
Language:English
Subjects:
Artificial intelligence
Complexity theory
Computational complexity and cryptography
Computer Science
Computing methodologies
Constraint and logic languages
Evolution
Functional verification
General programming languages
Hardware
Hardware validation
Knowledge representation and reasoning
Language types
Logic programming and answer set programming
Mathematical software
Mathematics of computing
Optimization
Problem solving
Problems, reductions and completeness
Software and its engineering
Software notations and tools
Solvers
Theorem proving and SAT solving
Theory of computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Today's powerful, robust SAT solvers have become primary tools for solving hard computational problems.
ISSN:0001-0782
1557-7317
1557-7317
DOI:10.1145/3560469