Satisfiability dgree is the resource of demonstrating uncertainity. It figures out Weather the scope of prepositional formula be true.Present algorithm calculates the satisfiability degree overlooking the dependency among propositional atoms.we simplify the calculations by using the current algorithm if there is dependencies. Dependency matrix is used to characterize the dependencies. The truth indicator stage of algorithm enumerate the satisfiability degree of a propositional formula. The unproved result shows more efficiency if there is excess dependency among the atoms.