STRIPS$_{1}^{1}$复杂性的中间结果
Intermediate Results on the Complexity of STRIPS$_{1}^{1}$
AI总结:
本文研究STRIPS$_{1}^{1}$复杂性,通过SAT求解器和Petri网分析探讨其NP完全性假设。
摘要:
本文基于Bylander关于命题STRIPS规划计算复杂性结果的研究。他证明了当仅允许地面文字时,确定计划存在性是PSPACE完全的,即使操作符限制为两个前提和两个后件。虽然NP难性已得到解决,但命题STRIPS中仅有一个前提和一个效果的操作符是否NP完全仍不清楚。本文探讨了STRIPS$^1_1$小解假设是否成立,调用小型实例的SAT求解器,引入字文图,并将其映射到Petri网。
英文摘要:
This paper is based on Bylander's results on the computational complexity of propositional STRIPS planning. He showed that when only ground literals are permitted, determining plan existence is PSPACE-complete even if operators are limited to two preconditions and two postconditions. While NP-hardness is settled, it is unknown whether propositional STRIPS with operators that only have one precondition and one effect is NP-complete. We shed light on the question whether this small solution hypothesis for STRIPS$^1_1$ is true, calling a SAT solver for small instances, introducing the literal graph, and mapping it to Petri nets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。