Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Expressiveness of communication in answer set programming

Bauters, Kim, Schockaert, Steven, Janssen, Jeroen, Vermeir, Dirk and De Cock, Martine 2013. Expressiveness of communication in answer set programming. Theory and Practice of Logic Programming 13 (3) , pp. 361-394. 10.1017/S1471068411000561

Full text not available from this repository.

Abstract

Answer set programming (ASP) is a form of declarative programming that allows to succinctly formulate and efficiently solve complex problems. An intuitive extension of this formalism is communicating ASP, in which multiple ASP programs collaborate to solve the problem at hand. However, the expressiveness of communicating ASP has not been thoroughly studied. In this paper, we present a systematic study of the additional expressiveness offered by allowing ASP programs to communicate. First, we consider a simple form of communication where programs are only allowed to ask questions to each other. For the most part, we deliberately consider only simple programs, i.e. programs for which computing the answer sets is in P. We find that the problem of deciding whether a literal is in some answer set of a communicating ASP program using simple communication is NP-hard. In other words, due to the ability of these simple ASP programs to communicate and collaborate, we move up a step in the polynomial hierarchy. Second, we modify the communication mechanism to also allow us to focus on a sequence of communicating programs, where each program in the sequence may successively remove some of the remaining models. This mimics a network of leaders, where the first leader has the first say and may remove models that he or she finds unsatisfactory. Using this particular communication mechanism allows us to capture the entire polynomial hierarchy. This means, in particular, that communicating ASP could be used to solve problems that are above the second level of polynomial hierarchy, such as some forms of abductive reasoning as well as PSPACE-complete problems such as STRIPS planning.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
ISSN: 1471-0684
Last Modified: 04 Jun 2017 06:24
URI: http://orca.cf.ac.uk/id/eprint/59679

Citation Data

Cited 2 times in Google Scholar. View in Google Scholar

Cited 1 time in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item