■ Block 01 / research
Research
Foundations other work depends on. Each entry explains what it is, why it is load-bearing, its open problems, and a reviewed timeline of progress.
Foundations other work depends on. Each entry explains what it is, why it is load-bearing, its open problems, and a reviewed timeline of progress.
Conflict-driven clause-learning solvers decide Boolean satisfiability on formulas with millions of variables, powering hardware and software verification, planning and computer-assisted mathematics.
The annual SAT Competition ranks solvers on hundreds of instances with certified answers, and the Global Benchmark Database records instance families and which are still unsolved.
Clausal proof formats and checkers (DRAT-trim, verified LRAT checkers) that let anyone verify a SAT solver's UNSAT answer without trusting the solver.