Resolving Logical Contradictions in Description Logic Ontologies Based on Integer Linear Programming

Resolving Logical Contradictions in Description Logic Ontologies Based on Integer Linear Programming

When resolving logical contradictions in ontologies, Reiter's hitting set tree algorithm is often applied to satisfy the minimal change principle. To improve the efficiency, the researchers have proposed various algorithms by using a scoring function, defining new semantics or applying some heu...

Full description

Bibliographic Details
Main Authors: Qiu Ji, Khaoula Boutouhami, Guilin Qi
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Logical contradictions
inconsistency handling
ontology repair
semantic web
integer linear programming
Online Access:https://ieeexplore.ieee.org/document/8723478/

Internet

https://ieeexplore.ieee.org/document/8723478/

Similar Items