On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas

In this paper, we analyze 2CNF formulas from the perspectives of Read-Once resolution (ROR) refutation schemes. We focus on two types of ROR refutations, viz., variable-once refutation and clause-once refutation. In the former, each variable may be used at most once in the derivation of a refutation, while in the latter, each clause may be used at most once. We show that the problem of checking whether a given 2CNF formula has an ROR refutation under both schemes is NP-complete. This is surprising in light of the fact that there exist polynomial refutation schemes (tree-resolution and DAG-resolution) for 2CNF formulas.

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

[2]  Toniann Pitassi,et al.  Simplified and improved resolution lower bounds , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[3]  Nachum Dershowitz,et al.  In handbook of automated reasoning , 2001 .

[4]  Nathan Linial,et al.  Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas , 1986, J. Comb. Theory, Ser. A.

[5]  BüningHans Kleine,et al.  On the structure of some classes of minimal unsatisfiable formulas , 2003 .

[6]  Stephen A. Cook,et al.  Time-bounded random access machines , 1972, J. Comput. Syst. Sci..

[7]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[8]  Stefan Szeider.  NP-Completeness of Refutability by Literal-Once Resolution , 2001, IJCAR.

[9]  Stefan Szeider,et al.  Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference , 2002, Theor. Comput. Sci..

[10]  Harald Ganzinger,et al.  Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.

[11]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

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

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

[14]  Hans Kleine Büning,et al.  The Complexity of Read-Once Resolution , 2004, Annals of Mathematics and Artificial Intelligence.

[15]  Hans Kleine Büning,et al.  On the structure of some classes of minimal unsatisfiable formulas , 2003, Discret. Appl. Math..

[16]  Samuel R. Buss,et al.  Resolution and the Weak Pigeonhole Principle , 1997, CSL.

[17]  Nathan Segerlind,et al.  The Complexity of Propositional Proofs , 2007, Bull. Symb. Log..

[18]  Christos H. Papadimitriou,et al.  The complexity of facets resolved , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[19]  Hans Kleine Büning,et al.  An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF , 1998, Annals of Mathematics and Artificial Intelligence.

[20]  Alasdair Urquhart,et al.  The Complexity of Propositional Proofs , 1995, Bulletin of Symbolic Logic.

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