Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas

• Published in: Annals of mathematics and artificial intelligence Vol. 90; no. 1; pp. 3 - 29
• Main Authors: Subramani, K., Wojciechowski, Piotr
• Format: Journal Article
• Language: English
• Published: Cham Springer International Publishing 01.01.2022; Springer; Springer Nature B.V
• Subjects: Algorithms; Analysis; Artificial Intelligence; Boolean; Canonical forms; Complex Systems; Computer Science; Design parameters; Logic programs; Mathematics; Parameterization; Polynomials; Exact exponential algorithms; Read-once resolution; 09; 27; 2CNF; 90
• ISSN: 1012-2443; 1573-7470
• DOI: 10.1007/s10472-021-09762-2

In this paper, we discuss algorithms for the problem of finding read-once resolution refutations of unsatisfiable 2CNF formulas within the resolution refutation system. Broadly, a read-once resolution refutation is one in which each constraint (input or derived) is used at most once. Read-once resolution refutations have been widely studied in the literature for a number of constraint system-refutation system pairs. For instance, read-once resolution has been analyzed for boolean formulas in conjunctive normal form (CNF) and read-once cutting planes have been analyzed for polyhedral systems. By definition, read-once refutations are compact, and hence valuable in applications that place a premium on visualization. The satisfiability problem (SAT) is concerned with finding a satisfying assignment for a boolean formula in CNF. While SAT is NP-complete in general, there exist some interesting subclasses of CNF formulas, for which it is decidable in polynomial time. One such subclass is the class of 2CNF formulas, i.e., CNF formulas in which each clause has at most two literals. The existence of efficient algorithms for satisfiability checking in 2CNF formulas (2SAT), makes this class useful from the perspective of modeling selected logic programs. The work in this paper is concerned with the read-once refutability problem (under resolution) in this subclass. Although 2SAT is decidable in polynomial time, the problem of finding a read-once resolution refutation of an unsatisfiable 2CNF formula is NP-complete . We design non-trivial, parameterized and exact exponential algorithms for this problem. Additionally, we study the computational complexity of finding a shortest read-once resolution refutation of a 2CNF formula.