How easy it is to know how: an upper bound for the satisfiability problem

DOI10.1007/978-3-031-43619-2_28MaRDI QIDQ6545554FDOQ6545554

Authors: Carlos Areces, Valentin Cassano, Pablo F. Castro, Raul Fervari, Andrés R. Saravia 

Publication date: 29 May 2024

Recommendations

• A Logic of Knowing How
• Tableau-based decision procedure for logic of knowing-how via simple plans
• A logic of goal-directed knowing how
• Tableaux for the Logic of Strategically Knowing How
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics

zbMATH Keywords

complexitysatisfiabilityknowing how

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

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: a logic of knowing how with intermediate constraints
• Ability and knowing how in the situation calculus
• Handbook of epistemic logic
• Beyond knowing that: a new generation of epistemic logics
• To know is to know the value of a variable
• Contingency and knowing whether
• A logic of knowing why
• ``Knowing value logic as a normal modal logic
• 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)