Modeling and Reasoning about NTU Games via Answer Set Programming

Giovanni Amendola, Gianluigi Greco, Nicola Leone, Pierfrancesco Veltri

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.
Original languageEnglish
Title of host publicationProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016
PublisherIJCAI Inc
Number of pages8
ISBN (Print)978-1-57735-770-4
Publication statusPublished - 15 Jul 2016
EventTwenty-Fifth International Joint Conference on Artificial Intelligence - New York City, United States
Duration: 9 Jul 201615 Jul 2016


ConferenceTwenty-Fifth International Joint Conference on Artificial Intelligence
Abbreviated titleIJCAI 2016
Country/TerritoryUnited States
CityNew York City
Internet address


Dive into the research topics of 'Modeling and Reasoning about NTU Games via Answer Set Programming'. Together they form a unique fingerprint.

Cite this