An Algorithm for Calculating the Satisfiability Degree
Guiming Luo, Chongyuan Yin, Pei Hu · 2009
In the real world, there are situations of uncertainty that the classical logics are not capable to represent, consequently some non-classical logics emerged to compensate for the deficiency of the classical logics of expressing uncertainty. Satisfiability degree was presented as a new means of representing uncertainty. In this talk some properties of the satisfiability degree are viewed. An algorithm is proposed for computing the satisfiability degree of any proposition, which is developed by using XOBDD, an extension of OBDD.