Axiomatizations for downward XPath on data trees

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Abriola, S., Descotte, M.E., Fervari, R., Figueira, S.
Formato: JOUR
Materias:
Axiomatization
Data tree
Modal logic
Normal form
Query language
XML
XPath
Computer circuits
Query languages
Trees (mathematics)
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_00220000_v89_n_p209_Abriola
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares