Coordination in answer set programming

This article studies a semantics of multiple logic programs, and synthesizes a program having such a collective semantics. More precisely, the following two problems are considered: given two logic programs <i>P</i><sub>1</sub> and <i>P</i><sub>2</sub>, which have the collections of answer sets <i>AS</i>(<i>P</i><sub>1</sub>) and <i>AS</i>(<i>P</i><sub>2</sub>), respectively; (i) find a program <i>Q</i> which has the set of answer sets such that <i>AS</i>(<i>Q</i>) = <i>AS</i>(<i>P</i><sub>1</sub>) ∪ <i>AS</i>(<i>P</i><sub>2</sub>); (ii) find a program <i>R</i> which has the set of answer sets such that <i>AS</i>(<i>R</i>) = <i>AS</i>(<i>P</i><sub>1</sub>) ∩ <i>AS</i>(<i>P</i><sub>2</sub>). A program <i>Q</i> satisfying the condition (i) is called <i>generous coordination</i> of <i>P</i><sub>1</sub> and <i>P</i><sub>2</sub>; and <i>R</i> satisfying (ii) is called <i>rigorous coordination</i> of <i>P</i><sub>1</sub> and <i>P</i><sub>2</sub>. Generous coordination retains all of the answer sets of each program, but permits the introduction of additional answer sets of the other program. By contrast, rigorous coordination forces each program to give up some answer sets, but the result remains within the original answer sets for each program. Coordination provides a program that reflects the meaning of two or more programs. We provide methods for constructing these two types of coordination and address its application to logic-based multi-agent systems.

[1]  Evelina Lamma,et al.  Cooperation and Competition in ALIAS: A Logic Framework for Agents that Negotiate , 2004, Annals of Mathematics and Artificial Intelligence.

[2]  Norman Y. Foo,et al.  Logical Foundations of Negotiation: Outcome, Concession, and Adaptation , 2004, AAAI.

[3]  Wolfgang Faber,et al.  Declarative problem-solving using the DLV system , 2000 .

[4]  Marco Schaerf,et al.  Arbitration (or How to Merge Knowledge Bases) , 1998, IEEE Trans. Knowl. Data Eng..

[5]  Chiaki Sakama,et al.  Generality Relations in Answer Set Programming , 2006, ICLP.

[6]  Vladimir Lifschitz,et al.  Answer set programming and plan generation , 2002, Artif. Intell..

[7]  Norman Foo,et al.  Negotiating Logic Programs , 1998 .

[8]  Vladimir Lifschitz,et al.  Definitions in Answer Set Programming: (Extended Abstract) , 2003, ICLP.

[9]  Chiaki Sakama,et al.  Combining Answer Sets of Nonmonotonic Logic Programs , 2005, CLIMA.

[10]  Wolfgang Faber,et al.  DLV - A System for Declarative Problem Solving , 2000, ArXiv.

[11]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[12]  Evelina Lamma,et al.  Modularity in Logic Programming , 1994, J. Log. Program..

[13]  Chiaki Sakama,et al.  Constructing Consensus Logic Programs , 2006, LOPSTR.

[14]  Antonio Brogi,et al.  Programming by Combining General Logic Programs , 1999, J. Log. Comput..

[15]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[16]  Danny De Schreye,et al.  Compositionality of Normal Open Logic Programs , 1997, J. Log. Program..

[17]  Chiaki Sakama,et al.  Coordination Between Logical Agents , 2004, CLIMA.

[18]  Georg Gottlob,et al.  Multiagent Compromises, Joint Fixpoints, and Stable Models , 2002, Computational Logic: Logic Programming and Beyond.

[19]  Sébastien Konieczny,et al.  On the Logic of Merging , 1998, KR.

[20]  Antonio Brogi,et al.  On the Semantics of Logic Program Composition , 2004, Program Development in Computational Logic.

[21]  Jürgen Dix,et al.  Characterizations of the Disjunctive Stable Semantics by Partial Evaluation , 1997, J. Log. Program..

[22]  Sandro Etalle,et al.  A Compositional Semantics for Normal Open Programs , 1996, JICSLP.

[23]  Sarit Kraus,et al.  Combining Multiple Knowledge Bases , 1991, IEEE Trans. Knowl. Data Eng..

[24]  Rina Dechter,et al.  Propositional semantics for disjunctive logic programs , 1994, Annals of Mathematics and Artificial Intelligence.

[25]  SakamaChiaki,et al.  Coordination in answer set programming , 2008 .

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

[27]  Marina De Vos,et al.  Extending Answer Sets for Logic Programming Agents , 2004, Annals of Mathematics and Artificial Intelligence.