Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models. - Songtuan Lin; Pascal Bercher (IJCAI, 2021)

On the Expressive Power of Planning Formalisms in Conjunction with LTL. - Songtuan Lin; Pascal Bercher (ICAPS, 2022)

Tight Bounds for Hybrid Planning. - Pascal Bercher; Songtuan Lin; Ron Alford (IJCAI, 2022)

Was Fixing This Really That Hard? On the Complexity of Correcting HTN Domains. - Songtuan Lin; Pascal Bercher (AAAI, 2023)

On Total-Order HTN Plan Verification with Method Preconditions - An Extension of the CYK Parsing Algorithm. - Songtuan Lin; Gregor Behnke; Simona Ondrcková; Roman Barták; Pascal Bercher (AAAI, 2023)

Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains. - Songtuan Lin; Alban Grastien; Pascal Bercher (AAAI, 2023)

Accelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning. - Songtuan Lin; Gregor Behnke; Pascal Bercher (ECAI, 2023)

Automated Action Model Acquisition from Narrative Texts. - Ruiqi Li; Leyang Cui; Songtuan Lin; Patrik Haslum (CoRR, 2023)

NaRuto: Automatically Acquiring Planning Models from Narrative Texts. - Ruiqi Li; Leyang Cui; Songtuan Lin; Patrik Haslum (AAAI, 2024)

On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence. - Songtuan Lin; Conny Olz; Malte Helmert; Pascal Bercher (AAAI, 2024)

Modeling Assistance for Hierarchical Planning: An Approach for Correcting Hierarchical Domains with Missing Actions. - Songtuan Lin; Daniel Höller; Pascal Bercher (SOCS, 2024)

Told You That Will Not Work: Optimal Corrections to Planning Domains Using Counter-Example Plans. - Songtuan Lin; Alban Grastien; Rahul Shome; Pascal Bercher (AAAI, 2025)