#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2012

2017

- This year (4)
- Last 5 years (13)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Carlos Areces, Raul Fervari, Guillaume Hoffmann
- Logic Journal of the IGPL
- 2015

We study dynamic modal operators that can change the accessibility relation of a model during the evaluation of a formula. In particular, we extend the basic modal language with modalities that are able to delete, add or swap an edge between pairs of elements of the domain. We define a generic framework to characterize this kind of operations. First, we… (More)

- Carlos Areces, Raul Fervari, Guillaume Hoffmann
- Logic Journal of the IGPL
- 2014

We investigate dynamic modal operators that can change the model during evaluation. We define the logic SL by extending the basic modal language with the ♦ modality, which is a diamond operator that in addition has the ability to invert pairs of related elements in the domain while traversing an edge of the accessibility relation. SL is very expressive: it… (More)

- Carlos Areces, Raul Fervari, Guillaume Hoffmann
- FroCos
- 2013

- Carlos Areces, Raul Fervari, Guillaume Hoffmann
- WoLLIC
- 2012

We study dynamic modal operators that can change the model during the evaluation of a formula. In particular, we extend the basic modal language with modalities that are able to swap, delete or add pairs of related elements of the domain, while traversing an edge of the accessibility relation. We study these languages together with the sabotage modal logic,… (More)

- Raul Fervari, Andreas Herzig, Yanjun Li, Yanjing Wang
- IJCAI
- 2017

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 φ means that there exists a (uniform) strategy such that the agent knows that it can make sure φ. We give an… (More)

- Sergio Abriola, María Emilia Descotte, Raul Fervari, Santiago Figueira
- J. Comput. Syst. Sci.
- 2017

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 trees, which are tree-like structures whose every node contains a label from a finite alphabet and a data value from an infinite domain. The language allows us to compare data… (More)

- Carlos Areces, Raul Fervari
- JELIA
- 2016

In this paper we introduce a sound and complete axiomatization for XPath with data constraints extended with hybrid operators. First, we define HXPath=(↑↓), an extension of vertical XPath with nominals and the hybrid operator @. Then, we introduce an axiomatic system for HXPath=(↑↓), and we prove it is complete with respect to the class of abstract data… (More)

- Raul Fervari
- ESSLLI Student Sessions
- 2013

- Raul Fervari
- 2012

Modal logics are appropriate to describe properties of graphs. But usually these are static properties. We investigate dynamic modal operators that can change the model during evaluation. We define the logic SL by extending the basic modal language with the ✸ modality, which is a diamond operator that has the ability to invert pairs of related elements in… (More)