%
% This file was created by the TYPO3 extension
% publications
% --- Timezone: CEST
% Creation date: 2025-05-03
% Creation time: 12:07:51
% --- Number of references
% 16
%


@Article { 284141513990_2025,
    author = {Olz, Conny and Lodemann, Alexander and Jutz, Benedikt and Schmautz, Mario and Borowiec, Maximilian and Biundo, Susanne and Bercher, Pascal},
    title = {An Extensive Empirical Evaluation of Inferring Preconditions and Effects of Compound Tasks in Ground HTN Planning Problems},
    year = {2025},
    month = {3},
    reviewed = {1},
    DOI = {10.1613/jair.1.17279},
    journal = {Journal of Artificial Intelligence Research},
    volume = {82},
    pages = {1407-1444},
    web_url = {https://jair.org/index.php/jair/article/view/17279},
    file_url = {https://jair.org/index.php/jair/article/view/17279/27150}
}

@Inproceedings { 217392021556_2024,
    author = {Olz, Conny and Lodemann, Alexander and Bercher, Pascal},
    title = {A Heuristic for Optimal Total-Order HTN Planning Based on Integer Linear Programming},
    year = {2024},
    DOI = {10.3233/FAIA241005},
    booktitle = {Proceedings of the 27th European Conference on Artificial Intelligence (ECAI 2024)},
    publisher = {IOS Press},
    pages = {4303--4310},
    file_url = {t3://file?uid=523057}
}

@Inproceedings { Olz2024TOILPHeuristic,
    author = {Olz, Conny and Lodemann, Alexander and Bercher, Pascal},
    title = {An ILP Heuristic for Total-Order HTN Planning},
    year = {2024},
    booktitle = {Proceedings of the 7th ICAPS Workshop on Hierarchical Planning (HPlan 2024)}
}

@Phdthesis { 560428213661_2024,
    author = {Olz, Conny},
    title = {Exploring the hierarchy: extracting and exploiting state information of compound tasks in HTN planning},
    year = {2024},
    DOI = {10.18725/OPARU-53481},
    file_url = {https://oparu.uni-ulm.de/items/e6887ad7-6494-4deb-96c4-81edf63cffac}
}

@Conference { Lin2024PlanVerificationComplexity,
    author = {Lin, Songtuan and Olz, Conny and Helmert, Malte and Bercher, Pascal},
    title = {On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence},
    year = {2024},
    DOI = {https://doi.org/10.1609/aaai.v38i18.30000},
    booktitle = {Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI 2024)},
    publisher = {AAAI Press},
    pages = {20203--20211},
    file_url = {t3://file?uid=489952}
}

@Inproceedings { Olz2023Lookahead,
    author = {Olz, Conny and Bercher, Pascal},
    title = {A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements},
    year = {2023},
    DOI = {https://doi.org/10.1609/socs.v16i1.27284},
    booktitle = {Proceedings of the 16th International Symposium on Combinatorial Search (SoCS 2023)},
    publisher = {AAAI Press},
    pages = {65--73},
    file_url = {t3://file?uid=479856}
}

@Inproceedings { Olz2023ConjunctiveHTNEffects,
    author = {Olz, Conny and Bercher, Pascal},
    title = {Can They Come Together? A Computational Complexity Analysis of Conjunctive Possible Effects of Compound HTN Planning Tasks},
    year = {2023},
    DOI = {https://doi.org/10.1609/icaps.v33i1.27209},
    booktitle = {Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023)},
    publisher = {AAAI Press},
    pages = {314--323},
    file_url = {t3://file?uid=479855}
}

@Conference { 958237223464_2023,
    author = {Wu, Ying Xian and Olz, Conny and Lin, Songtuan and Bercher, Pascal},
    title = {Grounded (Lifted) Linearizer at the IPC 2023: Solving Partial Order HTN Problems by Linearizing Them},
    year = {2023},
    booktitle = {Proceedings of the 11th International Planning Competition: Planner Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC)},
    file_url = {t3://file?uid=483769}
}

@Inproceedings { Lin2023VerificationComplexity,
    author = {Lin, Songtuan and Olz, Conny and Helmert, Malte and Bercher, Pascal},
    title = {On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence},
    year = {2023},
    booktitle = {Proceedings of the 6th ICAPS Workshop on Hierarchical Planning (HPlan 2023)}
}

@Conference { Olz23PandaDealer,
    author = {Olz, Conny and H\"{o}ller, Daniel and Bercher, Pascal},
    title = {The PANDADealer System for Totally Ordered HTN Planning in the 2023 IPC},
    year = {2023},
    booktitle = {Proceedings of the 11th International Planning Competition: Planner Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC)},
    file_url = {t3://file?uid=483768}
}

@Conference { Olz2022POPrecsAndEffects,
    author = {Olz, Conny and Bercher, Pascal},
    title = {On the Efficient Inference of Preconditions and Effects of Compound Tasks in Partially Ordered HTN Planning Domains},
    abstract = {Recently, preconditions and effects of compound tasks based on their possible refinements have been introduced together with an efficient inference procedure to compute a subset of them. However, they were restricted to total-order HTN planning domains. In this paper we generalize the definitions and algorithm to the scenario of partially ordered domains.},
    year = {2022},
    booktitle = {Proceedings of the 5th ICAPS Workshop on Hierarchical Planning (HPlan 2022)},
    pages = {47--51},
    web_url = {/fileadmin/website\_uni\_ulm/iui.inst.090/Publikationen/2022/Olz2022POPrecsAndEffects.pdf},
    file_url = {/fileadmin/website\_uni\_ulm/iui.inst.090/Publikationen/2022/Olz2022POPrecsAndEffects.pdf}
}

@Conference { Lindner22BeyondCausalLinks,
    author = {Lindner, Felix and Olz, Conny},
    title = {Step-by-Step Task Plan Explanations Beyond Causal Links},
    year = {2022},
    DOI = {https://doi.org/10.1109/RO-MAN53752.2022.9900590},
    booktitle = {2022 31st IEEE International Conference on Robot \\& Human Interactive Communication (RO-MAN)},
    publisher = {IEEE},
    pages = {45--51},
    file_url = {/fileadmin/website\_uni\_ulm/iui.inst.090/Publikationen/2022/Lindner22PlanExplanationBeyondCL.pdf}
}

@Inproceedings { Olz21RevealingEffects,
    author = {Olz, Conny and Biundo, Susanne and Bercher, Pascal},
    title = {Revealing Hidden Preconditions and Effects of Compound HTN Planning Tasks – A Complexity Analysis},
    year = {2021},
    DOI = {https://doi.org/10.1609/aaai.v35i13.17414},
    booktitle = {Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 2021)},
    publisher = {AAAI Press},
    pages = {11903--11912},
    file_url = {/fileadmin/website\_uni\_ulm/iui.inst.090/Publikationen/2021/Olz21CompoundEffects.pdf}
}

@Inproceedings { Olz2021ComprehendHTNModels,
    author = {Olz, Conny and Wierzba, Eva and Bercher, Pascal and Lindner, Felix},
    title = {Towards Improving the Comprehension of HTN Planning Domains by Means of Preconditions and Effects of Compound Tasks},
    year = {2021},
    booktitle = {Proceedings of the 10th Workshop on Knowledge Engineering for Planning and Scheduling (KEPS 2021)},
    file_url = {/fileadmin/website\_uni\_ulm/iui.inst.090/Publikationen/2021/Olz2021ComprehendHTNModels.pdf}
}

@Inproceedings { 143576271591_2020,
    author = {Bercher, Pascal and Olz, Conny},
    title = {POP ≡ POCL, right? Complexity Results for Partial Order (Causal Link) Makespan Minimization},
    year = {2020},
    DOI = {https://doi.org/10.1609/aaai.v34i06.6530},
    booktitle = {Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020)},
    publisher = {AAAI Press},
    pages = {9785--9793},
    tags = {SFB-T3},
    file_url = {/fileadmin/website\_uni\_ulm/iui.inst.090/Publikationen/2020/Bercher2020POPvsPOCL.pdf}
}

@Inproceedings { Olz2019PostOptimizing,
    author = {Olz, Conny and Bercher, Pascal},
    title = {Eliminating Redundant Actions in Partially Ordered Plans -- A Complexity Analysis},
    abstract = {In this paper we study the computational complexity of post-optimizing partially ordered plans, i.e., we investigate the problem that is concerned with detecting and deleting unnecessary actions. For totally ordered plans it can easily be tested in polynomial time whether a single action can be removed without violating executability. Identifying an executable sub-plan, i.e., asking whether k plan steps can be removed, is known to be NP-hard. We investigate the same questions for partially ordered input plans, as they are created by many search algorithms or used by real-world applications -- in particular time-critical ones that exploit parallelism of non-conflicting actions. More formally, we investigate the computational complexity of removing an action from a partially ordered solution plan in which every linearization is a solution in the classical sense while allowing ordering insertions afterwards to repair arising executability issues. It turns out that this problem is NP-complete -- even if just a single action is removed -- and thereby show that this reasoning task is harder than for totally ordered plans. Moreover, we identify the structural properties responsible for this hardness by providing a fixed-parameter tractability (FPT) result.},
    year = {2019},
    DOI = {10.1609/icaps.v29i1.3493},
    booktitle = {Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019)},
    publisher = {AAAI Press},
    pages = {310--319},
    tags = {SFB-T3},
    file_url = {/fileadmin/website\_uni\_ulm/iui.inst.090/Publikationen/2019/Olz2019StepElimination.pdf}
}