{"type":"ScholarlyArticle","title":"Best-Effort Synthesis: Doing Your Best Is Not Harder Than Giving Up","authors":[{"name":"Benjamin Aminof","slug":"benjamin-aminof","given":"Benjamin","family":"Aminof","affiliation":""},{"name":"Giuseppe De Giacomo","slug":"giuseppe-de-giacomo","given":"Giuseppe","family":"De Giacomo","affiliation":""},{"name":"Sasha Rubin","slug":"sasha-rubin","given":"Sasha","family":"Rubin","affiliation":""}],"abstract":"We study best-effort synthesis under environment assumptions specified in LTL, and show that this problem has exactly the same computational complexity of standard LTL synthesis: 2EXPTIME-complete. We provide optimal algorithms for computing best-effort strategies, both in the case of LTL over infinite traces and LTL over finite traces (i.e., LTLf). The latter are particularly well suited for implementation.","doi":"10.24963/ijcai.2021/243","url":"https://ijcai.org/proceedings/2021/243","pdf":"https://ijcai.org/proceedings/2021/0243.pdf","markdown":"https://ijcai.org/proceedings/2021/243.md","bibtex":"https://ijcai.org/proceedings/2021/bibtex/243","volume":{"slug":"2021","title":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2021","url":"https://ijcai.org/proceedings/2021/","year":2021,"location":"Montreal","dates":"19-27 August 2021","editors":"Prof. Zhi-Hua Zhou","isbn":"978-0-9992411-9-6","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2021"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":243,"pages":{"first":1766,"last":1772},"keywords":["Planning and Scheduling: Theoretical Foundations of Planning","Knowledge Representation and Reasoning: Action, Change and Causality","Agent-based and Multi-agent Systems: Formal Verification, Validation and Synthesis"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}