Marco Calautti — accepted AI-conference papers

2025

A Datalog Rewriting Algorithm for Warded Ontologies

Davide Benedetto, Marco Calautti, Hebatalla Hammad, Emanuel Sallinger, Adriano Vlad-Starrabba

IJCAI 2025

Existential rules, a.k.a. tuple-generating dependencies (TGDs), form a well-established formalism for specifying ontologies. In particular, the warded language is a well-behaved fragment of TGD-based ontologies, striking a good balance between expressive power and computational complexity of answeri

Cited by 0 Source ↗PDF ↗Scholar ↗

2024

Computing the Why-Provenance for Datalog Queries via SAT Solvers

Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider

AAAI 2024technical

Explaining an answer to a Datalog query is an essential task towards Explainable AI, especially nowadays where Datalog plays a critical role in the development of ontology-based applications. A well-established approach for explaining a query answer is the so-called why-provenance, which essentially…

Cited by 5 Source ↗PDF ↗Scholar ↗