Publications
Filters: Author is Sergio Abriola [Clear All Filters]
, “Model Theory of XPath on Data Trees. Part II: Binary Bisimulation and Definability”, Information and Computation, In Press.
, “Linearizing well-quasi orders and bounding the length of bad sequences”, Theoretical Computer Science, vol. 603, p. 3–22, 2015.
, “Saturation, Definability, and Separation for XPath on Data Trees”, in Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6 - 8, 2015., 2015.
, “Saturation, Definability, and Separation for XPath on Data Trees”, in 9th Alberto Mendelzon International Workshop on Foundations of Data Management, 2015.
, “Definability for Downward and Vertical XPath on Data Trees”, in 21th Workshop on Logic, Language, Information and Computation, 2014.
, “Definability for Downward and Vertical XPath on Data Trees”, in Logic, Language, Information, and Computation - 21st International Workshop, WoLLIC 2014, Valpara{\'ı}so, Chile, September 1-4, 2014. Proceedings, 2014.
, “A note on the order type of minoring orderings and some algebraic properties of ω2-well quasi-orderings”, in A note on the order type of minoring orderings and some algebraic properties of ω2-well quasi-orderings, 2014.
, “Linearizing bad sequences: upper bounds for the product and majoring well quasi-orders”, in 19th Workshop on Logic, Language, Information and Computation, 2012.
