Algorithms for Quantitative-Based Possibilistic Lightweight Ontologies


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… (More)
DOI: 10.1007/978-3-319-42007-3_31


2 Figures and Tables

Cite this paper

@inproceedings{Benferhat2016AlgorithmsFQ, title={Algorithms for Quantitative-Based Possibilistic Lightweight Ontologies}, author={Salem Benferhat and Khaoula Boutouhami and Faiza Khellaf and Farid Nouioua}, booktitle={IEA/AIE}, year={2016} }