MaxSAT Resolution and Subcube Sums

We study the MaxRes rule in the context of certifying unsatisfiability. We show that it can be exponentially more powerful than tree-like resolution, and when augmented with weakening (the system MaxResW), p-simulates tree-like resolution. In devising a lower bound technique specific to MaxRes (and not merely inheriting lower bounds from Res), we define a new semialgebraic proof system called the SubCubeSums proof system. This system, which p-simulates MaxResW, is a special case of the Sherali–Adams proof system. In expressivity, it is the integral restriction of conical juntas studied in the contexts of communication complexity and extension complexity. We show that it is not simulated by Res. Using a proof technique qualitatively different from the lower bounds that MaxResW inherits from Res, we show that Tseitin contradictions on expander graphs are hard to refute in SubCubeSums. We also establish a lower bound technique via lifting: for formulas requiring large degree in SubCubeSums, their XOR-ification requires large size in SubCubeSums.

[1]  Shachar Lovett,et al.  Rectangles Are Nonnegative Juntas , 2016, SIAM J. Comput..

[2]  Jakob Nordström,et al.  Long Proofs of (Seemingly) Simple Formulas , 2014, SAT.

[3]  Kazuo Iwama,et al.  Intractability of read-once resolution , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[4]  Maria Luisa Bonet,et al.  Equivalence Between Systems Stronger Than Resolution , 2020, SAT.

[5]  Shachar Lovett,et al.  Rectangles Are Nonnegative Juntas , 2015, SIAM J. Comput..

[6]  Christoph Berkholz,et al.  The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs , 2017, Electron. Colloquium Comput. Complex..

[7]  Pravesh Kothari,et al.  Semialgebraic Proofs and Efficient Algorithm Design , 2019, Electron. Colloquium Comput. Complex..

[8]  Javier Larrosa,et al.  Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems , 2020, SAT.

[9]  Albert Atserias,et al.  Size-degree trade-offs for sums-of-squares and positivstellensatz proofs , 2018, CCC.

[10]  Javier Larrosa,et al.  Augmenting the Power of (Partial) MaxSat Resolution with Extension , 2020, AAAI.

[11]  Albert Atserias,et al.  Narrow Proofs May Be Maximally Long , 2014, Computational Complexity Conference.

[12]  Albert Atserias,et al.  Circular (Yet Sound) Proofs in Propositional Logic , 2018, SAT.

[13]  Nina Narodytska,et al.  Maximum Satisfiability Using Core-Guided MaxSAT Resolution , 2014, AAAI.

[14]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[15]  Joao Marques-Silva,et al.  MaxSAT Resolution With the Dual Rail Encoding , 2018, AAAI.

[16]  Simon de Givry,et al.  A logical approach to efficient Max-SAT solving , 2006, Artif. Intell..

[17]  Alasdair Urquhart,et al.  Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .

[18]  Russell Impagliazzo,et al.  A lower bound for DLL algorithms for k-SAT (preliminary version) , 2000, SODA '00.

[19]  Ivor T. A. Spence.  sgen1: A generator of small but difficult satisfiability benchmarks , 2010, JEAL.

[20]  Archie Blake.  Canonical expressions in Boolean algebra , 1938 .

[21]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[22]  Joao Marques-Silva,et al.  Horn Maximum Satisfiability: Reductions, Algorithms and Applications , 2017, EPIA.

[23]  Maria Luisa Bonet,et al.  Resolution for Max-SAT , 2007, Artif. Intell..

[24]  Stephen A. Cook,et al.  An observation on time-storage trade off , 1973, J. Comput. Syst. Sci..

[25]  Bruno Loff,et al.  Lifting Theorems for Equality , 2018, Electron. Colloquium Comput. Complex..

[26]  Eli Ben-Sasson,et al.  Short proofs are narrow—resolution made simple , 2001, JACM.

[27]  Ivor T. A. Spence,et al.  Zero-One Designs Produce Small Hard SAT Instances , 2010, SAT.

[28]  Eli Ben-Sasson,et al.  Near Optimal Separation Of Tree-Like And General Resolution , 2004, Comb..

[29]  Joao Marques-Silva,et al.  On Tackling the Limits of Resolution in SAT Solving , 2017, SAT.

[30]  Rahul Jain,et al.  Extension Complexity of Independent Set Polytopes , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).