Zobrazeno 1 - 10
of 61
pro vyhledávání: '"Fervari, Raul"'
Labelled tableaux have been a traditional approach to define satisfiability checking procedures for Modal Logics. In many cases, they can also be used to obtained tight complexity bounds and lead to efficient implementations of reasoning tools. More
Externí odkaz:
http://arxiv.org/abs/2406.12090
Autor:
Icard, Benjamin, Fervari, Raul
Misdirection can be defined as the intentional action of causing some misrepresentation in an agent, or in a group of agents. Those misrepresentations may result from verbal actions, as in linguistic deception, or from visual actions, as in visual mi
Externí odkaz:
http://arxiv.org/abs/2401.14516
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 take one of the most standard semantics for this kind of logics based on
Externí odkaz:
http://arxiv.org/abs/2309.17094
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 the standard presentation of knowing that modalities in classical episte
Externí odkaz:
http://arxiv.org/abs/2304.01022
Publikováno v:
EPTCS 335, 2021, pp. 23-37
We introduce a new semantics for a multi-agent epistemic operator of knowing how, based on an indistinguishability relation between plans. Our proposal is, arguably, closer to the standard presentation of knowing that modalities in classical epistemi
Externí odkaz:
http://arxiv.org/abs/2106.11492
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 modal logic ML with the composition operator | from static ambient lo
Externí odkaz:
http://arxiv.org/abs/2007.08598
Autor:
Areces, Carlos, Fervari, Raul
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 3 (July 20, 2021) lmcs:6259
In this paper we introduce sound and strongly complete axiomatizations for XPath with data constraints extended with hybrid operators. First, we present HXPath=, a multi-modal version of XPath with data, extended with nominals and the hybrid operator
Externí odkaz:
http://arxiv.org/abs/2004.00124
Publikováno v:
EPTCS 297, 2019, pp. 91-105
Often, we assume that an action is permitted simply because it is not explicitly forbidden; or, similarly, that an action is forbidden simply because it is not explicitly permitted. This kind of assumptions appear, e.g., in autonomous computing syste
Externí odkaz:
http://arxiv.org/abs/1907.09124
In this paper, we propose a single-agent logic of goal-directed knowing how extending the standard epistemic logic of knowing that with a new knowing how operator. The semantics of the new operator is based on the idea that knowing how to achieve $\p
Externí odkaz:
http://arxiv.org/abs/1705.05254
Publikováno v:
EPTCS 226, 2016, pp. 16-29
Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to delete, a
Externí odkaz:
http://arxiv.org/abs/1609.04086