14 citations · 15 across the 4 of their papers we have counts for
4 papers
Pseudo-Boolean Proof Logging for Optimal Classical Planning
Simon Dold, Malte Helmert, Jakob Nordström +2
We introduce lower-bound certificates for classical planning tasks, which can be used to prove the unsolvability of a task or the optimality of a plan in a way that can be verified…
Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman
Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett +2
We exhibit supercritical trade-off for monotone circuits, showing that there are functions computable by small circuits for which any circuit must have depth super-linear or even s…
Cut-based Conflict Analysis in Mixed Integer Programming
Gioni Mexi, Felipe Serrano, Timo Berthold +2
For almost two decades, mixed integer programming (MIP) solvers have used graph-based conflict analysis to learn from local infeasibilities during branch-and-bound search. In this…
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions
Eli Ben-Sasson, Jakob Nordström
For current state-of-the-art DPLL SAT-solvers the two main bottlenecks are the amounts of time and memory used. In proof complexity, these resources correspond to the length and sp…