A Distance-based Paraconsistent Semantics for DL-Lite

01/09/2013
by   Xiaowang Zhang, et al.
0

DL-Lite is an important family of description logics. Recently, there is an increasing interest in handling inconsistency in DL-Lite as the constraint imposed by a TBox can be easily violated by assertions in ABox in DL-Lite. In this paper, we present a distance-based paraconsistent semantics based on the notion of feature in DL-Lite, which provides a novel way to rationally draw meaningful conclusions even from an inconsistent knowledge base. Finally, we investigate several important logical properties of this entailment relation based on the new semantics and show its promising advantages in non-monotonic reasoning for DL-Lite.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/10/2020

Defeasible reasoning in Description Logics: an overview on DL^N

DL^N is a recent approach that extends description logics with defeasibl...
research
06/16/2023

A connection method for a defeasible extension of 𝒜ℒ𝒞ℋ

This paper proposes a connection method à la Bibel for an exception-tole...
research
05/16/2014

Algorithm for Adapting Cases Represented in a Tractable Description Logic

Case-based reasoning (CBR) based on description logics (DLs) has gained ...
research
08/30/2018

Rule-based OWL Modeling with ROWLTab Protege Plugin

It has been argued that it is much easier to convey logical statements u...
research
08/11/2021

Approximating Defeasible Logics to Improve Scalability

Defeasible rules are used in providing computable representations of leg...
research
12/05/2019

Recursive algorithms to repair prioritized and inconsistent dl-lite knowledge base

The inconsistency in prioritized knowledge base is because the assertion...
research
08/27/2021

Geometric Models for (Temporally) Attributed Description Logics

In the search for knowledge graph embeddings that could capture ontologi...

Please sign up or login with your details

Forgot password? Click here to reset