1 citations · 2 across the 7 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2023
Measuring well quasi-ordered finitary powersets
Sergio Abriola, Simon Halfon, Aliaume Lopez +3
The complexity of a well-quasi-order (wqo) can be measured through three ordinal invariants: the width as a measure of antichains, height as a measure of chains, and maximal order…
cs.LO2016
Axiomatizations for downward XPath on Data Trees
Sergio Abriola, María Emilia Descotte, Raul Fervari +1
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…