Augmented exploration for big data and beyond

An apparatus, comprising:

• at least one memory;
• and
• at least one processor coupled to the at least one memory to execute instructions stored in the at least one memory to cause the apparatus to:
• generate specification concept graphs of nodes spec1, spec2, . . . , specm including concepts node and relation nodes according to at least one of a plurality of digitized data from user input from a plurality of computerized data sources d1, d2, . . . , dl forming a first set of evidences U;
• generate concept graphs of nodes cα1, cα2, . . . , cαn including concept nodes and relation nodes for corresponding obtained plurality of IKs α1, α2 . . . , αn forming a second set of evidences U;
• select a subset of concept graphs of nodes cαi1, cαi2 . . . , cαih from cα1, cα2, . . . , cαn according to a computable measure of consistency threshold between each cαj in cα1, cα2, . . . , cαn to each specification concept graph speck in spec1, spec2, . . . , specm;
• generate knowledge fragments for corresponding obtained subset of concept graphs cαi1, cαi2, . . . , cαih,
• a knowledge fragment among the knowledge fragments storing a mapping of values to first and second sets of evidences U, where A is a rule among rules in the knowledge base, and E is a subset of the first and second 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, according to the concept fragments;
• create or add into at least one among a plurality of knowledge-bases (KBs) for the corresponding knowledge fragments obtained as follows:
• creating objects in form ω=E→A from the concept fragments;
• determining relationship constraints κ in form of set relations among a plurality of subsets of evidences E for a plurality of the objects ω;
• compute for each object ω a validity (v) and a plausibility (p) based upon atomic propositions among the rules A.