Constructing Consensus Logic Programs

In this paper, we suppose an agent which has a knowledge base represented by a logic program under the answer set semantics. We then consider the following two problems: given two programs P1 and P2, which have the sets of answer sets AS(P1) and AS(P2), respectively; (i) find a program Q which has the answer sets as the minimal elements of {S ∩ T | S ∈ AS(P1) and T ∈ AS(P2)}; (ii) find a program R which has the answer sets as the maximal elements of the above set. A program Q satisfying (i) is called minimal consensus between P1 and P2; and R satisfying (ii) is called maximal consensus between P1 and P2. Minimal/maximal consensus extracts common beliefs that are included in an answer set of every program. Consensus provides a method of program development under a specification of constructing a program that reflects the meaning of two or more programs. In application, it contributes to a theory of building consensus in multi-agent systems.

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

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

[3]  Jürgen Dix,et al.  Semantics of (disjunctive) Logic Programs Based on Partial Evaluation , 1999, J. Log. Program..

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

[5]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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

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

[8]  Jean-Louis Lassez,et al.  Computational logic: essays in honor of Alan Robinson , 1991 .

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

[10]  John C. Shepherdson,et al.  Unfold/fold transformations of logic programs , 1992, Mathematical Structures in Computer Science.

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

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

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

[14]  Chiaki Sakama,et al.  Partial Deduction in Disjunctive Logic Programming , 1997, J. Log. Program..

[15]  Antonis C. Kakas,et al.  Computational Logic: Logic Programming and Beyond , 2002, Lecture Notes in Computer Science.

[16]  Michael Wooldridge,et al.  Languages for Negotiation , 2000, ECAI.