Simona Ondrčková

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

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…