5 papers · 1 filter
On the generic information capacity of relational schemas with a single binary relation
Benoît Groz, Jan Hidders, Nina Pardal +2
We consider database schemas consisting of a single binary relation, with key constraints and inclusion dependencies. Over this space of 20 schemas, we completely characterize when…
Sufficient Explanations in Databases and their Connections to Database Repairs
Leopoldo Bertossi, Nina Pardal
We investigate the notion of sufficient explanation, and a sufficiency-degree as attribution score for database tuples in relation to query answering. We also investigate and explo…
The KG-ER Conceptual Schema Language
Enrico Franconi, Benoît Groz, Jan Hidders +4
We propose KG-ER, a conceptual schema language for knowledge graphs that describes the structure of knowledge graphs independently of their representation (relational databases, pr…
Rewriting Consistent Answers on Annotated Data
Phokion G. Kolaitis, Nina Pardal, Jonni Virtema +1
We embark on a study of the consistent answers of queries over databases annotated with values from a naturally ordered positive semiring. In this setting, the consistent answers o…
Computational Complexity of Preferred Subset Repairs on Data-Graphs
Nina Pardal, Santiago Cifuentes, Edwin Pin +2
Preferences are a pivotal component in practical reasoning, especially in tasks that involve decision-making over different options or courses of action that could be pursued. In t…