@inproceedings{bf42eab9c28445239de83e2b6b7ad2bd,
title = "On the complexity of domain-independent planning",
abstract = "In this paper, we examine how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators. We show how the time complexity varies depending on a wide variety of conditions: whether or not delete lists are allowed; whether or not negative preconditions are allowed; whether or not the predicates are restricted to be propositions (i.e., 0-ary); whether the planning operators are given as part of the input to the planning problem, or instead are fixed in advance.",
author = "Kutluhan Erol and Nau, {Dana S.} and Subrahmanian, {V. S.}",
year = "1992",
language = "English (US)",
isbn = "0262510634",
series = "Proceedings Tenth National Conference on Artificial Intelligence",
publisher = "Publ by AAAI",
pages = "381--386",
booktitle = "Proceedings Tenth National Conference on Artificial Intelligence",
note = "Proceedings Tenth National Conference on Artificial Intelligence - AAAI-92 ; Conference date: 12-07-1992 Through 16-07-1992",
}