ExplorerArtificial IntelligenceAI
Research PaperResearchia:202604.27002

An Undecidability Proof for the Plan Existence Problem

Antonis Achilleos

Abstract

The plan existence problem asks, given a goal in the form of a formula in modal logic, an initial epistemic state (a pointed Kripke model), and a set of epistemic actions, whether there exists a sequence of actions that can be applied to reach the goal. We prove that even in the case where the preconditions of the epistemic actions have modal depth at most 1, and there are no postconditions, the plan existence problem is undecidable. The (un)decidability of this problem was previously unknown. -...

Submitted: April 27, 2026Subjects: AI; Artificial Intelligence

Description / Details

The plan existence problem asks, given a goal in the form of a formula in modal logic, an initial epistemic state (a pointed Kripke model), and a set of epistemic actions, whether there exists a sequence of actions that can be applied to reach the goal. We prove that even in the case where the preconditions of the epistemic actions have modal depth at most 1, and there are no postconditions, the plan existence problem is undecidable. The (un)decidability of this problem was previously unknown.


Source: arXiv:2604.22736v1 - http://arxiv.org/abs/2604.22736v1 PDF: https://arxiv.org/pdf/2604.22736v1 Original Link: http://arxiv.org/abs/2604.22736v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Apr 27, 2026
Topic:
Artificial Intelligence
Area:
AI
Comments:
0
Bookmark