Preliminary Results on Modeling Interdependent Scheduling Games via Answer Set Programming

Recently, in the context of planning and coordinating large-scale infrastructures, a model of Interdependent Scheduling Games (ISG) has been proposed. This problem requires interdependent services among players, that control only a limited number of services and schedule independently. A player can schedule his services at any time. However, each service starts to be profitable for the player when all the services on which it depends have been activated. In this paper we approach the ISG by means of Answer Set Programming (ASP). ASP is an established logic-based programming paradigm which has been successfully applied for solving complex combinatorial problems arising in many areas of knowledge. We show how the ISG can be elegantly encoded by means of an ASP program.

[1]  Nicola Leone,et al.  Modeling and Reasoning about NTU Games via Answer Set Programming , 2016, IJCAI.

[2]  Wolfgang Faber,et al.  On the Computation of Paracoherent Answer Sets , 2017, AAAI.

[3]  Francesco Buccafurri,et al.  Enhancing Disjunctive Datalog by Constraints , 2000, IEEE Trans. Knowl. Data Eng..

[4]  Wolfgang Faber,et al.  Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers , 2008, J. Algorithms.

[5]  Martin Gebser,et al.  The Sixth Answer Set Programming Competition , 2017, J. Artif. Intell. Res..

[6]  Nicola Leone,et al.  On the Application of Answer Set Programming to the Conference Paper Assignment Problem , 2016, AI*IA.

[7]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

[8]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[9]  Pascal Van Hentenryck,et al.  Interdependent Scheduling Games , 2016, IJCAI.

[10]  Wolfgang Faber,et al.  Answer Set Programming , 2013, Reasoning Web.

[11]  Mario Alviano,et al.  Minimal Undefinedness for Fuzzy Answer Sets , 2017, AAAI.

[12]  Wolfgang Faber,et al.  Externally Supported Models for Efficient Computation of Paracoherent Answer Sets , 2018, AAAI.

[13]  Jeffrey S. Rosenschein,et al.  Mechanism Design for Automated Negotiation, and its Application to Task Oriented Domains , 1996, Artif. Intell..

[14]  Alex M. Andrew,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2004 .

[15]  Thomas Eiter,et al.  Modular Paracoherent Answer Sets , 2014, JELIA.

[16]  Francesco Ricca,et al.  ASPQ: An ASP-Based 2QBF Solver , 2016, QBF@SAT.

[17]  Miroslaw Truszczynski,et al.  Random Models of Very Hard 2QBF and Disjunctive Programs: An Overview , 2018 .

[18]  Martin Gebser,et al.  What's Hot in the Answer Set Programming Competition , 2016, AAAI.

[19]  Giovanni Amendola,et al.  Solving the Stable Roommates Problem using Incoherent Answer Set Programs , 2018, RiCeRcA@AI*IA.

[20]  Martin Gebser,et al.  Evaluation Techniques and Systems for Answer Set Programming: a Survey , 2018, IJCAI.

[21]  Wolfgang Faber,et al.  Semantics and complexity of recursive aggregates in answer set programming , 2011, Artif. Intell..

[22]  Mario Alviano,et al.  A MaxSAT Algorithm Using Cardinality Constraints of Bounded Size , 2015, IJCAI.

[23]  Giovanni Amendola.  Dealing with Incoherence in ASP: Split Semi-Equilibrium Semantics , 2014, DWAI@AI*IA.

[24]  Thomas Eiter,et al.  Semi-equilibrium models for paracoherent answer set programs , 2016, Artif. Intell..

[25]  Nicola Leone,et al.  Entity set expansion from the Web via ASP , 2017, ICLP.

[26]  Yuliya Lierler,et al.  Systems, Engineering Environments, and Competitions , 2016, AI Mag..

[27]  Nicola Leone,et al.  Some DLV Applications for Knowledge Management , 2009, LPNMR.

[28]  Nicola Leone,et al.  An ASP-Based System for Team-Building in the Gioia-Tauro Seaport , 2010, PADL.

[29]  Martin Gebser,et al.  Design and results of the Fifth Answer Set Programming Competition , 2016, Artif. Intell..

[30]  Luca Pulina,et al.  A multi-engine approach to answer-set programming* , 2013, Theory and Practice of Logic Programming.

[31]  Giorgio Terracina,et al.  Taming primary key violations to query large inconsistent data via ASP , 2015, Theory and Practice of Logic Programming.

[32]  Russell Bent,et al.  Last-Mile Restoration for Multiple Interdependent Infrastructures , 2012, AAAI.

[33]  Martin Gebser,et al.  The Design of the Sixth Answer Set Programming Competition - - Report - , 2014, LPNMR.

[34]  Francesco Ricca,et al.  A Generator of Hard 2QBF Formulas and ASP Programs , 2018, KR.

[35]  Miroslaw Truszczynski,et al.  Generating Hard Random Boolean Formulas and Disjunctive Logic Programs , 2017, IJCAI.