MaxSAT Resolution With the Dual Rail Encoding

Conflict-driven clause learning (CDCL) is at the core of the success of modern SAT solvers. In terms of propositional proof complexity, CDCL has been shown as strong as general resolution. Improvements to SAT solvers can be realized either by improving existing algorithms, or by exploiting proof systems stronger than CDCL. Recent work proposed an approach for solving SAT by reduction to Horn MaxSAT. The proposed reduction coupled with MaxSAT resolution represents a new proof system, DRMaxSAT, which was shown to enable polynomial time refutations of pigeonhole formulas, in contrast with either CDCL or general resolution. This paper investigates the DRMaxSAT proof system, and shows that DRMaxSAT p-simulates general resolution, that ACFrege+PHP p-simulates DRMaxSAT, and that DRMaxSAT can not p-simulate AC-Frege+PHP or the cutting planes

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

[2]  Samuel R. Buss,et al.  Annals of Pure and Applied Logic , 2022 .

[3]  Armin Biere.  Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling , 2014, POS@SAT.

[4]  Toniann Pitassi,et al.  An Exponential Separation Between the Parity Principle and the Pigeonhole Principle , 1996, Ann. Pure Appl. Log..

[5]  Joao Marques-Silva,et al.  Iterative and core-guided MaxSAT solving: A survey and assessment , 2013, Constraints.

[6]  Gilles Audemard,et al.  Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction , 2013, SAT.

[7]  Pavel Pudlák,et al.  Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.

[8]  Randal E. Bryant,et al.  COSMOS: a compiled simulator for MOS circuits , 1987, DAC '87.

[9]  Toniann Pitassi,et al.  Propositional Proof Complexity: Past, Present and Future , 2001, Bull. EATCS.

[10]  Carsten Sinz,et al.  Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , 2005, CP.

[11]  Vasco M. Manquinho,et al.  Open-WBO: A Modular MaxSAT Solver, , 2014, SAT.

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

[13]  Henry A. Kautz,et al.  Algorithmic applications of propositional proof complexity , 2005 .

[14]  Fahiem Bacchus,et al.  Exploiting the Power of mip Solvers in maxsat , 2013, SAT.

[15]  Peter Clote,et al.  Cutting planes, connectivity, and threshold logic , 1996, Arch. Math. Log..

[16]  Armin Biere.  Lingeling, Plingeling and Treengeling Entering the SAT Competition 2013 , 2013 .

[17]  Ran Raz,et al.  On Interpolation and Automatization for Frege Systems , 2000, SIAM J. Comput..

[18]  Fahiem Bacchus,et al.  Solving MAXSAT by Solving a Sequence of Simpler SAT Instances , 2011, CP.

[19]  Luigi Palopoli,et al.  Algorithms for Selective Enumeration of Prime Implicants , 1999, Artif. Intell..

[20]  Henry A. Kautz,et al.  Towards Understanding and Harnessing the Potential of Clause Learning , 2004, J. Artif. Intell. Res..

[21]  Jakob Nordström.  On the interplay between proof complexity and SAT solving , 2015, SIGL.

[22]  Jinbo Huang,et al.  Extended clause learning , 2010, Artif. Intell..

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

[24]  R. Impagliazzo,et al.  Lower bounds on Hilbert's Nullstellensatz and propositional proofs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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

[26]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[27]  Javier Larrosa,et al.  Resolution in Max-SAT and its relation to local consistency in weighted CSPs , 2005, IJCAI.

[28]  Gilles Audemard,et al.  A Restriction of Extended Resolution for Clause Learning SAT Solvers , 2010, AAAI.

[29]  M. Ajtai.  Parity and the Pigeonhole Principle , 1990 .

[30]  Alexey Ignatiev,et al.  MSCG: Robust Core-Guided MaxSAT Solving , 2015, J. Satisf. Boolean Model. Comput..

[31]  Matti Järvisalo,et al.  LMHS: A SAT-IP Hybrid MaxSAT Solver , 2016, SAT.

[32]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[33]  P. Pudlák.  Sets and Proofs: On the Complexity of the Propositional Calculus , 1999 .

[34]  Fahiem Bacchus,et al.  Postponing Optimization to Speed Up MAXSAT Solving , 2013, CP.