用逻辑程序的稳定模型与支持模型捕获(最优)松弛计划
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs
AI总结:
本文建立松弛规划与逻辑程序语义的联系,提出用稳定模型双射刻画可排序动作子集,并用因果与诊断两种支持模型编码计算最优松弛计划,诊断编码在 STRIPS 基准上优于现有方法。
摘要:
我们在无删除规划(delete-free planning)与逻辑程序设计之间建立了一种新颖关系;无删除规划是 AI 规划领域的一项重要任务,也称为松弛规划(relaxed planning)。我们表明,给定一个规划问题,所有可通过排序而为该问题产生松弛计划的动作子集,都能够与描述相应松弛规划问题的逻辑程序的稳定模型形成双射捕获。我们还研究了逻辑程序的支持模型语义,并提出将松弛规划问题编码为逻辑程序的一种因果编码和一种诊断编码;二者都能用其支持模型捕获松弛计划。实验结果表明,这些新编码在计算最优松弛计划时可带来显著性能提升;在大量 STRIPS 规划基准上测量时,无论给定何种时间限制,我们的诊断编码都优于松弛规划的现有最先进方法。
英文摘要:
We establish a novel relation between delete-free planning, an important task for the AI Planning community also known as relaxed planning, and logic programming. We show that given a planning problem, all subsets of actions that could be ordered to produce relaxed plans for the problem can be bijectively captured with stable models of a logic program describing the corresponding relaxed planning problem. We also consider the supported model semantics of logic programs, and introduce one causal and one diagnostic encoding of the relaxed planning problem as logic programs, both capturing relaxed plans with their supported models. Our experimental results show that these new encodings can provide major performance gain when computing optimal relaxed plans, with our diagnostic encoding outperforming state-of-the-art approaches to relaxed planning regardless of the given time limit when measured on a wide collection of STRIPS planning benchmarks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。