Between proof construction and SAT-solving

Aleksy Schubert, Paweł Urzyczyn, Konrad Zdanowski

The classical satisfiability problem (SAT) is used as a natural and general tool to express and solve combinatorial problems that are in NP. We postulate that provability for impli…