US 9,811,383 B2
Processing a composite task based on a semantic relation graph
Jun Fang, Xi'an (CN)
Assigned to EMPIRE TECHNOLOGY DEVELOPMENT LLC, Wilmington, DE (US)
Appl. No. 14/647,701
Filed by EMPIRE TECHNOLOGY DEVELOPMENT LLC, Wilmington, DE (US)
PCT Filed May 5, 2014, PCT No. PCT/CN2014/076770
§ 371(c)(1), (2) Date May 27, 2015,
PCT Pub. No. WO2015/168835, PCT Pub. Date Nov. 12, 2015.
Prior Publication US 2016/0041847 A1, Feb. 11, 2016
Int. Cl. G06F 9/46 (2006.01); G06F 9/455 (2006.01); G06F 9/50 (2006.01); G06F 9/52 (2006.01)
CPC G06F 9/5038 (2013.01) [G06F 9/52 (2013.01)] 16 Claims
OG exemplary drawing
 
13. A device configured to process a composite task, the device comprising:
a processor;
a memory that stores an ontology, a semantic relation graph, and instructions, wherein the instructions, when executed by the processor, cause the processor to:
receive the composite task;
transform the composite task into a set of atomic tasks, wherein each atomic task in the set of atomic tasks includes a respective assertion, wherein each atomic task is a subset task of the composite task, and wherein the set of atomic tasks includes at least a first atomic task, a second atomic task, and a third atomic task;
wherein the instructions further cause the processor to:
transform the composite task into standard form descriptive logic notation, wherein the standard form descriptive logic notation of the composite task includes inclusion axioms and composite task concepts;
transform the inclusion axioms and additional concepts;
transform the composite task concepts and the additional concepts into negation normal form concepts; and
transform the negation normal form concepts into conjunctions which are used to separate the composite task into the set of atomic tasks;
determine that the first atomic task is equivalent to the second atomic task based on the semantic relation graph;
remove the second atomic task from the set of atomic tasks, based on the determination of equivalence, to generate a list of atomic tasks, wherein the list includes at least the first atomic task and the third atomic task;
order the list of atomic tasks based on the semantic relation graph; and
process at least a first selected atomic task in the ordered list of atomic tasks to process the composite task, wherein the ordered list of atomic tasks includes n atomic tasks, and wherein the first selected atomic task is at a position n/2 or (n+1)/2 within the ordered list of atomic tasks.