Strategy representation and reasoning in the situation calculus. (English) Zbl 1403.68276

Kaminka, Gal A. (ed.) et al., ECAI 2016. 22nd European conference on artificial intelligence, The Hague, Netherlands, August 29 – September 2, 2016. Proceedings. Including proceedings of the accompanied conference on prestigious applications of intelligent systems (PAIS 2016). In 2 volumes. Amsterdam: IOS Press (ISBN 978-1-61499-671-2/pbk; 978-1-61499-672-9/ebook). Frontiers in Artificial Intelligence and Applications 285, 982-990 (2016).
Summary: Strategy representation and reasoning has been one of the most active research areas in AI and multi-agent systems. Representative strategic logics are ATL and the more expressive strategy logic SL which reasons about strategies explicitly. In this paper, by a simple extension of the situation calculus with a strategy sort, we develop a general framework for strategy representation and reasoning for complete information games. This framework can be used to compactly represent both concurrent and turn-based possibly infinite game structures, specify the internal structure of strategies, reason about strategies explicitly, and reason about strategic abilities of coalitions under commitments to strategy specifications. We show that our framework is strictly more expressive than SL, and inspired by the work of De Giacomo et al. on bounded action theories, give a decidable fragment of our framework.
For the entire collection see [Zbl 1352.68013].


68T27 Logic in artificial intelligence
Full Text: DOI