Hilbert-style Axiomatization for Hybrid XPath with Data

Areces, C. and Fervari, R.. Hilbert-style Axiomatization for Hybrid XPath with Data. In Proceedings of the 15th European Conference On Logics In Artificial Intelligence (JELIA), 2016.

Download: [pdf] 

Abstract:

In this paper we introduce a sound and complete axiomatization for XPath with data constraints extended with hybrid operators. First, we define HXPath = (\up,\down), an extension of vertical XPath with nominals and the hybrid operator @. Then, we introduce an axiomatic system for HXPath = (\up,\down), and we prove it is complete with respect to the class of abstract data trees, i.e., data trees in which data values are abstracted as equivalence relations. As a corollary, we also obtain completeness with respect to the class of concrete data trees.

BibTeX: (download)

@INPROCEEDINGS{arec:hilb16,
  author = {Areces, C. and Fervari, R.},
  title = {Hilbert-style Axiomatization for Hybrid XPath with Data},
  booktitle = {Proceedings of the 15th European Conference On Logics In Artificial
	Intelligence (JELIA)},
  year = {2016},
  abstract = {In this paper we introduce a sound and complete axiomatization for
	XPath with data constraints extended with hybrid operators. First,
	we define HXPath = (\up,\down), an extension of vertical XPath with
	nominals and the hybrid operator @. Then, we introduce an axiomatic
	system for HXPath = (\up,\down), and we prove it is complete with
	respect to the class of abstract data trees, i.e., data trees in
	which data values are abstracted as equivalence relations. As a corollary,
	we also obtain completeness with respect to the class of concrete
	data trees.},
  owner = {areces},
  timestamp = {2016.09.05}
}

Generated by bib2html.pl (written by Patrick Riley) on Mon Dec 04, 2017 20:59:00