How easy it is to know how: an upper bound for the satisfiability problem
From MaRDI portal
Publication:6545554
DOI10.1007/978-3-031-43619-2_28MaRDI QIDQ6545554FDOQ6545554
Andrés R. Saravia, Pablo F. Castro, Raul Fervari, Valentin Cassano, Carlos Areces
Publication date: 29 May 2024
Cites Work
- Computational Complexity
- Title not available (Why is that?)
- Using the Universal Modality: Gains and Questions
- The polynomial-time hierarchy
- Title not available (Why is that?)
- Constructive knowledge: what agents can achieve under imperfect information
- Together we know how to achieve: an epistemic logic of know-how
- A logic of goal-directed knowing how
- A Logic of Knowing How
- Achieving While Maintaining:
- Ability and knowing how in the situation calculus
- Title not available (Why is that?)
- Beyond Knowing That: A New Generation of Epistemic Logics
- Title not available (Why is that?)
- CONTINGENCY AND KNOWING WHETHER
- A logic of knowing why
- Title not available (Why is that?)
- Planning-based knowing how: a unified approach
- Tableau-based decision procedure for logic of knowing-how via simple plans
- BISIMULATIONS FOR KNOWING HOW LOGICS
- Tableaux for the Logic of Strategically Knowing How
- Uncertainty-based semantics for multi-agent knowing how logics
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)
