Stéphane Demri

Temporal logics on strings with prefix relation

2015 · Journal of Logic and Computation

We show that linear-time temporal logic over concrete domains made of finite strings and the prefix relation admits a PS pace -complete satisfiability problem. Actually, we extend a known result with the concrete domain made …

Model-Checking for Ability-Based Logics with Constrained Plans

2023 · Proceedings of the AAAI Conference on Artificial Intelligence

We investigate the complexity of the model-checking problem for a family of modal logics capturing the notion of “knowing how”. We consider the most standard ability-based knowing how logic, for which we show that model-checking …