# Knowing How to Plan

arXiv: https://arxiv.org/abs/2106.11504 · HTML: https://mlsanity.com/paper/2106.11504/

## 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 (most cited first, 7 of 7)

- [Together We Know How to Achieve: An Epistemic Logic of Know-How](https://mlsanity.com/paper/1705.09349/) (2017)
- [Beyond knowing that: a new generation of epistemic logics](https://mlsanity.com/paper/1605.01995/) (2016)
- [Strategically knowing how](https://mlsanity.com/paper/1705.05254/) (2017)
- [Bundled fragments of first-order modal logic: (un)decidability](https://mlsanity.com/paper/1803.10508/) (2018)
- [A New Modal Framework for Epistemic Logic](https://mlsanity.com/paper/1707.08764/) (2017)
- [Dynamic Epistemic Logic Games with Epistemic Temporal Goals](https://mlsanity.com/paper/2001.07141/) (2020)
- [Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence](https://mlsanity.com/paper/1310.6429/) (2013)

## 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.