Knowing How to Plan
Not on the map. Why?
Abstract (arXiv)
Various planning-based know-how logics have been studied in the recent literature. In this paper, we use such a logic to do know-how-based planning via model checking. In particular, we can handle the higher-order epistemic planning involving know-how formulas as the goal, e.g., find a plan to make sure p such that the adversary does not know how to make p false in the future. We give a PTIME algorithm for the model checking problem over finite epistemic transition systems and axiomatize the logic under the assumption of perfect recall.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 29 references that are in the map. First posted on arXiv 22 Jun 2021.
Builds on
7 of 29 references.
References · 7
- 2017Together We Know How to Achieve: An Epistemic Logic of Know-Howcited by 8
- 2016Beyond knowing that: a new generation of epistemic logicscited by 7
- 2017Strategically knowing howcited by 6
- 2018Bundled fragments of first-order modal logic: (un)decidabilitycited by 4
- 2017A New Modal Framework for Epistemic Logiccited by 3
- 2020Dynamic Epistemic Logic Games with Epistemic Temporal Goalscited by 2
- 2013Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existencecited by 1
Built on by
Not cited yet.