Publications
Filters: Author is Santiago Figueira [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.
, “Model Theory of XPath on Data Trees. Part {I:} Bisimulation and Characterization”, J. Artif. Intell. Res. {(JAIR)}, vol. 53, p. 271–314, 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.
, “Basic Model Theory of XPath on Data Trees”, in Proceedings of the 17th International Conference on Database Theory, Athens, Greece, 2014.
, “Characterization, Definability and Separation via Saturated Models”, Theoretical Computer Science, vol. 537, p. 72-86, 2014.
, “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.
, “Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies”, Journal of Computer and System Sciences, vol. 80, p. 1102–1118, 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.
, “Completeness Results for Memory Logics”, Annals of Pure and Applied Logic, vol. 163, no. 7, p. 961-972, 2012.
Completeness_Results_for_Memory_Logics.pdf (401.9 KB)
Completeness_Results_for_Memory_Logics.pdf (401.9 KB) , “Linearizing bad sequences: upper bounds for the product and majoring well quasi-orders”, in 19th Workshop on Logic, Language, Information and Computation, 2012.
, “On the expressive power of IF Logic with classical negation via flattening is a second-order logic with weak dependencies”, in 18th Workshop on Logic, Language, Information and Computation, 2011.
