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...
Збережено в:
| Автори: | , , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
LibraryPress@UF
2023-05-01
|
| Серія: | Proceedings of the International Florida Artificial Intelligence Research Society Conference |
| Предмети: | |
| Онлайн доступ: | https://journals.flvc.org/FLAIRS/article/view/133196 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|