← Search

Songtuan Lin

8 accepted papers

2025

Told You That Will Not Work: Optimal Corrections to Planning Domains Using Counter-Example Plans

AAAI 2025technical

Hardness of modeling a planning domain is a major obstacle for making automated planning techniques accessible. We developed a tool that helps modelers correct domains based on available information such as the known feasibility or infeasibility of certain plans. Designing model repair strategies th…

2024

NaRuto: Automatically Acquiring Planning Models from Narrative Texts

AAAI 2024technical

Domain model acquisition has been identified as a bottleneck in the application of planning technology, especially within narrative planning. Learning action models from narrative texts in an automated way is essential to overcome this barrier, but challenging because of the inherent complexities of…

Cited by 5SourcePDFScholar
2024

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

AAAI 2024technical

In this paper we study the computational complexity of several reasoning tasks centered around the bounded plan existence problem. We do this for standard classical planning and hierarchical task network (HTN) planning and each for a grounded and a lifted representation. Whereas bounded plan existen…

Cited by 4SourcePDFScholar
2023

On Total-Order HTN Plan Verification with Method Preconditions – An Extension of the CYK Parsing Algorithm

AAAI 2023technical

In this paper, we consider the plan verification problem for totally ordered (TO) HTN planning. The problem is proved to be solvable in polynomial time by recognizing its connection to the membership decision problem for context-free grammars. Currently, most HTN plan verification approaches do not…

Cited by 8SourcePDFScholar
2023

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

AAAI 2023technical

Designing a planning domain is a difficult task in AI planning. Assisting tools are thus required if we want planning to be used more broadly. In this paper, we are interested in automatically correcting a flawed domain. In particular, we are concerned with the scenario where a domain contradicts a…

2021

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

IJCAI 2021poster

Incorporating humans into AI planning is an important feature of flexible planning technology. Such human integration allows to incorporate previously unknown constraints, and is also an integral part of automated modeling assistance. As a foundation for integrating user requests, we study the compu…

Cited by 28SourcePDFScholar