Ontologies and data management: a brief survey
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 …
heterogeneous, unstructured, or incomplete. In order to align and complete data, systems …
Fast query answering over existential rules
Enhancing Datalog with existential quantification gives rise to Datalog∃, a powerful
knowledge representation language widely used in ontology-based query answering. In this …
knowledge representation language widely used in ontology-based query answering. In this …
Existential active integrity constraints
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 …
policies to restore consistency in databases violating them. However, AICs do not allow …
Stable Model Semantics for Description Logic Terminologies
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 …
(KBs) and for (possibly cyclic) terminologies, ultimately showing that terminologies under the …
Generative datalog with stable negation
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 …
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 …
universal models. Among the many such models of different structure and cardinality, the …
Answering queries with negation over existential rules
Ontology-based query answering with existential rules is well understood and implemented
for positive queries, in particular conjunctive queries. For queries with negation, however …
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 …
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 …
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
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 …
and answer set programming. Existential rules have been proposed for representing …