PulseAugur
LIVE 15:18:46
research · [2 sources] ·
0
research

AI plan existence problem proven undecidable in new research

By PulseAugur Editorial · Summary by gemini-2.5-flash-lite from 2 sources

Researchers have proven that the plan existence problem in modal logic is undecidable. This problem involves determining if a sequence of epistemic actions can achieve a specified goal, given an initial state and a set of actions. The proof holds even when action preconditions have a modal depth of one and there are no postconditions, resolving a previously unknown question about the problem's decidability. AI

Summary written by gemini-2.5-flash-lite from 2 sources. How we write summaries →

IMPACT Establishes theoretical limits for AI planning agents operating in epistemic domains.

RANK_REASON Academic paper published on arXiv detailing a theoretical proof.

Read on arXiv cs.AI →

COVERAGE [2]

  1. arXiv cs.AI TIER_1 · Antonis Achilleos ·

    An Undecidability Proof for the Plan Existence Problem

    arXiv:2604.22736v1 Announce Type: cross 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 app…

  2. arXiv cs.AI TIER_1 · Antonis Achilleos ·

    An Undecidability Proof for the Plan Existence Problem

    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 …

RELATED ENTITIES

RELATED TOPICS