{"type":"ScholarlyArticle","title":"LTLf and LDLf Synthesis under Partial Observability","authors":[{"name":"Giuseppe De Giacomo","slug":"giuseppe-de-giacomo","given":"Giuseppe","family":"De Giacomo","affiliation":""},{"name":"Moshe Y. Vardi","slug":"moshe-y-vardi","given":"Moshe Y.","family":"Vardi","affiliation":""}],"abstract":"In this paper, we study synthesis under partial observability for logical specifications over finite traces expressed in LTLf/LDLf. This form of synthesis can be seen as a generalization of planning under partial observability in nondeterministic domains, which is known to be 2EXPTIME-complete. We start by showing that the usual belief-state construction used in planning under partial observability works also for general LTLf/LDLf synthesis, though with a jump in computational complexity from 2EXPTIME to 3EXPTIME. Then we show that the belief-state construction can be avoided in favor of a direct automata construction which exploits projection to hide unobservable propositions. This allow us to prove that the problem remains 2EXPTIME-complete. The new synthesis technique proposed is effective and readily implementable.","doi":null,"url":"https://ijcai.org/proceedings/2016/152","pdf":"https://ijcai.org/proceedings/2016/0152.pdf","markdown":"https://ijcai.org/proceedings/2016/152.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/152","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":152,"pages":{"first":1044,"last":1049},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}