Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2010.34
URN: urn:nbn:de:0030-drops-25813
URL: https://drops.dagstuhl.de/opus/volltexte/2010/2581/
Bauters, Kim ; Janssen, Jeroen ; Schockaert, Steven ; Vermeir, Dirk ; De Cock, Martine
Communicating Answer Set Programs
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{bauters_et_al:LIPIcs:2010:2581,
author = {Kim Bauters and Jeroen Janssen and Steven Schockaert and Dirk Vermeir and Martine De Cock},
title = {{Communicating Answer Set Programs}},
booktitle = {Technical Communications of the 26th International Conference on Logic Programming},
pages = {34--43},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-17-0},
ISSN = {1868-8969},
year = {2010},
volume = {7},
editor = {Manuel Hermenegildo and Torsten Schaub},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2581},
URN = {urn:nbn:de:0030-drops-25813},
doi = {10.4230/LIPIcs.ICLP.2010.34},
annote = {Keywords: }
}
| Seminar: | Technical Communications of the 26th International Conference on Logic Programming | |
| Issue date: | 2010 | |
| Date of publication: | 25.06.2010 |
