Los puntos clave no están disponibles para este artículo en este momento.
One question which has occupied mathematicians, engineers and scientists of this age is the problem of Boolean satisfiability (SAT) which asks whether a given CNF formula has at least a satisfying assignment. The goal of this work is to present a novel, efficient and general method of deciding SAT and finding all the satisfying assignments of CNF formulas. This method is powerful as it employs resolution identities in transforming clauses without a particular variable into clauses with that variable.
Okoh Ufuoma (Thu,) studied this question.