资源分类
》 资源 》论文》Towards Fully Observable Non-Deterministic Planning as Assumption-Based Automatic Synthesis

Towards Fully Observable Non-Deterministic Planning as Assumption-Based Automatic Synthesis

2019-11-20 | |  69 |   49 |   0
Abstract Whereas previous work on non-deterministic planning has focused on characterizing (and computing) “loopy” but “closed” plans, we look here at the kind of environments that these plans are to be executed in. In particular, we provide a logical characterization of the standard “fairness” assumption used, and show that strong cyclic plans are correct solution concepts for fair environments. We argue then that such logical characterization allows us to recast non-deterministic planning as a reactive synthesis task, and show that for a special case, recent efficient synthesis techniques can be applied.

上一篇：Characterization of the Expressivity of Existential Rule Queries

下一篇：Belief Revision and Progression of Knowledge Bases in the Epistemic Situation Calculus

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

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

  • Joint Pose and Ex...

    Facial expression recognition (FER) is a challe...