{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,2]],"date-time":"2024-06-02T00:14:40Z","timestamp":1717287280269},"reference-count":0,"publisher":"Association for the Advancement of Artificial Intelligence (AAAI)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SOCS"],"abstract":"<jats:p>The complexity of modeling planning domains is a major obstacle for making automated planning techniques more accessible, raising the demand of tools for providing modeling assistance. In particular, tools that can automatically correct errors in a planning domain are of great importance. Previous works have devoted efforts to developing such approaches for correcting classical  (non-hierarchical) domains. However, no approaches exist for hierarchical planning, which is what we offer here. More specifically, our approach takes as input a flawed hierarchical domain together with a plan known to be a solution but actually contradicting the domain (due to errors in the domain) and outputs corrections to the domain that add missing actions to the domain which turn the plan into a solution. The approach achieves this by compiling the problem of finding corrections to another hierarchical planning problem.<\/jats:p>","DOI":"10.1609\/socs.v17i1.31542","type":"journal-article","created":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T10:14:16Z","timestamp":1717236856000},"page":"55-63","source":"Crossref","is-referenced-by-count":0,"title":["Modeling Assistance for Hierarchical Planning: An Approach for Correcting Hierarchical Domains with Missing Actions"],"prefix":"10.1609","volume":"17","author":[{"given":"Songtuan","family":"Lin","sequence":"first","affiliation":[]},{"given":"Daniel","family":"H\u00f6ller","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Bercher","sequence":"additional","affiliation":[]}],"member":"9382","published-online":{"date-parts":[[2024,6,1]]},"container-title":["Proceedings of the International Symposium on Combinatorial Search"],"original-title":[],"link":[{"URL":"https:\/\/ojs.aaai.org\/index.php\/SOCS\/article\/download\/31542\/33702","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ojs.aaai.org\/index.php\/SOCS\/article\/download\/31542\/33702","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T10:14:16Z","timestamp":1717236856000},"score":1,"resource":{"primary":{"URL":"https:\/\/ojs.aaai.org\/index.php\/SOCS\/article\/view\/31542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,1]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1609\/socs.v17i1.31542","relation":{},"ISSN":["2832-9163","2832-9171"],"issn-type":[{"value":"2832-9163","type":"electronic"},{"value":"2832-9171","type":"print"}],"subject":[],"published":{"date-parts":[[2024,6,1]]}}}