3 citations · 4 across the 7 of their papers we have counts for
1 paper · 1 filter
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…