[Zurück]

N. Creignou, R. Pichler, S. Woltran:
"Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?";
in: "Proceedings of the 23rd International Joint Conference on Artificial Intelligence", F. Rossi (Hrg.); AAAI Press, 2013, ISBN: 978-1-57735-633-2, S. 954 - 961.

The goal of this paper is a systematic parameterized complexity analysis of different variants of propositional STRIPS planning. We identify several natural problem parameters and study all possible combinations of 9 parameters in 6 different settings. These settings arise, for instance, from the distinction if negative effects of actions are allowed or not. We provide a complete picture by establishing for each case either paraNP-hardness (i.e., the parameter combination does not help) or W[t]-completeness with t ∈ {1, 2} (i.e., fixed-parameter intractability), or FPT (i.e., fixed-parameter tractability).

http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6622

Projektleitung Reinhard Pichler:
Effiziente, parametrisierte Algorithmen in Künstlicher Intelligenz und logischem Schließen