Decidability Results in First-Order Epistemic Planning

Decidability Results in First-Order Epistemic Planning

Andrés Occhipinti Liberman, Rasmus Kræmmer Rendsvig

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence
Main track. Pages 4161-4167. https://doi.org/10.24963/ijcai.2020/575

Propositional Dynamic Epistemic Logic (DEL) provides an expressive framework for epistemic planning, but lacks desirable features that are standard in first-order planning languages (such as problem-independent action representations via action schemas). A recent epistemic planning formalism based on First-Order Dynamic Epistemic Logic (FODEL) combines the strengths of DEL (higher-order epistemics) with those of first-order languages (lifted representation), yielding benefits in terms of expressiveness and representational succinctness. This paper studies the plan existence problem for FODEL planning, showing that while the problem is generally undecidable, the cases of single-agent planning and multi-agent planning with non-modal preconditions are decidable.
Keywords:
Planning and Scheduling: Distributed;Multi-agent Planning
Planning and Scheduling: Theoretical Foundations of Planning
Knowledge Representation and Reasoning: Reasoning about Knowledge and Belief
Agent-based and Multi-agent Systems: Multi-agent Planning