Show simple item record

dc.contributor.authorDe Giacomo G
dc.contributor.authorFelli P
dc.contributor.authorLomuscio A
dc.contributor.editorBrewka G
dc.contributor.editorEiter T
dc.contributor.editorMcIlraith SA
dc.date.accessioned2018-08-23T07:57:24Z
dc.date.available2018-08-23T07:57:24Z
dc.date.issued2012
dc.identifier.isbn978-1-57735-560-1
dc.identifier.urihttps://www.aaai.org/ocs/index.php/KR/KR12/paper/viewPaper/4549
dc.identifier.urihttp://hdl.handle.net/10863/5875
dc.description.abstractWe consider the problem of synthesizing an agent protocol satisfying LTL specifications for multiple, partially-observable environments. We present a sound and complete procedure for solving the synthesis problem in this setting and show it is computationally optimal from a theoretical complexity standpoint. While this produces perfect-recall, hence unbounded, strategies we show how to transform these into agent protocols with bounded number of states.en_US
dc.language.isoenen_US
dc.publisherAAAI Pressen_US
dc.rights
dc.titleSynthesizing agent protocols from LTL specifications against multiple partially-observable environmentsen_US
dc.typeBook chapteren_US
dc.date.updated2018-08-23T07:52:06Z
dc.publication.titlePrinciples of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012, Rome, Italy, June 10-14, 2012
dc.language.isiEN-GB
dc.description.fulltextopenen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record