Handbook of theoretical computer science (vol. B)
Strong Cyclic Planning Revisited
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Planning with a language for extended goals
Eighteenth national conference on Artificial intelligence
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
Anytime state-based solution methods for decision processes with non-Markovian rewards
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
| Hi-index | 0.00 |
The extended goals in non-deterministic domains are often expressed in temporal logic, particularly in CTL and EAGLE. No work has given a formal comparison between EAGLE and CTL on semantics, though it is said that the capability of representing the "intentional" aspects of goals and the possibility of dealing with failure are the main new features of EAGLE w.r.t. CTL. According to the formal semantics for EAGLE and CTL, we prove that all the EAGLE formulas in which only LV1 operators (i.e. the operators representing the "intentional" aspects of goals) appear and some EAGLE formulas including LV2 operators (i.e. the operators dealing with failure and qualitative preferences) can be replaced by some CTL formulas without any change on semantics. Finally, we also find some basic and important goals in non-deterministic domains that exceed the expressive ability of EAGLE.