activity
20112025
most citedOntological Queries: Rewriting and Optimization (Extended Version)

14 citations · 18 across the 18 of their papers we have counts for

collaborators

20 papers

cs.DB2025

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…

cs.LO2025

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…

cs.LO2024

Characterizing Data Dependencies Then and Now

Phokion G. Kolaitis, Andreas Pieris

Data dependencies are integrity constraints that the data of interest must obey. During the 1980s, Janos Makowsky made a number of contributions to the study of data dependencies;…

cs.DB2023

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…

cs.DB2023

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…

cs.DB2023★ 1 cited

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…