16. At least one server, comprising: at least one non-transitory computer readable storage medium configured to store: a mapping of values to sets of evidences U in a knowledge base, and objects in the form E→A, where A is a rule among rules in the knowledge base, and E is a subset of the sets of evidences U from the knowledge base that supports the rule A, so that the rule A is supportable by the subset of evidences E; and at least one hardware processor coupled to the at least one memory to execute instructions stored in the at least one memory, which instructions when executed by the at least one hardware processor, cause the at least one server: determine relationship constraints κ in form of set relations among a plurality of subsets of evidences E; and in response to at least one request, compute for a target rule L, a first composite object with respect to validity (v) ω 1 v =G 1 →L 0 and/or with respect to plausibility (p), ω 1 p =G 1 →L 0 , the first composite object ω 1 v or ω 1 p constructed from a combination of the objects E→A to create a composite sets of evidences G 1 v or G 1 p subject to the relationship constraints κ which support a composite rule L 0 v or L 0 p , the composite rule L 0 v or L 0 p being a combination of the rules implying the target rule L according to deductive reasoning indicated by the mapping of the values to the sets of evidences U, the first composite object ω 1 v or ω 1 p indicative according to the deductive reasoning of a first validity value or a first plausibility value for the target rule L.
16. At least one server, comprising: at least one non-transitory computer readable storage medium configured to store: a mapping of values to sets of evidences U in a knowledge base, and objects in the form E→A, where A is a rule among rules in the knowledge base, and E is a subset of the sets of evidences U from the knowledge base that supports the rule A, so that the rule A is supportable by the subset of evidences E; and at least one hardware processor coupled to the at least one memory to execute instructions stored in the at least one memory, which instructions when executed by the at least one hardware processor, cause the at least one server: determine relationship constraints κ in form of set relations among a plurality of subsets of evidences E; and in response to at least one request, compute for a target rule L, a first composite object with respect to validity (v) ω 1 v =G 1 →L 0 and/or with respect to plausibility (p), ω 1 p =G 1 →L 0 , the first composite object ω 1 v or ω 1 p constructed from a combination of the objects E→A to create a composite sets of evidences G 1 v or G 1 p subject to the relationship constraints κ which support a composite rule L 0 v or L 0 p , the composite rule L 0 v or L 0 p being a combination of the rules implying the target rule L according to deductive reasoning indicated by the mapping of the values to the sets of evidences U, the first composite object ω 1 v or ω 1 p indicative according to the deductive reasoning of a first validity value or a first plausibility value for the target rule L. 21. The at least one server according to claim 16 , wherein the at least one hardware processor further: creates a largest composite sets of evidences G according to a union of a plurality of composite sets of evidences G 1 v , subject to the relationship constraints κ , which support the composite rule L 0 v ; and computes a composite object ω 2 v indicative according to a deductive reasoning of a second validity value for target rule L.