Composition of ConGolog programs
Sebastian Sardiña, Giuseppe De Giacomo · 2009
We look at composition of (possibly nonterminat-ing) high-level programs over situation calculus ac-tion theories. Specifically the problem we look at is as follows: given a library of available ConGolog programs and a target program not in the library, verify whether the target program executions be re-alized by composing fragments of the executions of the available programs; and, if so, synthesize a controller that does the composition automatically. This kind of composition problems have been in-vestigated in the CS and AI literature, but always assuming finite states settings. Here, instead, we in-vestigate the issue in the context of infinite domains that may go through an infinite number of states as a result of actions. Obviously in this context the problem is undecidable. Nonetheless, by exploit-ing recent results in the AI literature, we devise a sound and well characterized technique to actually solve the problem. 1