Necessary and sufficient conditions for Boolean satisfiability

by   Stepan G. Margaryan, et al.

The study in this article seeks to find conditions that are necessary and sufficient for the satisfiability of a Boolean function. We will use the concept of special covering of a set introduced in [9] and study the connection of this concept with the satisfiability of Boolean functions. The basic definitions connected with the concept of special covering are given again. Generally, accepted terminology on set theory, Boolean functions, and graph theory is consistent with the terminology found in the relevant works included in the bibliography [1] [2] [3]. The newly introduced terms are not found in use by other authors and do not contradict to other terms. The bibliography also includes some articles related to the subject being studied. We show that the problem of existence of a special covering of a set is equivalent to the Boolean satisfiability problem. Thus, an important result is the proof of the existence of necessary and sufficient conditions for the existence of special covering of the set. Also we introduce the concept of proportional conjunctive normal form of a function, which is a conjunctive normal form of a function with the condition that each clause contains a negative literal or each clause contains a positive literal. We prove that Boolean function represented in conjunctive normal form is satisfable if and only if it is transformed into a function in proportional conjunctive normal form.


page 1

page 2

page 3

page 4


About a certain NP complete problem

In this article, we introduce the concept of special decomposition of a ...

Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and its Implications on P versus NP problem

In this paper, a necessary and sufficient condition for satisfiability o...

Condition for neighborhoods in covering based rough sets to form a partition

Neighborhood is an important concept in covering based rough sets. That ...

Characteristic matrix of covering and its application to boolean matrix decomposition and axiomatization

Covering is an important type of data structure while covering-based rou...

A Linear Complementarity Theorem to solve any Satisfiability Problem in conjunctive normal form in polynomial time

Any satisfiability problem in conjunctive normal form can be solved in p...

On Minimal Copulas under the Concordance Orde

In the present paper, we study extreme negative dependence focussing on ...

Please sign up or login with your details

Forgot password? Click here to reset