Some contributions to the metatheory of the situation calculus
Journal of the ACM (JACM)
ConGolog, a concurrent programming language based on the situation calculus
Artificial Intelligence
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
On the Semantics of Deliberation in Indigolog—from Theory to Implementation
Annals of Mathematics and Artificial Intelligence
Automatic composition of transition-based semantic web services with messaging
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Automatic synthesis of new behaviors from a library of available behaviors
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Property persistence in the situation calculus
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A sampling-based approach to identify QoS for web service orchestrations
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
On supervising agents in situation-determined ConGolog
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Automatic behavior composition synthesis
Artificial Intelligence
Hi-index | 0.00 |
We look at composition of (possibly nonterminating) high-level programs over situation calculus action 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 realized 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 investigated in the CS and AI literature, but always assuming finite states settings. Here, instead, we investigate 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 exploiting recent results in the AI literature, we devise a sound and well characterized technique to actually solve the problem.