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] Real-time reasoning in OWL2 for GDPR compliance

PA Bonatti, L Ioffredo, IM Petrova, L Sauro… - Artificial Intelligence, 2020 - Elsevier
This paper shows how knowledge representation and reasoning techniques can be used to
support organizations in complying with the GDPR, that is, the new European data …

[HTML][HTML] Tractable approximate deduction for OWL

JZ Pan, Y Ren, Y Zhao - Artificial Intelligence, 2016 - Elsevier
Today's ontology applications require efficient and reliable description logic (DL) reasoning
services. Expressive DLs usually have high worst case complexity while tractable DLs are …

[图书][B] Practical uniform interpolation for expressive description logics

P Koopmann - 2015 - search.proquest.com
The thesis investigates methods for uniform interpolation in expressive description logics.
Description logics are formalisms commonly used to model ontologies. Ontologies store …

[PDF][PDF] Chasing sets: How to use existential rules for expressive reasoning

D Carral, I Dragoste, M Krötzsch, C Lewe - Description Logics, 2019 - iccl.inf.tu-dresden.de
We propose that modern existential rule reasoners can enable fully declarative
implementations of rule-based inference methods in knowledge representation, in the sense …

On the capabilities and limitations of OWL regarding typecasting and ontology design pattern views

AA Krisnadhi, P Hitzler, K Janowicz - … Workshop on OWL, OWLED 2015, co …, 2016 - Springer
In ontology engineering, particularly when dealing with heterogeneous domains and their
subfields, legacy data, various data models, existing standards, code lists, and so forth, there …

A data complexity and rewritability tetrachotomy of ontology-mediated queries with a covering axiom

O Gerasimova, S Kikot, A Kurucz… - … on Principles of …, 2020 - repository.londonmet.ac.uk
Aiming to understand the data complexity of answering conjunctive queries mediated by an
axiom stating that a class is covered by the union of two other classes, we show that …

Pushing the boundaries of tractable ontology reasoning

D Carral, C Feier, BC Grau, P Hitzler… - The Semantic Web–ISWC …, 2014 - Springer
We identify a class of Horn ontologies for which standard reasoning tasks such as instance
checking and classification are tractable. The class is general enough to include the OWL 2 …

[PDF][PDF] The combined approach to query answering beyond the OWL 2 profiles

C Feier, D Carral, G Stefanoni, BC Grau… - … -Fourth International Joint …, 2015 - ijcai.org
Combined approaches have become a successful technique for CQ answering over
ontologies. Existing algorithms, however, are restricted to the logics underpinning the OWL 2 …

Deciding Satisfiability by Tableaux

A David - International Conference on Automated Deduction, 2015 - Springer
We propose a tableau-based decision procedure for the full Alternating-time Temporal Logic
ATL^*. We extend our procedure for ATL^+ in order to deal with nesting of temporal …