Songtuan Lin

According to our database, Songtuan Lin authored at least 10 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence.

Songtuan Lin, Conny Olz, Malte Helmert, Pascal Bercher

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

NaRuto: Automatically Acquiring Planning Models from Narrative Texts.

Ruiqi Li, Leyang Cui, Songtuan Lin, Patrik Haslum

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Automated Action Model Acquisition from Narrative Texts.

Ruiqi Li, Leyang Cui, Songtuan Lin, Patrik Haslum

CoRR, 2023

Accelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning.

Songtuan Lin, Gregor Behnke, Pascal Bercher

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains.

Songtuan Lin, Alban Grastien, Pascal Bercher

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 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

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Was Fixing This Really That Hard? On the Complexity of Correcting HTN Domains.

Songtuan Lin, Pascal Bercher

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Tight Bounds for Hybrid Planning.

Pascal Bercher, Songtuan Lin, Ron Alford

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

On the Expressive Power of Planning Formalisms in Conjunction with LTL.

Songtuan Lin, Pascal Bercher

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021

Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models.

Songtuan Lin, Pascal Bercher

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021