Depth lower bounds in Stabbing Planes for combinatorial principles
(2024)
Journal Article
Stabbing Planes (also known as Branch and Cut) is a proof system introduced very recently which, informally speaking, extends the DPLL method by branching on integer linear inequalities instead of single variables. The techniques known so far to prov... Read More about Depth lower bounds in Stabbing Planes for combinatorial principles.