文章基本信息

标题：Communicating Answer Set Programs
本地全文：下载
作者：Kim Bauters ; Jeroen Janssen ; Steven Schockaert 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2010
卷号：7
页码：34-43
DOI：10.4230/LIPIcs.ICLP.2010.34
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.