Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1212616, author = {Kronegger, Martin and Ordyniak, Sebastian and Pfandler, Andreas}, address = {Quebec}, booktitle = {AAAI Press}, editor = {Carla E. Brodley and Peter Stone}, keywords = {parameterized complexity; planning; backdoors; causal graph}, howpublished = {tištěná verze "print"}, language = {eng}, location = {Quebec}, isbn = {978-1-57735-679-0}, pages = {2300-2307}, publisher = {AAAI Press}, title = {Backdoors to Planning}, url = {https://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8376}, year = {2014} }
TY - JOUR ID - 1212616 AU - Kronegger, Martin - Ordyniak, Sebastian - Pfandler, Andreas PY - 2014 TI - Backdoors to Planning PB - AAAI Press CY - Quebec SN - 9781577356790 KW - parameterized complexity KW - planning KW - backdoors KW - causal graph UR - https://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8376 N2 - Backdoors measure the distance to tractable fragments and have become an important tool to find fixed-parameter tractable (fpt) algorithms. Despite their success, backdoors have not been used for planning, a central problem in AI that has a high computational complexity. In this work, we introduce two notions of backdoors building upon the causal graph. We analyze the complexity of finding a small backdoor (detection) and using the backdoor to solve the problem (evaluation) in the light of planning with (un)bounded plan length/domain of the variables. For each setting we present either an fpt-result or rule out the existence thereof by showing parameterized intractability. In three cases we achieve the most desirable outcome: detection and evaluation are fpt. ER -
KRONEGGER, Martin, Sebastian ORDYNIAK a Andreas PFANDLER. Backdoors to Planning. In Carla E. Brodley and Peter Stone. \textit{AAAI Press}. Quebec: AAAI Press, 2014, s.~2300-2307. ISBN~978-1-57735-679-0.
|