Knowing How to Plan

06/22/2021
by   Yanjun Li, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2016

A Dynamic Epistemic Framework for Conformant Planning

In this paper, we introduce a lightweight dynamic epistemic logical fram...
research
07/27/2017

A New Modal Framework for Epistemic Logic

Recent years witnessed a growing interest in non-standard epistemic logi...
research
11/29/2020

A Probabilistic Higher-order Fixpoint Logic

We introduce PHFL, a probabilistic extension of higher-order fixpoint lo...
research
09/07/2017

Model Checking Social Network Models

A social network service is a platform to build social relations among p...
research
07/11/2023

Exploiting Asymmetry in Logic Puzzles: Using ZDDs for Symbolic Model Checking Dynamic Epistemic Logic

Binary decision diagrams (BDDs) are widely used to mitigate the state-ex...
research
07/27/2017

Together We Know How to Achieve: An Epistemic Logic of Know-How (Extended Abstract)

The existence of a coalition strategy to achieve a goal does not necessa...
research
03/04/2021

Wanted Dead or Alive : Epistemic logic for impure simplicial complexes

We propose a logic of knowledge for impure simplicial complexes. Impure ...

Please sign up or login with your details

Forgot password? Click here to reset