The Silent (R)evolution of SAT
Johannes K. Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider
Abstract
Today's powerful, robust SAT solvers have become primary tools for solving hard computational problems.
Topics & Concepts
Computer scienceTheoretical computer scienceFormal Methods in VerificationConstraint Satisfaction and OptimizationLogic, programming, and type systems