Handling Inconsistent Closed Predicates: A Paraconsistent Approach

Inconsistencies in real world knowledge bases are very common because the knowledge bases are usually authored at multiple places on the Web. These inconsistencies are even carried over to local closed world reasoning (LCWR) where the knowledge base consists of open world assumption (OWA) predicates (concepts or roles) and closed world assumption (CWA) predicates. When data from a relational database are migrated to a knowledge base (KB), the KB may become inconsistent. Consequently, querying becomes problematic in the KB as opposed to the database, where the database is consistent. In this paper, we present a paraconsistent reasoning (four-valued logic) method for LCWR over a knowledge base where CWA predicates are inconsistent. We consider ALC to prove our notion.