Sergio Abriola

Orcid: 0000-0002-1979-5443

According to our database1, Sergio Abriola authored at least 17 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Computational Complexity of Preferred Subset Repairs on Data-Graphs.
CoRR, 2024

On the Complexity of Finding Set Repairs for Data-Graphs (Abstract Reprint).
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

The Distributional Uncertainty of the SHAP Score in Explainable Machine Learning.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023
An epistemic approach to model uncertainty in data-graphs.
Int. J. Approx. Reason., September, 2023

On the Complexity of Finding Set Repairs for Data-Graphs.
J. Artif. Intell. Res., 2023

Measuring well quasi-ordered finitary powersets.
CoRR, 2023

Data-graph repairs: the preferred approach.
Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023), 2023

2021
Characterizations for XPath <sub> R</sub>(đownarrow ).
Proceedings of the Logic, Language, Information, and Computation, 2021

2018
Bisimulations on Data Graphs.
J. Artif. Intell. Res., 2018

2017
Axiomatizations for downward XPath on data trees.
J. Comput. Syst. Sci., 2017

Model theory of XPath on data trees. Part II: Binary bisimulation and definability.
Inf. Comput., 2017

Logics of Repeating Values on Data Trees and Branching Counter Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

2015
Linearizing well quasi-orders and bounding the length of bad sequences.
Theor. Comput. Sci., 2015

Saturation, Definability, and Separation for XPath on Data Trees.
Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6, 2015

2014
Definability for Downward and Vertical XPath on Data Trees.
Proceedings of the Logic, Language, Information, and Computation, 2014

A note on the order type of minoring orderings and some algebraic properties of ω<sup>2</sup>-well quasi-orderings.
Proceedings of the XL Latin American Computing Conference, 2014

2012
Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders.
Proceedings of the Logic, Language, Information and Computation, 2012


  Loading...