Artificial intelligence and mathematical theory of computation
Artificial Intelligence
Planning control rules for reactive agents
Artificial Intelligence
Reasoning about nondeterministic and concurrent actions: a process algebra approach
Artificial Intelligence
ConGolog, a concurrent programming language based on the situation calculus
Artificial Intelligence
Planning for temporally extended goals
Annals of Mathematics and Artificial Intelligence
A Product Version of Dynamic Linear Time Temporal Logic
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
PDL-based framework for reasoning about actions
AI*IA '95 Proceedings of the 4th Congress of the Italian Association for Artificial Intelligence on Topics in Artificial Intelligence
A causal theory of ramifications and qualifications
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Embracing causality in specifying the indirect effects of actions
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Representing actions and state constraints in model-based diagnosis
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Planning with concurrent interacting actions
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
| Hi-index | 0.00 |
In this paper we present a theory for reasoning about actions which is based on the Product Version of Dynamic Linear Time Temporal Logic (denoted DLTL⊗) and allows to describe the behaviour of a network of sequential agents which coordinate their activities by performing common actions together. DLTL⊗ extends LTL, the propositional linear time temporal logic, by strengthening the until operator by indexing it with the regular programs of dynamic logic. Moreover, it allows the formulas of the logic to be decorated with the names of sequential agents, taken from a finite set. The action theory we propose is an extension of the theory presented in [8], which is based on the logic DLTL, and allows reasoning with incomplete initial states and dealing with postdiction, ramifications as well as with nondeterministic actions. Here we extend this theory to cope with multiple agents synchronizing on common actions.