41 citations · 104 across the 19 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.LO2026
Satisfiability for Knowing How over Linear Plans is NP-complete
Carlos Areces, Pablo Barceló, Valentin Cassano +3
We study the satisfiability problem for a modal logic expressing knowing-how assertions, which captures an agent's ability to achieve a given goal under the standard semantics base…
cs.LO2026
Robustness of Constraint Automata for Description Logics with Concrete Domains
Stéphane Demri, Tianwen Gu
Decidability or complexity issues about the consistency problem for description logics with concrete domains have already been analysed with tableaux-based or type elimination meth…