Search Results - "Abriola, Sergio"
-
1
Axiomatization of XPath with general data comparison
Published in Journal of applied non-classical logics (25-11-2024)Get full text
Journal Article -
2
A logical framework to study concept-learning biases in the presence of multiple explanations
Published in Behavior research methods (01-02-2022)“…When people seek to understand concepts from an incomplete set of examples and counterexamples, there is usually an exponentially large number of…”
Get full text
Journal Article -
3
An epistemic approach to model uncertainty in data-graphs
Published in International journal of approximate reasoning (01-09-2023)“…Graph databases are becoming widely successful as data models that allow to effectively represent and process complex relationships among various types of…”
Get full text
Journal Article -
4
Bisimulations on Data Graphs
Published in The Journal of artificial intelligence research (01-01-2018)“…Bisimulation provides structural conditions to characterize indistinguishability from an external observer between nodes on labeled graphs. It is a fundamental…”
Get full text
Journal Article -
5
Linearizing well quasi-orders and bounding the length of bad sequences
Published in Theoretical computer science (25-10-2015)“…We study the length functions of controlled bad sequences over some well quasi-orders (wqo's) and classify them in the Fast Growing Hierarchy. We develop a new…”
Get full text
Journal Article -
6
On the Complexity of Finding Set Repairs for Data-Graphs
Published in The Journal of artificial intelligence research (01-01-2023)“…In the deeply interconnected world we live in, pieces of information link domains all around us. As graph databases embrace effectively relationships among…”
Get full text
Journal Article -
7
Model theory of XPath on data trees. Part II: Binary bisimulation and definability
Published in Information and computation (01-08-2017)“…We study the expressive power of the downward and vertical fragments of XPath equipped with (in)equality tests over possibly infinite data trees. We introduce…”
Get full text
Journal Article -
8
Axiomatizations for downward XPath on data trees
Published in Journal of computer and system sciences (01-11-2017)“…We give sound and complete axiomatizations for XPath with data tests by ‘equality’ or ‘inequality’, and containing the single ‘child’ axis. This data-aware…”
Get full text
Journal Article -
9
Data-graph repairs: the preferred approach
Published 03-04-2023“…Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023) Repairing inconsistent knowledge bases is a task…”
Get full text
Journal Article -
10
Computational Complexity of Preferred Subset Repairs on Data-Graphs
Published 14-02-2024“…Preferences are a pivotal component in practical reasoning, especially in tasks that involve decision-making over different options or courses of action that…”
Get full text
Journal Article -
11
The Distributional Uncertainty of the SHAP score in Explainable Machine Learning
Published 23-01-2024“…Attribution scores reflect how important the feature values in an input entity are for the output of a machine learning model. One of the most popular…”
Get full text
Journal Article -
12
Measuring well quasi-ordered finitary powersets
Published 22-12-2023“…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…”
Get full text
Journal Article -
13
An epistemic approach to model uncertainty in data-graphs
Published 07-01-2023“…Graph databases are becoming widely successful as data models that allow to effectively represent and process complex relationships among various types of…”
Get full text
Journal Article -
14
On the complexity of finding set repairs for data-graphs
Published 15-06-2022“…In the deeply interconnected world we live in, pieces of information link domains all around us. As graph databases embrace effectively relationships among…”
Get full text
Journal Article -
15
A note on the order type of minoring orderings and some algebraic properties of ω2-well quasi-orderings
Published in 2014 XL Latin American Computing Conference (CLEI) (01-09-2014)“…The minoring ordering between finite sets of (X,≤) is a well quasi-ordering provided (X,≤) is an ω 2 -well quasi-ordering. We mention some known facts about ω…”
Get full text
Conference Proceeding -
16
Axiomatizations for downward XPath on Data Trees
Published 13-05-2016“…We give sound and complete axiomatizations for XPath with data tests by "equality" or "inequality", and containing the single "child" axis. This data-aware…”
Get full text
Journal Article