Lessons Learned from the CYK Algorithm for Parsing-based Verification of Hierarchical Plans

Verification of hierarchical plans deals with the problem of whether an action sequence is causally consistent and can be obtained by a decomposition of a goal task. This second sub-problem (finding the decomposition) makes the verification problem NP-hard. The task decomposition structure is very c...

وصف كامل

التفاصيل البيبلوغرافية
الحاوية / القاعدة:Proceedings of the International Florida Artificial Intelligence Research Society Conference
المؤلفون الرئيسيون: Simona Ondrčková, Roman Barták, Pascal Bercher, Gregor Behnke
التنسيق: مقال
اللغة:الإنجليزية
منشور في: LibraryPress@UF 2023-05-01
الموضوعات:
الوصول للمادة أونلاين:https://journals.flvc.org/FLAIRS/article/view/133196

مواد مشابهة