Communicating Answer Set Programs

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.

• Type: Conference
• Year: 2010
• Where: ICLP
• Authors: Kim Bauters, Jeroen Janssen, Steven Schockaert, Dirk Vermeir, Martine De Cock
• Keywords: Answer Set, Answer Set Programming, Automated Reasoning, Expressivity, ICLP 2010