All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

On the Verification of Totally-Ordered HTN Plans

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10439481" target="_blank" >RIV/00216208:11320/21:10439481 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/ICTAI52525.2021.00043" target="_blank" >https://doi.org/10.1109/ICTAI52525.2021.00043</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ICTAI52525.2021.00043" target="_blank" >10.1109/ICTAI52525.2021.00043</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On the Verification of Totally-Ordered HTN Plans

  • Original language description

    Verifying HTN plans is an intractable problem with two exist- ing approaches to solve the problem. One technique is based on compilation to SAT. Another method is using parsing, and it is currently the fastest technique for verifying HTN plans. In this paper, we propose an extension of the parsing- based approach to verify totally-ordered HTN plans more ef- ficiently. This problem is known to be tractable if no state constraints are included, and we show theoretically and em- pirically that the modified parsing approach achieves bet- ter performance than the currently fastest HTN plan verifier when applied to totally-ordered HTN plans.

  • 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

    <a href="/en/project/GC21-13882J" target="_blank" >GC21-13882J: Hierarchical Planning: From Plan Verification to Plan Recognition</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2021

  • 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

    2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI)

  • ISBN

  • ISSN

    1082-3409

  • e-ISSN

  • Number of pages

    5

  • Pages from-to

    263-267

  • Publisher name

    IEEE

  • Place of publication

    Neuveden.

  • Event location

    online

  • Event date

    Nov 1, 2021

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article