Paper Info
Title
Communicating Answer Set Programs
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.
Year
DOI
Venue
2010
10.4230/LIPIcs.ICLP.2010.34
Leibniz International Proceedings in Informatics
Keywords
Field
DocType
declarative programming,answer set programming
Functional logic programming,Programming language,Computer science,Inductive programming,Algorithm,Theoretical computer science,Stable model semantics,Logic programming,Declarative programming,Answer set programming,Expressivity,Complex problems
Conference
Volume
ISSN
Citations 
7
1868-8969
3
PageRank 
References 
Authors
0.37
12
5
Name
Order
Citations
PageRank
Kim Bauters1387.91
Jeroen Janssen2716.17
Steven Schockaert358357.95
Dirk Vermeir469485.34
Martine De Cock5134196.06