Computation of satisfiability degree of a propositional formula using dependency matrix

Satisfiability degree measures the extent of a propositional formula to be true. Existing propositional matrix search algorithm computes the satisfiability degree of a propositional formula without considering the dependencies between the propositional atoms. There may exist dependencies between the propositional atoms and if exists it can be used to simplify the computation of propositional matrix search algorithm. In the proposed dependency propositional matrix search algorithm the dependencies are represented as a dependency matrix. The truth detector phase of dependency propositional matrix search algorithm considers the dependency matrix to compute the satisfiability degree of a propositional formula. Experimental results show that the proposed algorithm is effective than the existing algorithm if there are more dependencies between the propositional atoms.