Communicating Answer Set Programs

Kim Bauters, Jeroen Janssen, Steven Schockaert, Dirk Vermeir, Martine De Cock

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)
31 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationTechnical Communications of the 26th International Conference on Logic Programming
Pages34-43
Number of pages10
Volume7
Publication statusPublished - 2010
EventInternational Conference on Logic Programming - Edinburgh, United Kingdom
Duration: 16 Jul 201019 Jul 2010

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
ISSN (Print)1868-8969
ISSN (Electronic)1868-8969

Conference

ConferenceInternational Conference on Logic Programming
CountryUnited Kingdom
CityEdinburgh
Period16/07/201019/07/2010

Cite this