Combining Answer Sets of Nonmonotonic Logic Programs

10 years 8 months ago
Combining Answer Sets of Nonmonotonic Logic Programs
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 P1 and P2, which have the sets of answer sets AS(P1) and AS(P2), respectively; find a program Q which has answer sets as minimal sets S ∪T for S from AS(P1) and T from AS(P2). The program Q combines answer sets of P1 and P2, 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.
Chiaki Sakama, Katsumi Inoue
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where ASP
Authors Chiaki Sakama, Katsumi Inoue
Comments (0)