zbMATH — the first resource for mathematics

Communicating answer set programs. (English) Zbl 1237.68184
Hermenegildo, Manuel (ed.) et al., Technical communications of the 26th international conference on logic programming (ICLP 2010), July 16–19, 2010, Edinburgh, Scotland, UK. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-17-0). LIPIcs – Leibniz International Proceedings in Informatics 7, 34-43, electronic only (2010).
Summary: 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.
For the entire collection see [Zbl 1213.68040].

68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68N17 Logic programming
Full Text: DOI Link