Equivalence Between Systems Stronger Than Resolution

In recent years there has been an increasing interest in studying proof systems stronger than Resolution, with the aim of building more efficient SAT solvers based on them. In defining these proof systems, we try to find a balance between the power of the proof system (the size of the proofs required to refute a formula) and the difficulty of finding the proofs. Among those proof systems we can mention Circular Resolution, MaxSAT Resolution with Extensions and MaxSAT Resolution with the Dual-Rail encoding. In this paper we study the relative power of those proof systems from a theoretical perspective. We prove that Circular Resolution and MaxSAT Resolution with extension are polynomially equivalent proof systems. This result is generalized to arbitrary sets of inference rules with proof constructions based on circular graphs or based on weighted clauses. We also prove that when we restrict the Split rule (that both systems use) to bounded size clauses, these two restricted systems are also equivalent. Finally, we show the relationship between these two restricted systems and Dual-Rail MaxSAT Resolution.

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

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

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

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

[5]  Hans Kleine Büning,et al.  On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas , 2017, TAMC.

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

[7]  Barnaby Martin,et al.  Tight rank lower bounds for the Sherali-Adams proof system , 2009, Theor. Comput. Sci..

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

[9]  Joao Marques-Silva,et al.  DRMaxSAT with MaxHS: First Contact , 2019, SAT.

[10]  Maria Luisa Bonet,et al.  A Complete Calculus for Max-SAT , 2006, SAT.

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

[12]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..

[13]  Albert Atserias,et al.  Automating Resolution is NP-Hard , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

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

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