{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T11:34:59Z","timestamp":1791459299932,"version":"4.3.4"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,8]]},"abstract":"<jats:p>We consider the problem of synthesizing good-enough (GE)-strategies for linear temporal logic (LTL) over finite traces or LTLf for short.\n\nThe problem of synthesizing GE-strategies for an LTL formula \u03c6 over infinite traces reduces to the problem of synthesizing winning strategies for the formula (\u2203O\u03c6)\u21d2\u03c6 where O is the set of propositions controlled by the system.\n\nWe first prove that this reduction does not work for LTLf formulas.\n\nThen we show how to synthesize GE-strategies for LTLf formulas via the Good-Enough (GE)-synthesis of LTL formulas.\n\nUnfortunately, this requires to construct deterministic parity automata on infinite words, which is computationally expensive.\n\nWe then show how to synthesize GE-strategies for LTLf formulas by a reduction to solving games played on deterministic B\u00fcchi automata, based on an easier construction of deterministic automata on finite words.\n\nWe show empirically that our specialized synthesis algorithm for GE-strategies outperforms the algorithms going through GE-synthesis of LTL formulas by orders of magnitude.<\/jats:p>","DOI":"10.24963\/ijcai.2021\/570","type":"proceedings-article","created":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T11:00:49Z","timestamp":1628679649000},"page":"4144-4151","source":"Crossref","is-referenced-by-count":2,"title":["Synthesizing Good-Enough Strategies for LTLf Specifications"],"prefix":"10.24963","author":[{"given":"Yong","family":"Li","sequence":"first","affiliation":[{"name":"State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Turrini","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences"},{"name":"Institute of Intelligent Software, Guangzhou"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rice University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences"},{"name":"Institute of Intelligent Software, Guangzhou"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"10584","event":{"name":"Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}","theme":"Artificial Intelligence","location":"Montreal, Canada","acronym":"IJCAI-2021","number":"30","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"start":{"date-parts":[[2021,8,19]]},"end":{"date-parts":[[2021,8,27]]}},"container-title":["Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T11:04:06Z","timestamp":1628679846000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2021\/570"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2021\/570","relation":{},"subject":[],"published":{"date-parts":[[2021,8]]}}}