Advanced search
1 file | 337.63 KB

Communicating answer set programs

Kim Bauters (UGent) , Jeroen Janssen (UGent) , Steven Schockaert (UGent) , Martine De Cock (UGent) and Dirk Vermeir
Author
Organization
Abstract
Answer set programming i s 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.
Keywords
answer set programming, logic programming, multi-agent

Downloads

  • 10003.BuatersKim.2581.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 337.63 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Bauters, Kim, Jeroen Janssen, Steven Schockaert, Martine De Cock, and Dirk Vermeir. 2010. “Communicating Answer Set Programs.” In Leibniz International Proceedings in Informatics, ed. Manuel Hermenegildo and Torsten Schaub, 7:34–43. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum für Informatik.
APA
Bauters, Kim, Janssen, J., Schockaert, S., De Cock, M., & Vermeir, D. (2010). Communicating answer set programs. In M. Hermenegildo & T. Schaub (Eds.), LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS (Vol. 7, pp. 34–43). Presented at the 26th International Conference of Logic Programming (ICLP 2010), Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum für Informatik.
Vancouver
1.
Bauters K, Janssen J, Schockaert S, De Cock M, Vermeir D. Communicating answer set programs. In: Hermenegildo M, Schaub T, editors. LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum für Informatik; 2010. p. 34–43.
MLA
Bauters, Kim, Jeroen Janssen, Steven Schockaert, et al. “Communicating Answer Set Programs.” Leibniz International Proceedings in Informatics. Ed. Manuel Hermenegildo & Torsten Schaub. Vol. 7. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 2010. 34–43. Print.
@inproceedings{981643,
  abstract     = {Answer set programming i s 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.},
  author       = {Bauters, Kim and Janssen, Jeroen and Schockaert, Steven and De Cock, Martine and Vermeir, Dirk},
  booktitle    = {LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS},
  editor       = {Hermenegildo, Manuel and Schaub, Torsten},
  issn         = {1868-8969},
  keyword      = {answer set programming,logic programming,multi-agent},
  language     = {eng},
  location     = {Edinburgh, Scotland, UK},
  pages        = {34--43},
  publisher    = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  title        = {Communicating answer set programs},
  url          = {http://dx.doi.org/10.4230/LIPIcs.ICLP.2010.34},
  volume       = {7},
  year         = {2010},
}

Altmetric
View in Altmetric