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.
展开▼
