Definability for Downward and Vertical XPath on Data Trees

Autores
Abriola, Sergio Alejandro; Descotte, María Emilia; Figueira, Santiago
Año de publicación
2014
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
We study the expressive power of the downward and vertical fragments of XPath equipped with (in)equality tests over data trees. We give necessary and sufficient conditions for a class of pointed data trees to be definable by a set of formulas or by a single formula of each of the studied logics. To do so, we introduce a notion of saturation, and show that over saturated data trees bisimulation coincides with logical equivalence.
Fil: Abriola, Sergio Alejandro. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Descotte, María Emilia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Figueira, Santiago. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Materia
Xpath
Bisimulación
Caracterización
Lógica Modal
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/41628
Acceder
id CONICETDig_c274d5da24ad6a704514d699c55eb314
oai_identifier_str oai:ri.conicet.gov.ar:11336/41628
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Definability for Downward and Vertical XPath on Data TreesAbriola, Sergio AlejandroDescotte, María EmiliaFigueira, SantiagoXpathBisimulaciónCaracterizaciónLógica Modalhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1We study the expressive power of the downward and vertical fragments of XPath equipped with (in)equality tests over data trees. We give necessary and sufficient conditions for a class of pointed data trees to be definable by a set of formulas or by a single formula of each of the studied logics. To do so, we introduce a notion of saturation, and show that over saturated data trees bisimulation coincides with logical equivalence.Fil: Abriola, Sergio Alejandro. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Descotte, María Emilia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Figueira, Santiago. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaSpringer2014-05info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/41628Abriola, Sergio Alejandro; Descotte, María Emilia; Figueira, Santiago; Definability for Downward and Vertical XPath on Data Trees; Springer; Lecture Notes in Computer Science; 8652; 5-2014; 20-350302-9743CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://link.springer.com/chapter/10.1007/978-3-662-44145-9_2info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-662-44145-9_2info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T10:36:05Zoai:ri.conicet.gov.ar:11336/41628instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 10:36:05.294CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Definability for Downward and Vertical XPath on Data Trees
title Definability for Downward and Vertical XPath on Data Trees
spellingShingle Definability for Downward and Vertical XPath on Data Trees
Abriola, Sergio Alejandro
Xpath
Bisimulación
Caracterización
Lógica Modal
title_short Definability for Downward and Vertical XPath on Data Trees
title_full Definability for Downward and Vertical XPath on Data Trees
title_fullStr Definability for Downward and Vertical XPath on Data Trees
title_full_unstemmed Definability for Downward and Vertical XPath on Data Trees
title_sort Definability for Downward and Vertical XPath on Data Trees
dc.creator.none.fl_str_mv Abriola, Sergio Alejandro
Descotte, María Emilia
Figueira, Santiago
author Abriola, Sergio Alejandro
author_facet Abriola, Sergio Alejandro
Descotte, María Emilia
Figueira, Santiago
author_role author
author2 Descotte, María Emilia
Figueira, Santiago
author2_role author
author
dc.subject.none.fl_str_mv Xpath
Bisimulación
Caracterización
Lógica Modal
topic Xpath
Bisimulación
Caracterización
Lógica Modal
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv We study the expressive power of the downward and vertical fragments of XPath equipped with (in)equality tests over data trees. We give necessary and sufficient conditions for a class of pointed data trees to be definable by a set of formulas or by a single formula of each of the studied logics. To do so, we introduce a notion of saturation, and show that over saturated data trees bisimulation coincides with logical equivalence.
Fil: Abriola, Sergio Alejandro. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Descotte, María Emilia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Figueira, Santiago. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
description We study the expressive power of the downward and vertical fragments of XPath equipped with (in)equality tests over data trees. We give necessary and sufficient conditions for a class of pointed data trees to be definable by a set of formulas or by a single formula of each of the studied logics. To do so, we introduce a notion of saturation, and show that over saturated data trees bisimulation coincides with logical equivalence.
publishDate 2014
dc.date.none.fl_str_mv 2014-05
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/41628
Abriola, Sergio Alejandro; Descotte, María Emilia; Figueira, Santiago; Definability for Downward and Vertical XPath on Data Trees; Springer; Lecture Notes in Computer Science; 8652; 5-2014; 20-35
0302-9743
CONICET Digital
CONICET
url http://hdl.handle.net/11336/41628
identifier_str_mv Abriola, Sergio Alejandro; Descotte, María Emilia; Figueira, Santiago; Definability for Downward and Vertical XPath on Data Trees; Springer; Lecture Notes in Computer Science; 8652; 5-2014; 20-35
0302-9743
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/chapter/10.1007/978-3-662-44145-9_2
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-662-44145-9_2
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1844614380584435712
score 13.070432

Publicaciones similares