[Zurück]

C. Bäckström, P. Jonsson, S. Ordyniak, St. Szeider:
"Parameterized Complexity and Kernel Bounds for Hard Planning Problems";
Vortrag: Conference on Algorithms and Complexity, Barcelona, Spain; 22.05.2013 - 24.05.2013; in: "Algorithms and Complexity, 8th International Conference, CIAC 2013, Proceedings.", P. Spirakis, M. Serna (Hrg.); Springer / LNCS, 7878 (2013), ISBN: 978-3-642-38232-1; S. 13 - 24.

The propositional planning problem is a notoriously difficult computational problem. Downey, Fellows and Stege initiated the parameterized analysis of planning (with plan length as the parameter) and Bäckström et al. picked up this line of research and provided an extensive parameterized analysis under various restrictions, leaving open only one stubborn case. We continue this work and provide a full classification. In particular, we show that the case when actions have no preconditions and at most e postconditions is fixed-parameter tractable if e< 3 and W[1]-complete otherwise. We show fixed-parameter tractability by a reduction to a variant of the Steiner Tree problem; this problem has recently been shown fixed-parameter tractable by Guo, Niedermeier and Suchy. If a problem is fixed-parameter tractable, then it admits a polynomial-time self-reduction to instances whose input size is bounded by a function of the parameter, called the kernel. For some problems, this function is even polynomial which has desirable computational implications. Recent research in parameterized complexity has focused on classifying fixed-parameter tractable problems on whether they admit polynomial kernels or not. We revisit all the previously obtained restrictions of planning that are fixed-parameter tractable and show that none of them admits a polynomial kernel unless the polynomial hierarchy collapses to its third level.

http://dx.doi.org/10.1007/978-3-642-38233-8

Projektleitung Stefan Szeider:
The Parameterized Complexity of Reasoning Problems