A nonmonotonic temporal logic and its Kripke semantics
Journal of Information Processing
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Planning for temporally extended goals
Annals of Mathematics and Artificial Intelligence
Automata-Theoretic Approach to Planning for Temporally Extended Goals
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Decision-theoretic planning with non-Markovian rewards
Journal of Artificial Intelligence Research
Non-monotonic temporal logics for goal specification
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Synthesizing plant controllers using real-time goals
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
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
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Structured solution methods for non-Markovian decision processes
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.01 |
Temporal logics are widely used in specifying goals of agents. We noticed that when directing agents, humans often revise their requirements for the agent, especially as they gather more knowledge about the domain. However, all existing temporal logics, except one, do not focus on the revision of goals in an elaboration tolerant manner. Thus formal temporal logics that can allow elaboration tolerant revision of goals are needed. As non-monotonic languages are often used for elaboration tolerant specification, we propose to explore non-monotonic temporal logics for goal specification. Recently, a non-monotonic temporal logic, N-LTL, was proposed with similar aims. In N-LTL, goal specifications could be changed via strong and weak exceptions. However, in NLTL, one had to a-priori declare whether exceptions will be weak or strong exceptions. We propose a new nonmonotonic temporal logic, that not only overcomes this, but is also able to express exception to exceptions, strengthen and weaken preconditions, and revise and replace consequents; all in an elaboration tolerant manner.