Skip to content

Songtuan Lin

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

13

Venues

5

Active years

2021–2025

Best venue rank

A*

Where they publish

Papers

13 indexed papers, newest first.

YearVenueTitleAuthors
2025AAAITold You That Will Not Work: Optimal Corrections to Planning Domains Using Counter-Example Plans.Songtuan Lin, Alban Grastien, Rahul Shome, Pascal Bercher
2025ECAIRepairing Planning Domains Based on Lifted Test Plans.Nader Karimi Bavandpour, Pascal Lauer, Songtuan Lin, Pascal Bercher
2025ICAPSTight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence.Pascal Lauer, Songtuan Lin, Pascal Bercher
2025SoCSUsing Action-Policy Testing in RL to Reduce the Number of Bugs.Hasan Ferit Eniser, Songtuan Lin, Nicola J. Mller, Anastasia Isychev, Valentin Wstholz, Isabel Valera, Jrg Hoffmann, Maria Christakis
2024AAAINaRuto: Automatically Acquiring Planning Models from Narrative Texts.Ruiqi Li, Leyang Cui, Songtuan Lin, Patrik Haslum
2024AAAIOn the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence.Songtuan Lin, Conny Olz, Malte Helmert, Pascal Bercher
2024SoCSModeling Assistance for Hierarchical Planning: An Approach for Correcting Hierarchical Domains with Missing Actions.Songtuan Lin, Daniel Hller, Pascal Bercher
2023AAAIWas Fixing This Really That Hard? On the Complexity of Correcting HTN Domains.Songtuan Lin, Pascal Bercher
2023AAAIOn Total-Order HTN Plan Verification with Method Preconditions - An Extension of the CYK Parsing Algorithm.Songtuan Lin, Gregor Behnke, Simona Ondrckov, Roman Bartk, Pascal Bercher
2023AAAITowards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains.Songtuan Lin, Alban Grastien, Pascal Bercher
2023ECAIAccelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning.Songtuan Lin, Gregor Behnke, Pascal Bercher
2022IJCAITight Bounds for Hybrid Planning.Pascal Bercher, Songtuan Lin, Ron Alford
2021IJCAIChange the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models.Songtuan Lin, Pascal Bercher