How easy it is to know how: an upper bound for the satisfiability problem
From MaRDI portal
Publication:6545554
Recommendations
Cites work
- scientific article; zbMATH DE number 3359806 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- A Logic of Knowing How
- A logic of goal-directed knowing how
- A logic of knowing why
- Ability and knowing how in the situation calculus
- Achieving while maintaining: a logic of knowing how with intermediate constraints
- BISIMULATIONS FOR KNOWING HOW LOGICS
- Beyond knowing that: a new generation of epistemic logics
- Computational Complexity
- Constructive knowledge: what agents can achieve under imperfect information
- Contingency and knowing whether
- Handbook of epistemic logic
- Planning-based knowing how: a unified approach
- Tableau-based decision procedure for logic of knowing-how via simple plans
- Tableaux for the Logic of Strategically Knowing How
- The polynomial-time hierarchy
- To know is to know the value of a variable
- Together we know how to achieve: an epistemic logic of know-how
- Uncertainty-based semantics for multi-agent knowing how logics
- Using the Universal Modality: Gains and Questions
- ``Knowing value logic as a normal modal logic
This page was built for publication: How easy it is to know how: an upper bound for the satisfiability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545554)
