We present a formalism for logic program cooperation based on the answer set semantics. The system consists of independent logic programs that are connected via a sequential communication channel. When presented with an input set of literals from its predecessor, a logic program computes its output as an answer set of itself, enriched with the input. It turns out that the communication strategy makes the system quite expressive: essentially a sequence of a fixed number of programs n captures the complexity class ∑np, i.e. the n-th level of the polynomial hierarchy. On the other hand, unbounded sequences capture the polynomial hierarchy ℘ℋ. These results make the formalism suitable for complex applications such as hierarchical decision making and preference-based diagnosis on ordered theories. In addition, such systems can be realized by implementing an appropriate control strategy on top of existing solvers such as DLV or SMODELS, possibly in a distributed environment. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Van Nieuwenborgh, D., Heymans, S., & Vermeir, D. (2006). Cooperating answer set programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4079 LNCS, pp. 226–241). Springer Verlag. https://doi.org/10.1007/11799573_18
Mendeley helps you to discover research relevant for your work.