Search Results for author:
Found 4 papers, 0 papers with code
Depth-Bounded Epistemic Planning
Additionally, we show it to be complete with respect to planning tasks having a solution within bound b of reasoning depth (and hence the iterative bound-deepening variant is complete in the standard sense).
A Semantic Approach to Decidability in Epistemic Planning (Extended Version)
Finally, we show that two well-known epistemic planning systems based on action templates, when interpreted under the setting of knowledge, conform to the commutativity axiom, hence proving their decidability.
DELPHIC: Practical DEL Planning via Possibilities (Extended Version)
To substantiate this claim, we implement both approaches in ASP and we set up an experimental evaluation to compare DELPHIC with the traditional, Kripke-based approach.
Modelling Multi-Agent Epistemic Planning in ASP. Theory and Practice of Logic Programming
In these scenarios, epistemic reasoning, i. e., reasoning about agents' beliefs about themselves and about other agents' beliefs, is essential to design winning strategies.
