Inconsistency-tolerant querying of description logic knowledge bases

M Bienvenu, C Bourgaux - … Web: Logical Foundation of Knowledge Graph …, 2017 - Springer
An important issue that arises when querying description logic (DL) knowledge bases is how
to handle the case in which the knowledge base is inconsistent. Indeed, while it may be …

Answering why-not questions on SPARQL queries

M Wang, J Liu, B Wei, S Yao, H Zeng, L Shi - Knowledge and Information …, 2019 - Springer
Abstract SPARQL, the W3C standard for RDF query languages, has gained significant
popularity in recent years. An increasing amount of effort is currently being exerted to …

Computing a possibility theory repair for partially preordered inconsistent ontologies

S Belabbes, S Benferhat - IEEE Transactions on Fuzzy …, 2021 - ieeexplore.ieee.org
We address the problem of handling inconsistency in uncertain knowledge bases that are
specified in the lightweight fragments of description logics DL-Lite. More specifically, we …

Toward a more efficient generation of structured argumentation graphs

B Yun, S Vesic, M Croitoru - Computational Models of Argument, 2018 - ebooks.iospress.nl
To address the needs of the EU NoAW project, in this paper we solve the problem of
efficiently generating the argumentation graphs from knowledge bases expressed using …

Handling inconsistency in partially preordered ontologies: the Elect method

S Belabbes, S Benferhat… - Journal of Logic and …, 2021 - academic.oup.com
We focus on the problem of handling inconsistency in lightweight ontologies. We assume
that the terminological knowledge base (TBox) is specified in DL-Lite and that the set of …

Explanatory dialogues with argumentative faculties over inconsistent knowledge bases

A Arioua, P Buche, M Croitoru - Expert Systems with Applications, 2017 - Elsevier
We introduce a formal model of explanatory dialogue called EDS. We extend this model by
including argumentation capacities to facilitate knowledge acquisition in inconsistent …

[PDF][PDF] Inconsistency Measures for Repair Semantics in OBDA.

B Yun, S Vesic, M Croitoru, P Bisquert - IJCAI, 2018 - ijcai.org
In this paper, we place ourselves in the Ontology Based Data Access (OBDA) setting and
investigate reasoning with inconsistent existential rules knowledge bases. We use the …

[HTML][HTML] Logic-based argumentation with existential rules

A Arioua, M Croitoru, S Vesic - International Journal of Approximate …, 2017 - Elsevier
In this paper we are interested in the use of argumentation for handling inconsistency in
inconsistent knowledge bases expressed with existential rules. We propose an instantiation …

Inconsistency-tolerant query answering: Rationality properties and computational complexity analysis

JF Baget, S Benferhat, Z Bouraoui, M Croitoru… - Logics in Artificial …, 2016 - Springer
Generalising the state of the art, an inconsistency-tolerant semantics can be seen as a
couple composed of a modifier operator and an inference strategy. In this paper we deepen …

Non-objection inference for inconsistency-tolerant query answering

S Benferhat, Z Bouraoui, M Croitoru… - … Joint Conference on …, 2016 - univ-artois.hal.science
Repair based techniques are a standard way of deal-ing with inconsistency in the context of
ontology based data access. We propose a novel non-objection inference relation (along …