Intermediate Results on the Complexity of STRIPS${}_1^1$

Stefan Edelkamp, Jiří Fink, Petr Gregor +2

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…