Combining answer sets of nonmonotonic logic programs

Abstract

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 f2, which have the sets of answer sets AS(P1) and AS(P2), respectively; find a program Q which has answer sets as minimal sets SUT 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. © Springer-Verlag Berlin Heidelberg 2006.