{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:17:23Z","timestamp":1762460243762},"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":[[2020,7]]},"abstract":"<jats:p>Nondeterministic strategies are strategies (or protocols, or plans) that, given a history in a game, assign a set of possible actions, all of which are winning. An important problem is that of refining such strategies. For instance, given a nondeterministic strategy that allows only safe executions, refine it to, additionally, eventually reach a desired state of affairs. We show that strategic problems involving strategy refinement can be solved elegantly in the framework of Strategy Logic (SL), a very expressive logic to reason about strategic abilities. Specifically, we introduce an extension of SL with nondeterministic strategies and an operator expressing strategy refinement. We show that model checking this logic can be done at no additional computational cost with respect to standard SL, and can be used to solve a variety of problems such as synthesis of maximally permissive strategies or refinement of Nash equilibria.<\/jats:p>","DOI":"10.24963\/kr.2020\/30","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:39:16Z","timestamp":1597883956000},"page":"294-303","source":"Crossref","is-referenced-by-count":0,"title":["Nondeterministic Strategies and their Refinement in Strategy Logic"],"prefix":"10.24963","author":[{"given":"Giuseppe","family":"De Giacomo","sequence":"first","affiliation":[{"name":"University of Rome \"La Sapienza\""}]},{"given":"Bastien","family":"Maubert","sequence":"additional","affiliation":[{"name":"University of Naples Federico II"}]},{"given":"Aniello","family":"Murano","sequence":"additional","affiliation":[{"name":"University of Naples Federico II"}]}],"member":"10584","event":{"number":"17","sponsor":["Artificial Intelligence Journal","Principles of Knowledge Representation and Reasoning Inc.","Association for Logic Programming","Center for Perspicuous Computing","European Association for Artificial Intelligence","Ontopic - The Virtual Knowledge Graph Company"],"acronym":"KR-2020","name":"17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}","start":{"date-parts":[[2020,9,12]]},"theme":"Artificial Intelligence","location":"Rhodes, Greece","end":{"date-parts":[[2020,9,18]]}},"container-title":["Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning"],"original-title":[],"deposited":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T16:18:35Z","timestamp":1604593115000},"score":1,"resource":{"primary":{"URL":"https:\/\/proceedings.kr.org\/2020\/30"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/kr.2020\/30","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}