Philippe Balbiani, Andreas Herzig & Nicolas Troquard (2013):
Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL.
In: Proc. of LICS,
pp. 143–152,
doi:10.1109/LICS.2013.20.
Gerhard Brewka, Thomas Eiter & Miroslaw Truszczynski (2011):
Answer set programming at a glance.
Commun. ACM 54(12),
pp. 92–103,
doi:10.1145/2043174.2043195.
Francesco Calimeri, Wolfgang Faber, Martin Gebser, Giovambattista Ianni, Roland Kaminski, Thomas Krennwallner, Nicola Leone, Francesco Ricca & Torsten Schaub (2020):
ASP-Core-2 Input language format.
Theory and Practice of Logic Programming 20(2),
pp. 294–309,
doi:10.1017/S1471068419000450.
Martin Cooper, Andreas Herzig, Frédéric Maris, Elise Perrotin & Julien Vianey (2020):
Lightweight Parallel Multi-Agent Epistemic Planning.
In: Proc. of KR.
Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris & Pierre Régnier (2016):
A Simple Account of Multi-Agent Epistemic Planning.
In: Proc. of ECAI,
doi:10.3233/978-1-61499-672-9-193.
Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris & Pierre Régnier (2016):
Simple epistemic planning: generalised gossiping.
CoRR abs/1606.03244.
Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris & Pierre Régnier (2019):
The epistemic gossip problem.
Discret. Math. 342(3),
pp. 654–663,
doi:10.1016/j.disc.2018.10.041.
Hans van Ditmarsch, Jan van Eijck, Pere Pardo, Rahim Ramezanian & François Schwarzentruber (2017):
Epistemic protocols for dynamic gossip.
J. Appl. Log. 20,
pp. 1–31,
doi:10.1016/j.jal.2016.12.001.
Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub & Marius Thomas Schneider (2011):
Potassco: The Potsdam Answer Set Solving Collection.
AI Commun. 24(2),
pp. 107–124,
doi:10.3233/AIC-2011-0491.
Sandra M. Hedetniemi, Stephen T. Hedetniemi & Arthur L. Liestman (1988):
A survey of gossiping and broadcasting in communication networks.
Networks 18(4),
pp. 319–349,
doi:10.1002/net.3230180406.
David W. Krumme, George Cybenko & K. N. Venkataraman (1992):
Gossiping in Minimal Time.
SIAM J. on Computing 21,
pp. 111–139,
doi:10.1137/0221010.
eptcs@eptcs.org