| Change the World-How Hard Can that Be? On the Computational Complexity of Fixing Planning Models. S Lin, P Bercher IJCAI, 4152-4159, 2021 | 20 | 2021 |
| Towards automated modeling assistance: An efficient approach for repairing flawed planning domains S Lin, A Grastien, P Bercher Proceedings of the AAAI Conference on Artificial Intelligence 37 (10), 12022 …, 2023 | 14 | 2023 |
| Was fixing this Really that hard? On the complexity of correcting HTN domains S Lin, P Bercher Proceedings of the AAAI Conference on Artificial Intelligence 37 (10), 12032 …, 2023 | 5 | 2023 |
| On the expressive power of planning formalisms in conjunction with LTL S Lin, P Bercher Proceedings of the International Conference on Automated Planning and …, 2022 | 5 | 2022 |
| Tight Bounds for Hybrid Planning. P Bercher, S Lin, R Alford IJCAI, 4597-4605, 2022 | 5 | 2022 |
| On total-order HTN plan verification with method preconditions–an extension of the CYK parsing algorithm S Lin, G Behnke, S Ondrčková, R Barták, P Bercher Proceedings of the AAAI Conference on Artificial Intelligence 37 (10), 12041 …, 2023 | 4 | 2023 |
| Planning Domain Repair as a Diagnosis Problem S Lin, A Grastien, P Bercher 33rd International Workshop on Principle of Diagnosis–DX 2022, 2022 | 2 | 2022 |
| On the Computational Complexity of Plan Verification,(Bounded) Plan-Optimality Verification, and Bounded Plan Existence S Lin, C Olz, M Helmert, P Bercher Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI 2024), 2024 | 1 | 2024 |
| Automated Action Model Acquisition from Narrative Texts R Li, L Cui, S Lin, P Haslum arXiv preprint arXiv:2307.10247, 2023 | 1 | 2023 |
| Finding Solution Preserving Linearizations For Partially Ordered Hierarchical Planning Problems YX Wu, S Lin, G Behnke, P Bercher 33rd PuK Workshop “Planen, Scheduling und Konfigurieren, Entwerfen”, PuK, 2022 | 1 | 2022 |
| On the computational complexity of correcting HTN domain models S Lin, P Bercher Proceedings of the 4th ICAPS Workshop on Hierarchical Planning (HPlan 2021), 2021 | 1 | 2021 |
| From PCP to HTN Planning Through CFGs D Höller, S Lin, K Erol, P Bercher IPC 2020, 24, 2020 | 1 | 2020 |
| NaRuto: Automatically Acquiring Planning Models from Narrative Texts R Li, L Cui, S Lin, P Haslum Proceedings of the AAAI Conference on Artificial Intelligence 38 (18), 20194 …, 2024 | | 2024 |
| Accelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning S Lin, G Behnke, P Bercher | | 2023 |
| Exploiting Solution Order Graphs and Path Decomposition Trees for More Efficient HTN Plan Verification via SAT Solving S Lin, G Behnke, P Bercher HPlan 2022, 24, 2022 | | 2022 |
| Fourth ICAPS Workshop on Hierarchical Planning (HPlan) D Höller, J Wichlacz, P Bercher, G Behnke, S Lin, D Chen, H Zhang, ... Workshop: Friday, 2021 | | 2021 |
| Grounded (Lifted) Linearizer at the IPC 2023: Solving Partial Order HTN Problems by Linearizing Them YX Wu, C Olz, S Lin, P Bercher | | |
| Comparing the Expressivity of STRIPS Planning with Finite-LTL vs. LTL S Lin | | |
