{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T14:20:16Z","timestamp":1762957216775},"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>Recently, Pure-Past Temporal Logic (PPLTL) has proven highly effective in specifying temporally extended goals in deterministic planning domains. In this paper, we show its effectiveness also for fully observable nondeterministic (FOND) planning, both for strong and strong-cyclic plans. We present a notably simple encoding of FOND planning for PPLTL goals into standard FOND planning for final-state goals. The encoding only introduces few fluents (at most linear in the PPLTL goal) without adding any spurious action and allows planners to lazily build the relevant part of the deterministic automaton for the goal formula on-the-fly during the search. We formally prove its correctness, implement it in a tool called Plan4Past, and experimentally show its practical effectiveness.<\/jats:p>","DOI":"10.3233\/faia230281","type":"book-chapter","created":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T09:01:05Z","timestamp":1695978065000},"source":"Crossref","is-referenced-by-count":4,"title":["FOND Planning for Pure-Past Linear Temporal Logic Goals"],"prefix":"10.3233","author":[{"given":"Luigi","family":"Bonassi","sequence":"first","affiliation":[{"name":"University of Brescia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"De Giacomo","sequence":"additional","affiliation":[{"name":"University of Oxford, UK"},{"name":"Sapienza University, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Favorito","sequence":"additional","affiliation":[{"name":"Bank of Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Fuggitti","sequence":"additional","affiliation":[{"name":"Sapienza University, Italy"},{"name":"York University, Canada"},{"name":"IBM Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfonso Emilio","family":"Gerevini","sequence":"additional","affiliation":[{"name":"University of Brescia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Scala","sequence":"additional","affiliation":[{"name":"University of Brescia, Italy"}],"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\/FAIA230281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T09:01:07Z","timestamp":1695978067000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA230281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,28]]},"ISBN":["9781643684369","9781643684376"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia230281","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]]}}}