{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T17:44:05Z","timestamp":1696095845633},"reference-count":0,"publisher":"IOS Press","isbn-type":[{"value":"9781643684369","type":"print"},{"value":"9781643684376","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T00:00:00Z","timestamp":1695859200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,9,28]]},"abstract":"<jats:p>Plan verification is the task of deciding whether a given plan is a solution to a planning problem. In this paper, we study the plan verification problem in the context of Hierarchical Task Network (HTN) planning, which has been proved to be NP-complete when partial order (PO) is involved. We will develop a novel SAT-based approach exploiting the data structures solution order graphs and path decomposition trees which encodes an HTN plan verification problem as a SAT one. We show in our experiments that this new approach outperforms the current state-of-the-art (SOTA) planning-based approach for verifying plans for POHTN problems.<\/jats:p>","DOI":"10.3233\/faia230428","type":"book-chapter","created":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T09:13:04Z","timestamp":1695978784000},"source":"Crossref","is-referenced-by-count":0,"title":["Accelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning"],"prefix":"10.3233","author":[{"given":"Songtuan","family":"Lin","sequence":"first","affiliation":[{"name":"School of Computing, The Australian National University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregor","family":"Behnke","sequence":"additional","affiliation":[{"name":"Institute for Logic, Language, and Computation, University of Amsterdam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Bercher","sequence":"additional","affiliation":[{"name":"School of Computing, The Australian National University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","ECAI 2023"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA230428","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T09:13:06Z","timestamp":1695978786000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA230428"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,28]]},"ISBN":["9781643684369","9781643684376"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia230428","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"value":"0922-6389","type":"print"},{"value":"1879-8314","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,28]]}}}