Satisfiability of knowing-how formulas over linear plans is NP-complete via a translation to S5 modal logic.
Meyer and Wiebe van Der Hoek , title =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Satisfiability for Knowing How over Linear Plans is NP-complete
Satisfiability of knowing-how formulas over linear plans is NP-complete via a translation to S5 modal logic.