Ontologies and data management: a brief survey

T Schneider, M Šimkus - KI-Künstliche Intelligenz, 2020 - Springer
Abstract Information systems have to deal with an increasing amount of data that is
heterogeneous, unstructured, or incomplete. In order to align and complete data, systems …

Fast query answering over existential rules

N Leone, M Manna, G Terracina, P Veltri - ACM Transactions on …, 2019 - dl.acm.org
Enhancing Datalog with existential quantification gives rise to Datalog∃, a powerful
knowledge representation language widely used in ontology-based query answering. In this …

Existential active integrity constraints

M Calautti, L Caroprese, S Greco, C Molinaro… - Expert Systems with …, 2021 - Elsevier
Active integrity constraints (AICs) are a useful formalism to express integrity constraints and
policies to restore consistency in databases violating them. However, AICs do not allow …

Stable Model Semantics for Description Logic Terminologies

F Di Stefano, M Šimkus - Proceedings of the AAAI Conference on …, 2024 - ojs.aaai.org
This paper studies a stable model semantics for Description Logic (DL) knowledge bases
(KBs) and for (possibly cyclic) terminologies, ultimately showing that terminologies under the …

Generative datalog with stable negation

M Alviano, M Lanzinger, M Morak, A Pieris - Proceedings of the 42nd …, 2023 - dl.acm.org
Extending programming languages with stochastic behaviour such as probabilistic choices
or random sampling has a long tradition in computer science. A recent development in this …

[PDF][PDF] Computing Cores for Existential Rules with the Standard Chase and ASP.

M Krötzsch - KR, 2020 - iccl.inf.tu-dresden.de
To reason with existential rules (aka tuple-generating dependencies), one often computes
universal models. Among the many such models of different structure and cardinality, the …

Answering queries with negation over existential rules

S Ellmauthaler, M Krötzsch, S Mennicke - Proceedings of the AAAI …, 2022 - ojs.aaai.org
Ontology-based query answering with existential rules is well understood and implemented
for positive queries, in particular conjunctive queries. For queries with negation, however …

Optimizing the computation of overriding in DLN

PA Bonatti, IM Petrova, L Sauro - Artificial Intelligence, 2022 - Elsevier
One of the factors that is hindering the adoption of nonmonotonic description logics in
applications is performance. Even when monotonic and nonmonotonic inferences have the …

Query answering in circumscribed OWL2 profiles

PA Bonatti - Annals of Mathematics and Artificial Intelligence, 2021 - Springer
This paper partially bridges a gap in the literature on Circumscription in Description Logics
by investigating the tractability of conjunctive query answering in OWL2's profiles. It turns out …

Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin

JF Baget, L Garcia, F Garreau, C Lefèvre… - Annals of mathematics …, 2018 - Springer
This article deals with the combination of ontologies and rules by means of existential rules
and answer set programming. Existential rules have been proposed for representing …