Standard

Expressiveness of Communication in Answer Set Programming. / Bauters, Kim; Janssen, Jeroen; Schockaert, Steven; De Cock, Martine; Vermeir, Dirk.

In: Theory and Practice of Logic Programming, Vol. 13, 2013, p. 361-394.

Research output: Contribution to journalArticle

Harvard

Bauters, K, Janssen, J, Schockaert, S, De Cock, M & Vermeir, D 2013, 'Expressiveness of Communication in Answer Set Programming', Theory and Practice of Logic Programming, vol. 13, pp. 361-394.

APA

Bauters, K., Janssen, J., Schockaert, S., De Cock, M., & Vermeir, D. (2013). Expressiveness of Communication in Answer Set Programming. Theory and Practice of Logic Programming, 13, 361-394.

Vancouver

Bauters K, Janssen J, Schockaert S, De Cock M, Vermeir D. Expressiveness of Communication in Answer Set Programming. Theory and Practice of Logic Programming. 2013;13:361-394.

Author

Bauters, Kim ; Janssen, Jeroen ; Schockaert, Steven ; De Cock, Martine ; Vermeir, Dirk. / Expressiveness of Communication in Answer Set Programming. In: Theory and Practice of Logic Programming. 2013 ; Vol. 13. pp. 361-394.

BibTeX

@article{1a4ba99914a34e5a8079573f5b87e7d0,
title = "Expressiveness of Communication in Answer Set Programming",
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 only consider 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: we move up a step in the polynomial hierarchy due to the ability of these simple ASP programs to communicate and collaborate. 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 the polynomial hierarchy, such as some forms of abductive reasoning as well as PSPACE-complete problems such as STRIPS planning.",
keywords = "answer set programming, communicating agents",
author = "Kim Bauters and Jeroen Janssen and Steven Schockaert and {De Cock}, Martine and Dirk Vermeir",
year = "2013",
language = "English",
volume = "13",
pages = "361--394",
journal = "Theory and Practice of Logic Programming",
issn = "1471-0684",
publisher = "Cambridge Univ. Press",

}

RIS

TY - JOUR

T1 - Expressiveness of Communication in Answer Set Programming

AU - Bauters, Kim

AU - Janssen, Jeroen

AU - Schockaert, Steven

AU - De Cock, Martine

AU - Vermeir, Dirk

PY - 2013

Y1 - 2013

N2 - 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 only consider 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: we move up a step in the polynomial hierarchy due to the ability of these simple ASP programs to communicate and collaborate. 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 the polynomial hierarchy, such as some forms of abductive reasoning as well as PSPACE-complete problems such as STRIPS planning.

AB - 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 only consider 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: we move up a step in the polynomial hierarchy due to the ability of these simple ASP programs to communicate and collaborate. 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 the polynomial hierarchy, such as some forms of abductive reasoning as well as PSPACE-complete problems such as STRIPS planning.

KW - answer set programming

KW - communicating agents

M3 - Article

VL - 13

SP - 361

EP - 394

JO - Theory and Practice of Logic Programming

JF - Theory and Practice of Logic Programming

SN - 1471-0684

ER -

ID: 2173831