Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Inconsistency-tolerant querying of description logic knowledge bases
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 …
to handle the case in which the knowledge base is inconsistent. Indeed, while it may be …
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 …
specified in the lightweight fragments of description logics DL-Lite. More specifically, we …
Answering why-not questions on SPARQL queries
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 …
popularity in recent years. An increasing amount of effort is currently being exerted to …
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 …
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
We introduce a formal model of explanatory dialogue called EDS. We extend this model by
including argumentation capacities to facilitate knowledge acquisition in inconsistent …
including argumentation capacities to facilitate knowledge acquisition in inconsistent …
Tractable closure-based possibilistic repair for partially ordered DL-Lite ontologies
Inconsistency in formal ontologies is usually addressed by computing repairs for the dataset.
There are several strategies for selecting the repairs used to evaluate queries, with various …
There are several strategies for selecting the repairs used to evaluate queries, with various …
Toward a more efficient generation of structured argumentation graphs
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 …
efficiently generating the argumentation graphs from knowledge bases expressed using …
[PDF][PDF] Inconsistency Measures for Repair Semantics in OBDA.
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 …
investigate reasoning with inconsistent existential rules knowledge bases. We use the …
[HTML][HTML] Logic-based argumentation with existential rules
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 …
inconsistent knowledge bases expressed with existential rules. We propose an instantiation …
Non-objection inference for inconsistency-tolerant query answering
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 …
ontology based data access. We propose a novel non-objection inference relation (along …