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 …

Ontology-mediated query answering with data-tractable description logics

M Bienvenu, M Ortiz - Reasoning Web. Web Logic Rules: 11th …, 2015 - Springer
Recent years have seen an increasing interest in ontology-mediated query answering, in
which the semantic knowledge provided by an ontology is exploited when querying data …

[HTML][HTML] The price of query rewriting in ontology-based data access

G Gottlob, S Kikot, R Kontchakov, V Podolskii… - Artificial Intelligence, 2014 - Elsevier
We give a solution to the succinctness problem for the size of first-order rewritings of
conjunctive queries in ontology-based data access with ontology languages such as OWL 2 …

From classical to consistent query answering under existential rules

T Lukasiewicz, MV Martinez, A Pieris… - Proceedings of the AAAI …, 2015 - ojs.aaai.org
Querying inconsistent ontologies is an intriguing new problem that gave rise to a flourishing
research activity in the description logic (DL) community. The computational complexity of …

A survey of large-scale reasoning on the web of data

G Antoniou, S Batsakis, R Mutharaju, JZ Pan… - The Knowledge …, 2018 - cambridge.org
As more and more data is being generated by sensor networks, social media and
organizations, the Web interlinking this wealth of information becomes more complex. This is …

[PDF][PDF] Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates.

S Ahmetaj, M Ortiz, M Simkus - IJCAI, 2016 - ijcai.org
We consider instance queries mediated by an ontology expressed in the expressive DL
ALCHIO with closed predicates. We observe that such queries are non-monotonic and …

The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases

G Stefanoni, B Motik, M Krötzsch, S Rudolph - Journal of Artificial …, 2014 - jair.org
OWL 2 EL is a popular ontology language that supports role inclusions--axioms of the form
S1... Sn⊆ S that capture compositional properties of roles. Role inclusions closely …

Non-uniformly terminating chase: Size and complexity

M Calautti, G Gottlob, A Pieris - Proceedings of the 41st ACM SIGMOD …, 2022 - dl.acm.org
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 …

Rewriting guarded existential rules into small datalog programs

S Ahmetaj, M Ortiz, M Simkus - 21st International Conference on …, 2018 - drops.dagstuhl.de
The goal of this paper is to understand the relative expressiveness of the query language in
which queries are specified by a set of guarded (disjunctive) tuple-generating dependencies …

[PDF][PDF] Datalog+/-: Questions and answers

G Gottlob, T Lukasiewicz, A Pieris - … International Conference on the …, 2014 - cdn.aaai.org
• What is Datalog±and what are its advantages? Datalog±is a rule-based formalism that
combines the advantages of logic programming in Datalog with features for expressing …