{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:59:46Z","timestamp":1775818786225,"version":"3.50.1"},"reference-count":0,"publisher":"IOS Press","isbn-type":[{"value":"9781643685489","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T00:00:00Z","timestamp":1729036800000},"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":[[2024,10,16]]},"abstract":"<jats:p>This paper presents SibylSat, a novel SAT-based method designed to efficiently solve totally-ordered HTN problems (TOHTN). In contrast to prevailing SAT-based HTN planners that employ a breadth-first search strategy, SibylSat adopts a greedy search approach, enabling it to identify promising decompositions for expansion. The selection process is facilitated by a heuristic derived from solving a relaxed problem, which is also expressed as a SAT problem. Our experimental evaluations demonstrate that SibylSat outperforms existing SAT-based TOHTN approaches in terms of both runtime and plan quality on most of the IPC benchmarks, while also solving a larger number of problems.<\/jats:p>","DOI":"10.3233\/faia240987","type":"book-chapter","created":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T13:52:17Z","timestamp":1729173137000},"source":"Crossref","is-referenced-by-count":2,"title":["SibylSat: Using SAT as an Oracle to Perform a Greedy Search on TOHTN Planning"],"prefix":"10.3233","author":[{"given":"Gaspard","family":"Quenard","sequence":"first","affiliation":[{"name":"University Grenoble Alpes, LIG, F-38000 Grenoble, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damier","family":"Pellier","sequence":"additional","affiliation":[{"name":"University Grenoble Alpes, LIG, F-38000 Grenoble, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Humbert","family":"Fiorino","sequence":"additional","affiliation":[{"name":"University Grenoble Alpes, LIG, F-38000 Grenoble, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","ECAI 2024"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA240987","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T13:52:17Z","timestamp":1729173137000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA240987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,16]]},"ISBN":["9781643685489"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia240987","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"value":"0922-6389","type":"print"},{"value":"1879-8314","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,16]]}}}