TY - GEN
T1 - Polynomial-length planning spans the polynomial hierarchy
AU - Turner, Hudson
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.
Copyright:
Copyright 2016 Elsevier B.V., All rights reserved.
PY - 2002
Y1 - 2002
N2 - This paper presents a family of results on the computational complexity of planning: classical, conformant, and conditional with full or partial observability. Attention is restricted to plans of polynomially-bounded length. For conditional planning, restriction to plans of polynomial size is also considered. For this analysis, a planning domain is described by a transition relation encoded in classical propositional logic. Given the widespread use of satisfiability-based planning methods, this is a rather natural choice. Moreover, this allows us to develop a unified representation—in second-order propositional logic—of the range of planning problems considered. By describing a wide range of results within a single framework, the paper sheds new light on how planning complexity is affected by common assumptions such as nonconcurrency, determinism and polynomial-time decidability of executability of actions.
AB - This paper presents a family of results on the computational complexity of planning: classical, conformant, and conditional with full or partial observability. Attention is restricted to plans of polynomially-bounded length. For conditional planning, restriction to plans of polynomial size is also considered. For this analysis, a planning domain is described by a transition relation encoded in classical propositional logic. Given the widespread use of satisfiability-based planning methods, this is a rather natural choice. Moreover, this allows us to develop a unified representation—in second-order propositional logic—of the range of planning problems considered. By describing a wide range of results within a single framework, the paper sheds new light on how planning complexity is affected by common assumptions such as nonconcurrency, determinism and polynomial-time decidability of executability of actions.
UR - http://www.scopus.com/inward/record.url?scp=77952044626&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77952044626&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:77952044626
SN - 3540441905
SN - 9783540441908
SN - 9783540457572
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 111
EP - 124
BT - Logics in Artificial Intelligence - 8th European Conference, JELIA 2002, Proceedings
A2 - Flesca, Sergio
A2 - Greco, Sergio
A2 - Ianni, Giovambattista
A2 - Leone, Nicola
PB - Springer Verlag
T2 - 8th European Conference on Logics in Artificial Intelligence, JELIA 2002
Y2 - 23 September 2002 through 26 September 2002
ER -