11 citations · 16 across the 12 of their papers we have counts for
12 papers
Combined Approximations for Uniform Operational Consistent Query Answering
Marco Calautti, Ester Livshits, Andreas Pieris +1
Operational consistent query answering (CQA) is a recent framework for CQA based on revised definitions of repairs, which are built by applying a sequence of operations (e.g., fact…
Finite Axiomatizability by Disjunctive Existential Rules
Marco Calautti, Marco Console, Andreas Pieris
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 re…
On the Complexity of Global Necessary Reasons to Explain Classification
Marco Calautti, Enrico Malizia, Cristian Molinaro
Explainable AI has garnered considerable attention in recent years, as understanding the reasons behind decisions or predictions made by AI systems is crucial for their successful…
Machine Learning-Augmented Ontology-Based Data Access for Renewable Energy Data
Marco Calautti, Damiano Duranti, Paolo Giorgini
Managing the growing data from renewable energy production plants for effective decision-making often involves leveraging Ontology-based Data Access (OBDA), a well-established appr…
Combined Approximations for Uniform Operational Consistent Query Answering
Marco Calautti, Ester Livshits, Andreas Pieris +1
Operational consistent query answering (CQA) is a recent framework for CQA based on revised definitions of repairs, which are built by applying a sequence of operations (e.g., fact…
Querying Data Exchange Settings Beyond Positive Queries
Marco Calautti, Sergio Greco, Cristian Molinaro +1
Data exchange, the problem of transferring data from a source schema to a target schema, has been studied for several years. The semantics of answering positive queries over the ta…
Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study
Marco Calautti, Mostafa Milani, Andreas Pieris
The chase procedure is a fundamental algorithmic tool in databases that allows us to reason with constraints, such as existential rules, with a plethora of applications. It takes a…
The Complexity of Why-Provenance for Datalog Queries
Marco Calautti, Ester Livshits, Andreas Pieris +1
Explaining why a database query result is obtained is an essential task towards the goal of Explainable AI, especially nowadays where expressive database query languages such as Da…
Non-Uniformly Terminating Chase: Size and Complexity
Marco Calautti, Georg Gottlob, Andreas Pieris
The chase procedure, originally introduced for checking implication of database constraints, and later on used for computing data exchange solutions, has recently become a central…
Uniform Operational Consistent Query Answering
Marco Calautti, Ester Livshits, Andreas Pieris +1
Operational consistent query answering (CQA) is a recent framework for CQA, based on revised definitions of repairs and consistent answers, which opens up the possibility of effici…
Exact and Approximate Counting of Database Repairs
Marco Calautti, Ester Livshits, Andreas Pieris +1
A key task in the context of consistent query answering is to count the number of repairs that entail the query, with the ultimate goal being a precise data complexity classificati…
Checking Termination of Bottom-Up Evaluation of Logic Programs with Function Symbols
Marco Calautti, Sergio Greco, Francesca Spezzano +1
Recently, there has been an increasing interest in the bottom-up evaluation of the semantics of logic programs with complex terms. The presence of function symbols in the program m…