资源分类
》 资源 》论文》Dynamic Logic of Parallel Propositional Assignments and its Applications to Planning

Dynamic Logic of Parallel Propositional Assignments and its Applications to Planning

2019-10-10 | |  66 |   47 |   0
Abstract We introduce a dynamic logic with parallel composition and two kinds of nondeterministic composition, exclusive and inclusive. We show PSPACE completeness of both the model checking and the satisfiability problem and apply our logic to sequential and parallel classical planning where actions have conditional effects

上一篇：Counterexample-Guided Strategy Improvement for POMDPs Using Recurrent Neural Networks

下一篇：Earliest-Completion Scheduling of Contract Algorithms with End Guarantees

用户评价
全部评价

热门资源

  • 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...

  • Rating-Boosted La...

    The performance of a recommendation system reli...