论命题规划形式的可解释性和表达力
On the Compilability and Expressive Power of Propositional Planning Formalisms
摘要:
最近的方法,扩展的GRAPHOLOGY算法来处理更多的表达规划形式主义提出了一个问题,什么是“表达能力”的正式含义。我们形式化的直觉,表达能力是一个衡量如何简洁地规划域和计划可以表示在一个特定的形式主义,通过引入规划形式主义之间的概念“编译方案”。使用这个概念,我们分析了一个大家庭的命题规划形式主义的表达能力,范围从基本的CIPPS的形式主义与条件的影响,部分状态规范,命题公式的前提条件。其中一个结果是,如果计划大小仅应线性增长,则条件效应不能被编译掉,但如果我们允许结果计划的多项式增长,则条件效应可以被编译掉。这一结果证实,最近提出的扩展GRAPHOLOGY算法的条件效应是最佳的“可编译性”的框架。另一个结果是,一般命题公式不能编译成条件效应,如果计划的大小应保持线性。这意味着在前提条件和效果条件中允许一般命题公式增加了生成计划的另一个难度。
英文摘要:
The recent approaches of extending the GRAPHPLAN algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of "expressive power" is. We formalize the intuition that expressive power is a measure of how concisely planning domains and plans can be expressed in a particular formalism by introducing the notion of "compilation schemes" between planning formalisms. Using this notion, we analyze the expressiveness of a large family of propositional planning formalisms, ranging from basic STRIPS to a formalism with conditional effects, partial state specifications, and propositional formulae in the preconditions. One of the results is that conditional effects cannot be compiled away if plan size should grow only linearly but can be compiled away if we allow for polynomial growth of the resulting plans. This result confirms that the recently proposed extensions to the GRAPHPLAN algorithm concerning conditional effects are optimal with respect to the "compilability" framework. Another result is that general propositional formulae cannot be compiled into conditional effects if the plan size should be preserved linearly. This implies that allowing general propositional formulae in preconditions and effect conditions adds another level of difficulty in generating a plan.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。