A Distance-Based Paraconsistent Semantics for DL-Lite | Zendy

Xiaowang Zhang | Zendy; Kewen Wang | Zendy; Zhe Wang | Zendy; Yue Ma | Zendy; Guilin Qi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Distance-Based Paraconsistent Semantics for DL-Lite

Author(s) -

Xiaowang Zhang,

Kewen Wang,

Zhe Wang,

Yue Ma,

Guilin Qi

Publication year - 2015

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/978-3-319-25159-2_2

Subject(s) - computer science , semantics (computer science) , logical consequence , paraconsistent logic , description logic , constraint (computer aided design) , theoretical computer science , relation (database) , feature (linguistics) , circumscription , fragment (logic) , programming language , non monotonic logic , artificial intelligence , data mining , mathematics , higher order logic , linguistics , philosophy , geometry

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research