Solving Gossip Problems using Answer Set Programming: An Epistemic Planning Approach

  title={Solving Gossip Problems using Answer Set Programming: An Epistemic Planning Approach},
  author={Esra Erdem and Andreas Herzig},
  booktitle={ICLP Technical Communications},
  • E. Erdem, A. Herzig
  • Published in ICLP Technical Communications 22 September 2020
  • Computer Science
We investigate the use of Answer Set Programming to solve variations of gossip problems, by modeling them as epistemic planning problems. 
1 Citations

Tables from this paper

A lightweight epistemic logic and its application to planning
It follows that checking solvability of simple epistemic planning tasks is PSpace -complete, and a ‘common knowledge whether’ operator is introduced, and it is shown that satisfiability is nevertheless NP -complete.


Answer set programming at a glance
The motivation and key concepts behind answer set programming---a promising approach to declarative problem solving.
Lightweight Parallel Multi-Agent Epistemic Planning
It is proved that this extension of classical planning is in PSPACE and an encoding in PDDL is proposed and some experiments are presented providing evidence that it allows us to solve practical problems.
A Simple Account of Multi-Agent Epistemic Planning
This work investigates multi-agent planning based on a simple logic of knowledge that is grounded on the visibility of propositional variables and presents an encoding of multi- agent planning problems expressed in this logic into the classical planning language PDDL.
Simple Epistemic Planning: Generalised Gossiping
It is shown that in the presence of negative goals testing the existence of a successful protocol is NP-complete whereas this is always polynomial-time in the case of purely positive goals.
Potassco: The Potsdam Answer Set Solving Collection
This paper gives an overview of the open source project Potassco, the Potsdam Answer Set Solving Collection, bundling tools for Answer Set Programming developed at the University of Potsdam.
Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL
It is shown that DL-PA behaves better than PDL, having e.g. compactness and eliminability of the Kleene star and both satisfiability and model checking are EXPTIME-complete.
Epistemic protocols for dynamic gossip
This paper characterizes different distributed epistemic protocols in terms of the (largest) class of graphs where each protocol is successful, i.e. where the protocol necessarily ends up with all agents knowing all secrets.
The epistemic gossip problem
It is shown that increasing epistemic depth from 1 to 2 does not double the required number of calls but increases this number by 3 ∕ 2 (for a complete graph), and the following counter-intuitive result generalises to the epistemic gossip problem.
ASP-Core-2 Input Language Format
The ASP-CORE-2 standard input language for Answer Set Programming, which has been adopted in ASP Competition events since 2013, is presented.
A survey of gossiping and broadcasting in communication networks
Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network that one individual has an item of information which needs to be communicated to everyone else.