Sergio Alejandro Abriola





Bio

CONICET researcher at Instituto de Investigación en Ciencias de la Computación
PhD in Mathematics at Department of Mathematics, Universidad de Buenos Aires

Research interests

  • Logic and Computability Theory
  • Data logics
  • XPath
  • Publications

    • Bisimulations on data graphs. Sergio Abriola, Pablo Barceló, Diego Figueira, and Santiago Figueira. Journal of Artificial Intelligence Research, volume 61, pages 171-213.
    • Axiomatizations for downward XPath on Data Trees. Sergio Abriola, María Emilia Descotte, Raul Fervari, and Santiago Figueira. Journal of Computer and System Sciences, volume 89, pages 209-245.
    • Model Theory of XPath on Data Trees. Part II: Binary Bisimulation and Definability. Sergio Abriola, Maria Emilia Descotte, and Santiago Figueira. In Information and Computation 255P2 (2017), pages 195-223.
    • Logics of repeating values on data trees and branching counter systems. Sergio Abriola, Diego Figueira, and Santiago Figueira. In FoSSaCS 2017 (19th International Conference on Foundations of Software Science and Computation Structures).
    • Bisimulations on data graphs. Sergio Abriola, Pablo Barceló, Diego Figueira, and Santiago Figueira. In KR 2016 (15th International Conference on Principles of Knowledge Representation and Reasoning).
    • Saturation, Definability, and Separation for XPath on Data Trees. Sergio Abriola, Maria Emilia Descotte, and Santiago Figueira. In AMW 2015 (Alberto Mendelzon Workshop).
    • Linearizing well-quasi orders and bounding the length of bad sequences Sergio Abriola, Santiago Figueira, and Gabriel Senno. Theoretical Computer Science, volume 603, pages 3-22.
    • A note on the order type of minoring orderings and some algebraic properties of ω2-well quasi-orderings. Sergio Abriola and Santiago Figueira. XL Latin American Computing Conference (CLEI 2014), Montevideo, September 15 -- September 19, 2014.
    • Definability for Downward and Vertical XPath on Data Trees. Sergio Abriola, Maria Emilia Descotte, and Santiago Figueira. In WoLLIC 2014 (Workshop of Logic, Languages, Information and Computation).
    • Linearizing bad sequences: upper bounds for the product and majoring well quasi-orders. Sergio Abriola, Santiago Figueira and Gabriel Senno. In WoLLIC 2012 (Workshop of Logic, Languages, Information and Computation, volume 7456 of Lecture Notes in Computer Science, pages 110-126, 2012.
    • On the length of controlled bad sequences and the Fast Growing Hierarchy. Sergio Abriola, Santiago Figueira, and Gabriel Senno. In Proc. IV Congreso Latinoamericano de Matemáticos. Universidad Nacional de Córdoba, Córdoba, August 6–10, 2012.

    PhD Thesis

    MSc. Thesis

    Address

    Department of Computer Science
    Instituto de Investigación en Ciencias de la Computación
    FCEyN - Universidad de Buenos Aires
    Pabellón I - Ciudad Universitaria - (C1428EGA)
    Buenos Aires - Argentina

    Office 24
    Tel.:+54-11-5285-7487
    Fax: +54-11-4576-3359
    e-mail: sabriola at dc.uba.ar