13 citations · 41 across the 12 of their papers we have counts for
13 papers
Basic Model Theory for Path Predicate Modal Logic
Raul Fervari, Santiago Figueira, Gabriel Goren-Roig +1
Path Predicate Modal Logic (PPML) is a generalization of Basic Modal Logic, where atoms are relational predicates instead of propositional symbols. The study of PPML is motivated a…
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…
Deontic Action Logics: A Modular Algebraic Perspective
Carlos Areces, Valentin Cassano, Pablo Castro +1
In a seminal work, K. Segerberg introduced a deontic logic called DAL to investigate normative reasoning over actions. DAL marked the beginning of a new area of research in Deontic…
Beyond the Spell: A Dynamic Logic Analysis of Misdirection
Benjamin Icard, Raul Fervari
Misdirection can be defined as the intentional action of causing some misrepresentation in an agent, or in a group of agents. Such misrepresentations may result from verbal actions…
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…
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…
Uncertainty-Based Semantics for Multi-Agent Knowing How Logics
Carlos Areces, Raul Fervari, Andrés R. Saravia +1
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…
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…
Axiomatizing Hybrid XPath with Data
Carlos Areces, Raul Fervari
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 vers…
An Algebraic Approach for Action Based Default Reasoning
Pablo F. Castro, Valentin Cassano, Raul Fervari +1
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…
Strategically knowing how
Raul Fervari, Andreas Herzig, Yanjun Li +1
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…
Relation-Changing Logics as Fragments of Hybrid Logics
Carlos Areces, Raul Fervari, Guillaume Hoffmann +1
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…
Axiomatizations for downward XPath on Data Trees
Sergio Abriola, María Emilia Descotte, Raul Fervari +1
We give sound and complete axiomatizations for XPath with data tests by "equality" or "inequality", and containing the single "child" axis. This data-aware logic predicts over data…