Songtuan Lin

According to our database1, Songtuan Lin authored at least 11 papers between 2021 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Modeling Assistance for Hierarchical Planning: An Approach for Correcting Hierarchical Domains with Missing Actions.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

NaRuto: Automatically Acquiring Planning Models from Narrative Texts.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Automated Action Model Acquisition from Narrative Texts.
CoRR, 2023

Accelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning.
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.
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.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Was Fixing This Really That Hard? On the Complexity of Correcting HTN Domains.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Tight Bounds for Hybrid Planning.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

On the Expressive Power of Planning Formalisms in Conjunction with LTL.
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.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021


  Loading...