Work in progress.

DELPHIC is a novel semantics for Dynamic Epistemic Logic based on an alternative representation of epistemic states called possibilities. DELPHIC ASP is an Answer Set Programming model of a DEL-based epistemic planner built on top of the DELPHIC semantics. Since the DELPHIC semantics comprises the full range of DEL actions, DELPHIC ASP generalizes the PLATO solver.

PLATO is an Answer Set Programming (ASP) model implementing an epistemic planner that is built on top a fragment of Dynamic Epistemic Logic called $m\mathcal{A}^*$. The fragment comprises (public and private) ontic actions and (public, private and semi-private) sensing and announcement actions. The planner implements both a Kripke semantics for the fragment and a novel alternative semantics based on objects called possibilities. PLATO is implemented using the clingo solver for ASP programs, which provides some useful APIs that allow for solving problems in an iterative fashion. In this way, we can try to compute plans of increasing length, akin to a BFS visit. The goal of PLATO is to investigate the practical usability of ASP in the implementation of epistemic planners.

EFP 2.0 is an epistemic planner that is built on top a fragment of Dynamic Epistemic Logic called $m\mathcal{A}^*$. The fragment comprises (public and private) ontic actions and (public, private and semi-private) sensing and announcement actions. The planner implements both a Kripke semantics for the fragment and a novel alternative semantics based on objects called possibilities.