Advertisement
Published in:
2006 | OriginalPaper | Chapter
Combining Answer Sets of Nonmonotonic Logic Programs
Authors : Chiaki Sakama, Katsumi Inoue
Published in: Computational Logic in Multi-Agent Systems
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. Given two programs
P
1
and
P
2
, which have the sets of answer sets
AS
(
P
1
) and
AS
(
P
2
), respectively; find a program
Q
which has answer sets as minimal sets
S
∪
T
for
S
from
AS
(
P
1
) and
T
from
AS
(
P
2
). The program
Q
combines answer sets of
P
1
and
P
2
, and provides a compositional semantics of two programs. Such program composition has application to coordinating knowledge bases in multi-agent environments. We provide methods for computing program composition and discuss their properties.