Algorithms for quantitative-based possibilistic lightweight ontologies

Abstract

This paper proposes approximate algorithms for computing inconsistency degree and answering instance checking queries in the framework of uncertain lightweight ontologies. We focus on an extension of lightweight ontologies, encoded here in DL-Lite languages, to the product-based possibility theory framework. We provide an encoding of the problem of computing inconsistency degree in product-based possibility DL-Lite as a weighted set cover problem and we use a greedy algorithm to compute an approximate value of the inconsistency degree. We also propose an approximate algorithm for answering instance checking queries in product-based possibilistic DL-Lite. Experimental studies show the good results obtained by both algorithms.