Alternating-time temporal logic
Journal of the ACM (JACM)
Planning for temporally extended goals
Annals of Mathematics and Artificial Intelligence
Planning with a language for extended goals
Eighteenth national conference on Artificial intelligence
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
A logic for strategic reasoning
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Planning as model checking for extended goals in non-deterministic domains
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Computational complexity of planning with temporal goals
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A logic-based agent that plans for extended reachability goals
Autonomous Agents and Multi-Agent Systems
Using α-ctl to Specify Complex Planning Goals
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Temporal Reasoning in Urban Growth Simulation
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Non-monotonic temporal logics for goal specification
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
| Hi-index | 0.00 |
One important aspect in directing cognitive robots or agents is to formally specify what is expected of them. This is often referred to as goal specification. Temporal logics such as LTL, and CTL* have been used to specify goals of cognitive robots and agents when their actions have deterministic consequences. It has been suggested that in domains where actions have non-deterministic effects, temporal logics may not be able to express many intuitive and useful goals. In this paper we first show that this is indeed true with respect to existing temporal logics such as LTL, CTL*, and π-CTL*. We then propose the language, P-CTL*, which includes the quantifiers, exist a policy and for all policies. We show that this language allows for the specification of richer goals, including many intuitive and useful goals mentioned in the literature which cannot be expressed in existing temporal languages. We generalize our approach of showing the limitations of π-CTL* to develop a framework to compare expressiveness of goal languages.