6. The method according to claim 5 , wherein the at least one hardware processor further performs: obtaining a set complement of the largest composite sets of evidences G that supports negation of the target rule L; and computing a composite object ω 2 p indicative according to a deductive reasoning of a second plausibility value for the target rule L.
8. The method according to claim 6 , wherein the at least one hardware processor further performs adding a new object in form U→L, where the new object is the target rule L supported by the U, to the knowledge base, to expand the knowledge base to an expanded knowledge base; and the largest composite sets of evidences G is created from the expanded knowledge base that supports a logical truth T created on basis of the target rule L, subject to the relationship constraints κ which support the composite rule L 0 , to compute a third plausibility value for the target rule L.