Bauters, Kim
[Author];
Janssen, Jeroen
[Author];
Schockaert, Steven
[Author];
Vermeir, Dirk
[Author];
De Cock, Martine
[Author]
;
Kim Bauters and Jeroen Janssen and Steven Schockaert and Dirk Vermeir and Martine De Cock
[Contributor]
You can manage bookmarks using lists, please log in to your user account for this.
Media type:
Text;
E-Article;
Electronic Conference Proceeding
Title:
Communicating Answer Set Programs
Contributor:
Bauters, Kim
[Author];
Janssen, Jeroen
[Author];
Schockaert, Steven
[Author];
Vermeir, Dirk
[Author];
De Cock, Martine
[Author]
Published:
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2010
Language:
English
DOI:
https://doi.org/10.4230/LIPIcs.ICLP.2010.34
Origination:
Footnote:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Description:
Answer set programming is a form of declarative programming that has proven very successful in succinctly formulating and solving complex problems. Although mechanisms for representing and reasoning with the combined answer set programs of multiple agents have already been proposed, the actual gain in expressivity when adding communication has not been thoroughly studied. We show that allowing simple programs to talk to each other results in the same expressivity as adding negation-as-failure. Furthermore, we show that the ability to focus on one program in a network of simple programs results in the same expressivity as adding disjunction in the head of the rules.