Proceedings

Best-Effort Synthesis: Doing Your Best Is Not Harder Than Giving Up

Download BibTeX Cite

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. Main Track. Pages 1766-1772.

https://doi.org/10.24963/ijcai.2021/243

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.

Benjamin Aminof, Giuseppe De Giacomo, and Sasha Rubin. 2021. Best-Effort Synthesis: Doing Your Best Is Not Harder Than Giving Up. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21. IJCAI, 1766–1772. https://doi.org/10.24963/ijcai.2021/243
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards