资源论文On the Complexity and Expressiveness of Automated Planning Languages Supporting Temporal Reasoning

On the Complexity and Expressiveness of Automated Planning Languages Supporting Temporal Reasoning

2019-11-04 | |  75 |   39 |   0

Abstract Automated planning is an important area of Arti- fificial Intelligence, which has been thoroughly developed in the last decades. In recent years, a signifificant amount of research has focused on planning languages and systems supporting temporal reasoning, recognizing its importance in modeling and solving real-world complex tasks. Many such languages are action-based, i.e., they model planning problems by specifying which actions can be executed at any given time to affect the environment. Timeline-based planning, a different paradigm originally introduced to support planning and scheduling of space operations, models planning domains as systems composed of a set of independent, but interacting, components, whose behavior over time, the timelines, is governed by a set of temporal constraints. A thorough theoretical study of timeline-based planning languages, and a rigorous comparison with action-based languages, are still missing. We outline recent results and future directions on this front

上一篇:how a general purpose commonsense ontology can improve performance of learning based image retrieval

下一篇:the role of textualisation and argumentation in understanding the machine learning process

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...