Modeling and Reasoning About NTU Games via Answer Set Programming
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. PDF
Cite
Text
Amendola et al. "Modeling and Reasoning About NTU Games via Answer Set Programming." International Joint Conference on Artificial Intelligence, 2016.Markdown
[Amendola et al. "Modeling and Reasoning About NTU Games via Answer Set Programming." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/amendola2016ijcai-modeling/)BibTeX
@inproceedings{amendola2016ijcai-modeling,
title = {{Modeling and Reasoning About NTU Games via Answer Set Programming}},
author = {Amendola, Giovanni and Greco, Gianluigi and Leone, Nicola and Veltri, Pierfrancesco},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2016},
pages = {38-45},
url = {https://mlanthology.org/ijcai/2016/amendola2016ijcai-modeling/}
}