Method and system for automatically assembling processing graphs in information processing systems
First Claim
1. A method for assembling processing graphs in an information processing system, comprising:
- performing, in an offline manner, translating a plurality of component descriptions into a planning language and performing reasoning on the plurality of component descriptions during the translation; and
performing, in an online manner, receiving a processing request that specifies a desired processing outcome;
translating the processing request into a planning goal; and
assembling a plurality of processing graphs, each of the processing graphs including a plurality of the translated and reasoned components that satisfy the desired processing outcome,wherein each of the plurality of component descriptions includes;
an applicability condition that includes variables representing objects that must be included in a pre-inclusion state, wherein the pre-inclusion state is a state against which the applicability of the component for inclusion in a processing graph is evaluated; and
an inclusion effect that includes variables representing objects that must be included in a post-inclusion state, wherein the post-inclusion state is a state resulting from inclusion of the component in the processing graph,wherein every one of the variables in the inclusion effect must be included in the applicability condition,wherein each component creates at least one new object graph for each output.
2 Assignments
0 Petitions
Accused Products
Abstract
A method for assembling processing graphs in an information processing system, includes: performing, in an offline manner, translating a plurality of component descriptions into a planning language and performing reasoning on the plurality of component descriptions during the translation; and performing, in an online manner, receiving a processing request that specifies a desired processing outcome; translating the processing request into a planning goal; and assembling a plurality of processing graphs, each of the processing graphs including a plurality of the translated and reasoned components that satisfy the desired processing outcome.
150 Citations
29 Claims
-
1. A method for assembling processing graphs in an information processing system, comprising:
-
performing, in an offline manner, translating a plurality of component descriptions into a planning language and performing reasoning on the plurality of component descriptions during the translation; and performing, in an online manner, receiving a processing request that specifies a desired processing outcome;
translating the processing request into a planning goal; and
assembling a plurality of processing graphs, each of the processing graphs including a plurality of the translated and reasoned components that satisfy the desired processing outcome,wherein each of the plurality of component descriptions includes; an applicability condition that includes variables representing objects that must be included in a pre-inclusion state, wherein the pre-inclusion state is a state against which the applicability of the component for inclusion in a processing graph is evaluated; and an inclusion effect that includes variables representing objects that must be included in a post-inclusion state, wherein the post-inclusion state is a state resulting from inclusion of the component in the processing graph, wherein every one of the variables in the inclusion effect must be included in the applicability condition, wherein each component creates at least one new object graph for each output. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. A system for assembling processing graphs in an information processing system, comprising:
-
a memory device for storing a program; a processor in communication with the memory device, the processor operative with the program to; perform, in an offline manner, translating a plurality of component descriptions into a planning language and performing reasoning on the plurality of component descriptions during the translation; and perform, in an online manner, receiving a processing request that specifies a desired processing outcome;
translating the processing request into a planning goal; and
assembling a plurality of processing graphs, each of the processing graphs including a plurality of the translated and reasoned components that satisfy the desired processing outcome,wherein each of the plurality of component descriptions includes; an applicability condition that includes variables representing objects that must be included in a pre-inclusion state, wherein the pre-inclusion state is a state against which the applicability of the component for inclusion in a processing graph is evaluated; and an inclusion effect that includes variables representing objects that must be included in a post-inclusion state, wherein the post-inclusion state is a state resulting from inclusion of the component in the processing graph, wherein every one of the variables in the inclusion effect must be included in the applicability condition, wherein each component creates at least one new object graph for each output. - View Dependent Claims (16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28)
-
-
29. A computer program product comprising a non-transitory computer useable medium having computer program logic recorded thereon for assembling processing graphs in an information processing system, the computer program logic comprising:
-
program code for performing, in an offline manner, translating a plurality of component descriptions into a planning language and performing reasoning on the plurality of component descriptions during the translation; and program code for performing, in an online manner, receiving a processing request that specifies a desired processing outcome;
translating the processing request into a planning goal; and
assembling a plurality of processing graphs, each of the processing graphs including a plurality of the translated and reasoned components that satisfy the desired processing outcome,wherein each of the plurality of component descriptions includes; an applicability condition that includes variables representing objects that must be included in a pre-inclusion state, wherein the pre-inclusion state is a state against which the applicability of the component for inclusion in a processing graph is evaluated; and an inclusion effect that includes variables representing objects that must be included in a post-inclusion state, wherein the post-inclusion state is a state resulting from inclusion of the component in the processing graph, wherein every one of the variables in the inclusion effect must be included in the applicability condition, wherein each component creates at least one new object graph for each output.
-
Specification