Showing cs.LOShow all
2 papers · 1 filter
cs.LO2025
Semi-Algebraic Proof Systems for QBF
Olaf Beyersdorff, Ilario Bonacina, Kaspar Kasche +2
We introduce new semi-algebraic proof systems for Quantified Boolean Formulas (QBF) analogous to the propositional systems Nullstellensatz, Sherali-Adams and Sum-of-Squares. We tra…
cs.LO2025
Redundancy rules for MaxSAT
Ilario Bonacina, Maria Luisa Bonet, Sam Buss +1
The concept of redundancy in SAT leads to more expressive and powerful proof search techniques, e.g., able to express various inprocessing techniques, and originates interesting hi…