Affiliation:
1. Wakayama University, Sakaedani, Wakayama, Japan
2. National Institute of Informatics, Tokyo, Japan
Abstract
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
P
1
and
P
2
, which have the collections of answer sets
AS
(
P
1
) and
AS
(
P
2
), respectively; (i) find a program
Q
which has the set of answer sets such that
AS
(
Q
) =
AS
(
P
1
) ∪
AS
(
P
2
); (ii) find a program
R
which has the set of answer sets such that
AS
(
R
) =
AS
(
P
1
) ∩
AS
(
P
2
). A program
Q
satisfying the condition (i) is called
generous coordination
of
P
1
and
P
2
; and
R
satisfying (ii) is called
rigorous coordination
of
P
1
and
P
2
. 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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献