DeepAI AI Chat
Log In Sign Up

Classification of minimally unsatisfiable 2-CNFs

by   Hoda Abbasizanjani, et al.

We consider minimally unsatisfiable 2-CNFs, i.e., minimally unsatisfiable conjunctive normal forms, where each clause contains at most 2 literals (short 2-MUs). Characterisations of 2-MUs in the literature have been restricted to the nonsingular case (where every variable occurs positively and negatively at least twice), and those with a unit-clause. We provide the full classification of 2-MUs, and obtain polytime isomorphism decision. The main tool used here is the implication digraph, which allows to reduce the problem of determining the isomorphism types of 2-MUs to the isomorphism types of "weak double cycles" (WDCs), obtained from the digraph versions of undirected cycles by splitting vertices and arcs. We show that these digraphs have at most one skew-symmetry, and thus the skew-symmetric WDCs can be considered as 2-CNFs.


page 1

page 2

page 3

page 4


Cycles in the burnt pancake graphs

The pancake graph of S_n, the symmetric group on n elements, has been sh...

On Existence of Must-Include Paths and Cycles in Undirected Graphs

Given an undirected graph G=(V,E) and vertices s,t,w_1,w_2∈ V, we study ...

Lengths of Cycles in Generalized Pancake Graphs

In this paper, we consider the lengths of cycles that can be embedded on...

Regularized Iterative Method for Ill-posed Linear Systems Based on Matrix Splitting

In this paper, the concept of matrix splitting is introduced to solve a ...

The Good, the Bad, and the Odd: Cycles in Answer-Set Programs

Backdoors of answer-set programs are sets of atoms that represent clever...

Ensembles of Cycles Programmed in GiNaC

This library manipulates ensembles of cycles (quadrics), which are inter...

On the central levels problem

The central levels problem asserts that the subgraph of the (2m+1)-dimen...