10. The method according to claim 1 , wherein the at least one hardware processor further performs: creating a new knowledge base including complements of the objects E→A; computing for a negated target rule L′ of the target rule L, subject to the relationship constraints κ , a second composite object with respect to validity ω 1 v −=G 2 →L 1 , and/or with respect to plausibility ω 1 p −=G 2 →L 1 , the second composite object ω 2 v or ω 2 p constructed from a combination of the complements of the objects E→A to create a composite sets of evidences ω 2 v or ω 2 p subject to the relationship constraints κ which support a composite rule L 1 v or L 1 p , the composite rule L 1 v or L 1 p being a combination of negated rules L′ implying the target rule L according to inductive reasoning using the new knowledge base, the second composite object ω 2 v or ω 2 p indicative according to inductive reasoning of a third validity or a third plausibility value for the target rule L using the new knowledge base.
14. The method according to claim 10 , wherein the knowledge base is a Free-Form Data Base generated according to a conversion of relational data bases and/or deductive data bases to the Free-Form Database.