资源分类
》 资源 》论文》Parameterized Complexity of Optimal Planning: A Detailed Map

Parameterized Complexity of Optimal Planning: A Detailed Map

2019-11-11 | |  51 |   36 |   0
Abstract The goal of this paper is a systematic parameterized complexity analysis of different variants of propositional S TRIPS planning. We identify several natural problem parameters and study all possible combinations of 9 parameters in 6 different settings. These settings arise, for instance, from the distinction if negative effects of actions are allowed or not. We provide a complete picture by establishing for each case either paraNPhardness (i.e., the parameter combination does not help) or W[t]-completeness with t ? {1, 2} (i.e., fixed-parameter intractability), or FPT (i.e., fixedparameter tractability).

上一篇：Knowledge Compilation for Model Counting: Affine Decision Trees

下一篇：Syntactic Labelled Tableaux for Łukasiewicz Fuzzy ALC

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...