| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4661878 | Annals of Pure and Applied Logic | 2012 | 12 Pages |
Abstract
This is a survey of work on proof complexity and proof search from a logico-algorithmic viewpoint, as motivated by the versus problem. We discuss propositional proof complexity, Cook’s program, proof automatizability, proof search, algorithms for satisfiability, and the state of the art of our (in)ability to separate and .
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
