Modeling and Reasoning about NTU Games via Answer Set Programming
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 38-44.
Abstract
A compact representation for non-transferable utility games founding on answer set programming is proposed. The representation is fully expressive, in that it can capture all games defined over a finite set of alternatives. Moreover, due to the knowledge representation capabilities of answer set programs, it can easily accommodate the definition of games within a wide range of application domains, ranging from scheduling, to routing and planning, just to name a few. The computational complexity of the proposed framework is studied, in particular, by focusing on the core as the prototypical solution concept. A system supporting the basic reasoning tasks arising therein is also made available, and results of experimental activity are discussed.
@inproceedings{ijcai2016p13,
title = {Modeling and Reasoning about NTU Games via Answer Set Programming},
author = {Amendola, Giovanni and Greco, Gianluigi and Leone, Nicola and Veltri, Pierfrancesco},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {38--44},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/13},
}
TY - CPAPER TI - Modeling and Reasoning about NTU Games via Answer Set Programming AU - Amendola, Giovanni AU - Greco, Gianluigi AU - Leone, Nicola AU - Veltri, Pierfrancesco T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 38 EP - 44 UR - https://ijcai.org/proceedings/2016/13 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: