Intermediate Results on the Complexity of STRIPS$_{1}^{1}$
Artificial Intelligence
2026-02-10 v1
Abstract
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 is true, calling a SAT solver for small instances, introducing the literal graph, and mapping it to Petri nets.
Keywords
Cite
@article{arxiv.2602.08708,
title = {Intermediate Results on the Complexity of STRIPS$_{1}^{1}$},
author = {Stefan Edelkamp and Jiří Fink and Petr Gregor and Anders Jonsson and Bernhard Nebel},
journal= {arXiv preprint arXiv:2602.08708},
year = {2026}
}