12 citations · 29 across the 10 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.LO2023★ 1 cited
How Easy it is to Know How: An Upper Bound for the Satisfiability Problem
Carlos Areces, Valentin Cassano, Raul Fervari +2
We investigate the complexity of the satisfiability problem for a modal logic expressing `knowing how' assertions, related to an agent's abilities to achieve a certain goal. We tak…
cs.LO2023
Uncertainty-Based Knowing How Logic
Carlos Areces, Raul Fervari, Andrés R. Saravia +1
We introduce a novel semantics for a multi-agent epistemic operator of knowing how, based on an indistinguishability relation between plans. Our proposal is, arguably, closer to th…