A Distance-Based Paraconsistent Semantics for DL-Lite
File version
Accepted Manuscript (AM)
Author(s)
Wang, Kewen
Wang, Zhe
Ma, Yue
Qi, Guilin
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Zhang, S
Wirsing, M
Zhang, Z
Date
Size
File type(s)
Location
License
Abstract
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.
Journal Title
Lecture Notes in Computer Science
Conference Title
Book Title
Edition
Volume
9403
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© 2015 Springer International Publishing AG. This is an electronic version of an article published in Lecture Notes In Computer Science (LNCS), volume 2015, pp 15-27, 2015. Lecture Notes In Computer Science (LNCS) is available online at: http://link.springer.com// with the open URL of your article.
Item Access Status
Note
Access the data
Related item(s)
Subject
Other information and computing sciences not elsewhere classified
Information and computing sciences