Characterizing Non-Defeated Repairs in Inconsistent Lightweight Ontologies

In many applications, such as video processing, data are often provided by several and potentially conflicting sources having different reliability levels. This paper deals with the problem of handling inconsistency in lightweight ontologies when the set of assertions (facts) is prioritized. We propose a safe and efficient way to restore consistency using the concept of free assertions; assertions that are not involved in conflicts. Our approach allows the selection of one consistent assertional base, called a preferred repair. The last part of the paper contains an illustrative example using video data.