Axiomatizing Hybrid XPath with Data

by   Carlos Areces, et al.

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 @. Then, we introduce an axiomatic system for HXPath=, and we prove it is strongly complete with respect to the class of abstract data models, i.e., data models in which data values are abstracted as equivalence relations. We prove a general completeness result similar to the one presented in, e.g., Blackburn and ten Cate 2006, that ensures that certain extensions of the axiomatic system we introduce are also complete. The axiomatic systems that can be obtained in this way cover a large family of hybrid XPath languages over different classes of frames, and we present concrete examples. In addition, we investigate axiomatizations over the class of tree models, structures widely used in practice. We show that a strongly complete, finite, first-order axiomatization of hybrid XPath over trees does not exist, and we propose two alternatives to deal with this issue. We finally introduce filtrations to investigate the status of decidability of the satisfiability problem for these languages.


page 10

page 11


Many-Sorted Hybrid Modal Languages

We continue our investigation into hybrid polyadic multi-sorted logic wi...

Hybrid lemmatization in HuSpaCy

Lemmatization is still not a trivial task for morphologically rich langu...

Completeness of Tableau Calculi for Two-Dimensional Hybrid Logics

Hybrid logic is one of the extensions of modal logic. The many-dimension...

Named Models in Coalgebraic Hybrid Logic

Hybrid logic extends modal logic with support for reasoning about indivi...

Strong completeness of modal logics over 0-dimensional metric spaces

We prove strong completeness results for some modal logics with the univ...

Putting the Agents back in the Domain: A Two-Sorted Term-Modal Logic

In the present paper syntax and semantics will be presented for an expan...

Comparison of orchard networks using their extended μ-representation

Phylogenetic networks generalize phylogenetic trees in order to model re...

Please sign up or login with your details

Forgot password? Click here to reset