COMPOSITE TASK PROCESSOR

1 . A method to execute a composite task, the method comprising, by one or more processors:

obtaining the composite task;

transforming the composite task into a plurality of atomic tasks;

determining, based on a semantic relation graph, respective semantic relationships between the plurality of atomic tasks;

generating, based on the respective semantic relationships, from the plurality of atomic tasks, a list of atomic tasks, wherein generating the list of atomic tasks includes generating a list inclusive of atomic tasks that are semantically different from each other in the semantic relation graph;

ordering the atomic tasks, included in the list of atomic tasks, to generate an ordered list of atomic tasks, wherein ordering the atomic tasks is based on respective semantic relationships between the atomic tasks included in the list of atomic tasks; and

processing at least a first selected atomic task in the ordered list of atomic tasks to execute the composite task, wherein the first selected atomic task is less semantically restrictive than at least one of the atomic tasks in the ordered list of atomic tasks, and wherein the first selected atomic task is more semantically restrictive than at least another one of the atomic tasks in the ordered list of atomic tasks.

2 . The method of claim 1 , wherein generating the list of atomic tasks includes removing, from the plurality of atomic tasks, all except one atomic task, which are semantically equivalent to each other in the semantic relation graph.

3 . The method of claim 1 , further comprising:

constructing the semantic relation graph, prior to obtaining the composite task.

4 . The method of claim 3 , wherein constructing the semantic relation graph includes constructing the semantic relation graph based on an ontology.

5 . The method of claim 1 , further comprising, prior to obtaining the composite task:

obtaining a first symbol and a second symbol in an ontology;

determining a semantic relationship between the first symbol and the second symbol; and

generating, based at least on the semantic relationship between the first symbol and the second symbol, the semantic relation graph, wherein:

determining the respective semantic relationships between the plurality of atomic tasks includes determining, based on the semantic relation graph, that a particular atomic task, of the plurality of atomic tasks, is equivalent to another atomic task, of the plurality of atomic tasks, and

generating the list of atomic tasks includes removing one of the particular atomic task and the another atomic task from the plurality of atomic tasks.

6 . The method of claim 1 , further comprising:

obtaining a response to the processing of the first selected atomic task; and

determining, based on the response, not to process the at least another one of the atomic tasks that is less semantically restrictive than the first selected atomic task.

7 . The method of claim 1 , wherein transforming the composite task into the plurality of atomic tasks includes:

transforming the composite task into a standard form descriptive logic notation, wherein the standard form descriptive logic notation of the composite task includes inclusion axioms, assertions, queries, 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.

8 . A method to execute a composite task, the method comprising, by one or more processors:

obtaining the composite task;

transforming the composite task into a plurality of atomic tasks;

determining, based on a semantic relation graph, respective semantic relationships between the plurality of atomic tasks;

generating, based on the respective semantic relationships, a list of atomic tasks, wherein generating the list of atomic tasks includes removing, from the plurality of atomic tasks, at least one atomic task that is semantically equivalent, in the semantic relation graph, to another atomic task included in plurality of atomic tasks;

ordering atomic tasks included in the list of atomic tasks to generate an ordered list of atomic tasks, wherein ordering the atomic tasks is based on respective semantic relationships between the atomic tasks included in the list of atomic tasks;

processing at least a first selected atomic task in the ordered list of atomic tasks to execute the composite task;

obtaining a response to the processing of the first selected atomic task; and

determining, based on the response, not to process another atomic task, in the ordered list of atomic tasks, to execute the composite task,

wherein the first selected atomic task is more semantically restrictive, in the semantic relationship graph, than the another atomic task in the ordered list of atomic tasks.

9 . The method of claim 8 , further comprising, prior to obtaining the composite task, generating the semantic relation graph by:

obtaining a first symbol and a second symbol in an ontology; and

determining a semantic relationship between the first symbol and the second symbol in the ontology.

10 . The method of claim 8 , wherein processing at least the first selected atomic task includes selecting an atomic task that is less semantically restrictive than at least one of the atomic tasks in the ordered list of atomic tasks.

11 . The method of claim 8 , wherein:

the plurality of atomic tasks includes a first atomic task, a second atomic task, a third atomic task, and a fourth atomic task, and

removing, from the plurality of atomic tasks, the at least the atomic task includes removing the second atomic task and the fourth atomic task that are semantically equivalent, in the semantic relation graph, to the first atomic task and the third atomic task respectively.

12 . The method of claim 8 , wherein transforming the composite task into the plurality of atomic tasks includes:

transforming the composite task into a standard form descriptive logic notation, wherein the standard form descriptive logic notation of the composite task includes inclusion axioms, assertions, queries, 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.

13 . The method of claim 8 , further comprising:

constructing the semantic relation graph based on an ontology, wherein the semantic relation graph illustrates relationships between standard form descriptive logic notations and symbols of the ontology.

14 . A device configured to execute a composite task, the device comprising:

one or more processors; and

a memory, operably coupled to the one or more processors, configured to store instructions, which in response to execution by the one or more processors, cause the one or more processors to:

obtain the composite task;

transform the composite task into a plurality of atomic tasks;

determine, based on a semantic relation graph, respective semantic relationships between the plurality of atomic tasks;

generate, based on the respective semantic relationships, a list of atomic tasks, wherein the list of atomic tasks includes atomic tasks that are semantically different from each other in the semantic relation graph;

order the atomic tasks included in the list of atomic tasks to generate an ordered list of atomic tasks, wherein ordering the atomic tasks is based on respective semantic relationships between the atomic tasks included in the list of atomic tasks; and

process at least a first selected atomic task in the ordered list of atomic tasks to execute the composite task, wherein the first selected atomic task is less semantically restrictive than at least one of the atomic tasks in the ordered list of atomic tasks, and wherein the first selected atomic task is more semantically restrictive than at least another one of the atomic tasks in the ordered list of atomic tasks.

15 . The device of claim 14 , wherein, prior to obtaining the composite task, the instructions, in response to execution by the one or more processors, further cause the one or more processors to:

obtain a first symbol and a second symbol in an ontology;

determine a semantic relationship between the first symbol and the second symbol; and

generate, based at least on the semantic relationship between the first symbol and the second symbol, the semantic relation graph.

16 . The device of claim 14 , wherein, to transform the composite task into the plurality of atomic tasks, the instructions, in response to execution by the one or more processors, cause the one or more processors to:

transform the composite task into a standard form descriptive logic notation, wherein the standard form descriptive logic notation of the composite task includes inclusion axioms, assertions, queries, and composite task concepts;

transform the inclusion axioms and into 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.

17 . The device of claim 14 , wherein the instructions, in response to execution by the one or more processors, further cause the one or more processors to:

obtain a response to the processing of the first selected atomic task; and

determine, based on the response, not to process the at least another one of the atomic tasks that is less semantically restrictive than the first selected atomic task.

18 . The device of claim 14 , wherein the memory is further operable to store the semantic relation graph.

19 . The device of claim 14 , wherein the instructions, in response to execution by the one or more processors, further cause the one or more processors to:

access the semantic relation graph over a network.

20 . The device of claim 14 , wherein the instructions, in response to execution by the one or more processors, further cause the one or more processors to:

generate, based on an ontology stored in the memory, the semantic relation graph, wherein the semantic relation graph illustrates that:

a first symbol of the ontology is semantically equivalent to a second symbol of the ontology,

a third symbol of the ontology is semantically more restrictive than the second symbol of the ontology, and

the third symbol of the ontology is semantically less restrictive than a fourth symbol of the ontology.