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.

翻译：本文基于Bylander关于命题STRIPS规划计算复杂性的结果。他证明，当仅允许基文字时，即使将操作符限制为两个前提条件和两个后效条件，判定规划存在性仍是PSPACE完全的。虽然NP困难性已得到解决，但对于操作符仅有一个前提条件和一个效果的命题STRIPS是否具有NP完全性仍属未知。我们通过调用SAT求解器处理小型实例、引入文字图并将其映射到Petri网，对STRIPS$^1_1$的"小解假设"是否成立这一问题进行了探讨。