Patent Document ID: 9811383
Application ID: 14647701

Base Claim:
1. A method to process a composite task, the method comprising, by a processor: receiving the composite task; transforming 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 transforming the composite task into the set of atomic tasks includes: transforming 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; transforming the inclusion axioms into additional concepts; transforming the composite task concepts and the additional concepts into negation normal form concepts; and transforming the negation normal form concepts into conjunctions which are used to separate the composite task into the set of atomic tasks; determining that the first atomic task is equivalent to the second atomic task based on an ontology; removing 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; ordering the list of atomic tasks based on the ontology to produce an ordered list of atomic tasks; and processing 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.

---

Claim 4:
4. The method of claim 1 , further comprising utilizing a semantic relation graph to order the list of atomic tasks.