On Removing Left Recursion from Totally-ordered HTN Domain Models
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10508836" target="_blank" >RIV/00216208:11320/25:10508836 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.32473/flairs.38.1.138853" target="_blank" >https://doi.org/10.32473/flairs.38.1.138853</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.32473/flairs.38.1.138853" target="_blank" >10.32473/flairs.38.1.138853</a>
Alternative languages
Result language
angličtina
Original language name
On Removing Left Recursion from Totally-ordered HTN Domain Models
Original language description
Hierarchical planning is a knowledge-based approach to automated planning, where high-level (compound) tasks are decomposed into simpler tasks until primitive tasks - actions - forming the plan are obtained. Hierarchical Task Networks (HTN) is a modeling formalism for hierarchical planning, where task decompositions are described using decomposition methods with specific constraints. These decomposition methods are very close to rewriting (production) rules of context-free grammars, specifically when the domain is totally ordered. Recursive rules, when a task decomposes to itself, are generally allowed. Generating plans from left to right brings advantage of the first actions in the plan to be ready for execution even if the plan is not yet fully generated. However, left recursion goes against this idea as it tends to generate the plan from right (end) till left (beginning). The paper shows how to remove left recursion from HTN decomposition methods using the ideas from the Greibach Normal Form.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the International Florida Artificial Intelligence Research Society Conference Flairs
ISBN
—
ISSN
2334-0762
e-ISSN
2334-0762
Number of pages
7
Pages from-to
—
Publisher name
FLAIRS
Place of publication
USA
Event location
Florida
Event date
May 20, 2025
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—