Communicating ASP and the Polynomial Hierarchy

摘要

Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models. The semantics and expressiveness of this framework crucially depends on the nature of the communication mech anism that is adopted. The communication mechanism we introduce in this paper allows us to focus on a sequence of programs, where each pro gram in the sequence may successively eliminate some of the remaining models. The underlying intuition is that of leaders and followers: each agent's decisions are limited by what its leaders have previously decided. We show that extending answer set programs in this way allows us to capture the entire polynomial hierarchy.