Marco Console
YOU?
Author Swipe
Ontology-Based Schema-Level Data Quality: The Case of Consistency Open
The quality of metadata plays a crucial role in many data FAIRification processes. So much so, in fact, that all the four main principles of data FAIRification prescribe the use of high-quality metadata. One of the main data management par…
Finite Axiomatizability by Disjunctive Existential Rules Open
Rule-based languages lie at the core of several areas of central importance to databases and artificial intelligence such as deductive databases and knowledge representation and reasoning. Disjunctive existential rules (a.k.a. disjunctive …
Answering Conjunctive Queries with Safe Negation and Inequalities over RDFS Knowledge Bases Open
Expressing negative conditions is a crucial feature of query languages for knowledge bases (KBs). Answering such queries over ontological KBs, however, is a very challenging task that becomes undecidable even for lightweight Description Lo…
What Does a Query Answer Tell You? Informativeness of Query Answers for Knowledge Bases Open
Query answering for Knowledge Bases (KBs) amounts to extracting information from the various models of a KB, and presenting the user with an object that represents such information. In the vast majority of cases, this object consists of th…
moduli: A Disaggregated Data Management Architecture for Data-Intensive Workflows Open
As companies store, process, and analyse bigger and bigger volumes of highly heterogeneous data, novel research and technological challenges are emerging. Traditional and rigid data integration and processing techniques become inadequate f…
Editorial: Special Issue on Quality Aspects of Data Preparation Open
This Special Issue of the Journal of Data and Information Quality (JDIQ) contains novel theoretical and methodological contributions as well as state-of-the-art reviews and research perspectives on quality aspects of data preparation. In t…
Epistemic Disjunctive Datalog for Querying Knowledge Bases Open
The Datalog query language can express several powerful recursive properties, often crucial in real-world scenarios. While answering such queries is feasible over relational databases, the picture changes dramatically when data is enriched…
A review of data abstraction Open
It is well-known that Artificial Intelligence (AI), and in particular Machine Learning (ML), is not effective without good data preparation, as also pointed out by the recent wave of data-centric AI. Data preparation is the process of gath…
Querying Incomplete Numerical Data: Between Certain and Possibile Answers Open
Queries with aggregation and arithmetic operations, as well as incomplete data, are common in real-world database, but we lack a good understanding of how they should interact. On the one hand, systems based on SQL provide ad-hoc rules for…
Querying Incomplete Numerical Data: Between Certain and Possible Answers Open
Queries with aggregation and arithmetic operations, as well as incomplete data, are common in real-world database, but we lack a good understanding of how they should interact. On the one hand, systems based on SQL provide ad-hoc rules for…
Monotone Abstractions in Ontology-Based Data Management Open
In Ontology-Based Data Management (OBDM), an abstraction of a source query q is a query over the ontology capturing the semantics of q in terms of the concepts and the relations available in the ontology. Since a perfect characterization o…
Monotone Abstractions in Ontology-Based Data Management Open
International audience
Intensional and Extensional Views in DL-Lite Ontologies Open
The use of virtual collections of data is often essential in several data and knowledge management tasks. In the literature, the standard way to define virtual data collections is via views, i.e., virtual relations defined using queries. I…
Model-theoretic Characterizations of Rule-based Ontologies Open
An ontology specifies an abstract model of a domain of interest via a formal language that is typically based on logic. Although description logics are popular formalisms for modeling ontologies, it is generally agreed that tuple-generatin…
Benchmarking Approximate Consistent Query Answering Open
Consistent query answering (CQA) aims to deliver meaningful answers when queries are evaluated over inconsistent databases. Such answers must be certainly true in all repairs, which are consistent databases whose difference from the incons…
Abstraction in Data Integration Open
International audience
Reasoning about Measures of Unmeasurable Sets Open
In a variety of reasoning tasks, one estimates the likelihood of events by means of volumes of sets they define. Such sets need to be measurable, which is usually achieved by putting bounds, sometimes ad hoc, on them. We address the questi…
Coping with Incomplete Data: Recent Advances Open
Handling incomplete data in a correct manner is a notoriously hard problem in databases. Theoretical approaches rely on the computationally hard notion of certain answers, while practical solutions rely on ad hoc query evaluation technique…
Queries with Arithmetic on Incomplete Databases Open
The standard notion of query answering over incomplete database is that of certain answers, guaranteeing correctness regardless of how incomplete data is interpreted. In majority of real-life databases, relations have numerical columns and…
Epistemic Integrity Constraints for Ontology-Based Data Management Open
Ontology-based data management (OBDM) is a powerful knowledge-oriented paradigm for managing data spread over multiple heterogeneous sources. In OBDM, the data sources of an information system are handled through the reconciled view provid…
Measuring the Likelihood of Numerical Constraints Open
Our goal is to measure the likelihood of the satisfaction of numerical constraints in the absence of prior information. We study expressive constraints, involving arithmetic and complex numerical functions, and even quantification over num…
Do We Need Many-valued Logics for Incomplete Information? Open
One of the most common scenarios of handling incomplete information occurs in relational databases. They describe incomplete knowledge with three truth values, using Kleene's logic for propositional formulae and a rather peculiar extension…
Counting Database Repairs under Primary Keys Revisited Open
Consistent query answering (CQA) aims to deliver meaningful answers when queries are evaluated over inconsistent databases. Such answers must be certainly true in all repairs, which are consistent databases whose difference from the incons…
Counting Database Repairs under Primary Keys Revisited Open
Consistent query answering (CQA) aims to deliver meaningful answers when queries are evaluated over inconsistent databases. Such answers must be certainly true in all repairs, which are consistent databases whose difference from the incons…
Fragments of Bag Relational Algebra: Expressiveness and Certain Answers Open
While all relational database systems are based on the bag data model, much of theoretical research still views relations as sets. Recent attempts to provide theoretical foundations for modern data management problems under the bag semanti…
On Querying Incomplete Information in Databases under Bag Semantics Open
Querying incomplete data is an important task both in data management, and in many AI applications that use query rewriting to take advantage of relational database technology. Usually one looks for answers that are certain, i.e., true in …
Approximations and refinements of certain answers via many-valued logics Open
Computing certain answers is the preferred way of answering queries in scenarios involving incomplete data. This, however, is computationally expensive, so practical systems use efficient techniques based on a particular three-valued logic…