On the Verification of Totally-Ordered HTN Plans

Verifying HTN plans is an intractable problem with two existing 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 and the only technique supporting state constraints. In th...

Full description

Saved in:
Bibliographic Details
Main Authors: Bartak, Roman, Ondrckova, Simona, Behnke, Gregor, Bercher, Pascal
Format: Conference Proceeding
Language:English
Subjects:
Artificial intelligence
Conferences
hierarchical planning
HTN
parsing
Runtime
total-order
verification
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 267
container_issue
container_start_page 263
container_title
container_volume
creator Bartak, Roman
Ondrckova, Simona
Behnke, Gregor
Bercher, Pascal
description Verifying HTN plans is an intractable problem with two existing 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 and the only technique supporting state constraints. In this paper, we propose an extension of the parsing-based approach to verify totally-ordered HTN plans more efficiently. This problem is known to be tractable if no state constraints are included, and we show theoretically and empirically that the modified parsing approach achieves better performance than the currently fastest HTN plan verifier when applied to totally-ordered HTN plans.
doi_str_mv 10.1109/ICTAI52525.2021.00043
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_9643240</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9643240</ieee_id><sourcerecordid>9643240</sourcerecordid><originalsourceid>FETCH-LOGICAL-i203t-d09731ddc83fbe344772d454546a63323274802482a2f740b43c5817a45369603</originalsourceid><addsrcrecordid>eNotzM1Kw0AUQOFREKy1TyDCvEDSO_fe-VuWoDZQjIvotkyTCY7ERJJs-vYWlG9xdkeIRwW5UuC3ZVHvSo0XOQKqHACYrsTGW6eM0QzOO3UtVkhWZ6C8vRV38_wFgKCRVgKqQS6fUX7EKXWpCUsaBzl2sh6X0PfnrJraOMVW7utX-daHYb4XN13o57j571q8Pz_VxT47VC9lsTtkCYGWrAVvSbVt46g7RWK2FlvWFyYYIiS07ADZYcDOMpyYGu2UDazJeAO0Fg9_3xRjPP5M6TtM56M3TMhAv3ifQYA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>On the Verification of Totally-Ordered HTN Plans</title><source>IEEE Xplore All Conference Series</source><creator>Bartak, Roman ; Ondrckova, Simona ; Behnke, Gregor ; Bercher, Pascal</creator><creatorcontrib>Bartak, Roman ; Ondrckova, Simona ; Behnke, Gregor ; Bercher, Pascal</creatorcontrib><description>Verifying HTN plans is an intractable problem with two existing 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 and the only technique supporting state constraints. In this paper, we propose an extension of the parsing-based approach to verify totally-ordered HTN plans more efficiently. This problem is known to be tractable if no state constraints are included, and we show theoretically and empirically that the modified parsing approach achieves better performance than the currently fastest HTN plan verifier when applied to totally-ordered HTN plans.</description><identifier>EISSN: 2375-0197</identifier><identifier>EISBN: 9781665408981</identifier><identifier>EISBN: 1665408987</identifier><identifier>DOI: 10.1109/ICTAI52525.2021.00043</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Artificial intelligence ; Conferences ; hierarchical planning ; HTN ; parsing ; Runtime ; total-order ; verification</subject><ispartof>2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI), 2021, p.263-267</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9643240$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,27916,54546,54923</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9643240$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bartak, Roman</creatorcontrib><creatorcontrib>Ondrckova, Simona</creatorcontrib><creatorcontrib>Behnke, Gregor</creatorcontrib><creatorcontrib>Bercher, Pascal</creatorcontrib><title>On the Verification of Totally-Ordered HTN Plans</title><title>2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI)</title><addtitle>ICTAI</addtitle><description>Verifying HTN plans is an intractable problem with two existing 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 and the only technique supporting state constraints. In this paper, we propose an extension of the parsing-based approach to verify totally-ordered HTN plans more efficiently. This problem is known to be tractable if no state constraints are included, and we show theoretically and empirically that the modified parsing approach achieves better performance than the currently fastest HTN plan verifier when applied to totally-ordered HTN plans.</description><subject>Artificial intelligence</subject><subject>Conferences</subject><subject>hierarchical planning</subject><subject>HTN</subject><subject>parsing</subject><subject>Runtime</subject><subject>total-order</subject><subject>verification</subject><issn>2375-0197</issn><isbn>9781665408981</isbn><isbn>1665408987</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2021</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotzM1Kw0AUQOFREKy1TyDCvEDSO_fe-VuWoDZQjIvotkyTCY7ERJJs-vYWlG9xdkeIRwW5UuC3ZVHvSo0XOQKqHACYrsTGW6eM0QzOO3UtVkhWZ6C8vRV38_wFgKCRVgKqQS6fUX7EKXWpCUsaBzl2sh6X0PfnrJraOMVW7utX-daHYb4XN13o57j571q8Pz_VxT47VC9lsTtkCYGWrAVvSbVt46g7RWK2FlvWFyYYIiS07ADZYcDOMpyYGu2UDazJeAO0Fg9_3xRjPP5M6TtM56M3TMhAv3ifQYA</recordid><startdate>202111</startdate><enddate>202111</enddate><creator>Bartak, Roman</creator><creator>Ondrckova, Simona</creator><creator>Behnke, Gregor</creator><creator>Bercher, Pascal</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>202111</creationdate><title>On the Verification of Totally-Ordered HTN Plans</title><author>Bartak, Roman ; Ondrckova, Simona ; Behnke, Gregor ; Bercher, Pascal</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i203t-d09731ddc83fbe344772d454546a63323274802482a2f740b43c5817a45369603</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Artificial intelligence</topic><topic>Conferences</topic><topic>hierarchical planning</topic><topic>HTN</topic><topic>parsing</topic><topic>Runtime</topic><topic>total-order</topic><topic>verification</topic><toplevel>online_resources</toplevel><creatorcontrib>Bartak, Roman</creatorcontrib><creatorcontrib>Ondrckova, Simona</creatorcontrib><creatorcontrib>Behnke, Gregor</creatorcontrib><creatorcontrib>Bercher, Pascal</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bartak, Roman</au><au>Ondrckova, Simona</au><au>Behnke, Gregor</au><au>Bercher, Pascal</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On the Verification of Totally-Ordered HTN Plans</atitle><btitle>2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI)</btitle><stitle>ICTAI</stitle><date>2021-11</date><risdate>2021</risdate><spage>263</spage><epage>267</epage><pages>263-267</pages><eissn>2375-0197</eissn><eisbn>9781665408981</eisbn><eisbn>1665408987</eisbn><coden>IEEPAD</coden><abstract>Verifying HTN plans is an intractable problem with two existing 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 and the only technique supporting state constraints. In this paper, we propose an extension of the parsing-based approach to verify totally-ordered HTN plans more efficiently. This problem is known to be tractable if no state constraints are included, and we show theoretically and empirically that the modified parsing approach achieves better performance than the currently fastest HTN plan verifier when applied to totally-ordered HTN plans.</abstract><pub>IEEE</pub><doi>10.1109/ICTAI52525.2021.00043</doi><tpages>5</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier EISSN: 2375-0197
ispartof 2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI), 2021, p.263-267
issn 2375-0197
language eng
recordid cdi_ieee_primary_9643240
source IEEE Xplore All Conference Series
subjects Artificial intelligence
Conferences
hierarchical planning
HTN
parsing
Runtime
total-order
verification
title On the Verification of Totally-Ordered HTN Plans
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T22%3A30%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=On%20the%20Verification%20of%20Totally-Ordered%20HTN%20Plans&rft.btitle=2021%20IEEE%2033rd%20International%20Conference%20on%20Tools%20with%20Artificial%20Intelligence%20(ICTAI)&rft.au=Bartak,%20Roman&rft.date=2021-11&rft.spage=263&rft.epage=267&rft.pages=263-267&rft.eissn=2375-0197&rft.coden=IEEPAD&rft_id=info:doi/10.1109/ICTAI52525.2021.00043&rft.eisbn=9781665408981&rft.eisbn_list=1665408987&rft_dat=%3Cieee_CHZPO%3E9643240%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i203t-d09731ddc83fbe344772d454546a63323274802482a2f740b43c5817a45369603%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=9643240&rfr_iscdi=true