41 citations · 104 across the 19 of their papers we have counts for
21 papers
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…
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…
Computational Complexity of Standpoint LTL
Stéphane Demri, Przemysław Andrzej Wałęga
Standpoint linear temporal logic SLTL is a recent formalism able to model possibly conflicting commitments made by distinct agents, taking into account aspects of temporal reasonin…
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
Stephane Demri, Karin Quaas
We introduce the class of tree constraint automata with data values in Z (equipped with the less than relation and equality predicates to constants) and we show that the nonemptine…
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?
Bartosz Bednarczyk, Stéphane Demri
Adding propositional quantification to the modal logics K, T or S4 is known to lead to undecidability but CTL with propositional quantification under the tree semantics (tQCTL) adm…
Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material)
Bartosz Bednarczyk, Stéphane Demri, Raul Fervari +1
We investigate the expressivity and computational complexity of two modal logics on finite forests equipped with operators to reason on submodels. The logic ML(|) extends the basic…