Name
Abstract | ||
|---|---|---|
This paper investigates an extension of lightweight ontologies, encoded here in DL-Lite languages, to the product-based possibility theory framework. We first introduce the language (and its associated semantics) used for representing uncertainty in lightweight ontologies. We show that, contrarily to a min-based possibilistic DL-Lite, query answering in a product-based possibility theory is a hard task. We provide equivalent transformations between the problem of computing an inconsistency degree (the key notion in reasoning from a possibilistic DL-Lite knowledge base) and the weighted maximum 2-Horn SAT problem. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-42972-4_6 | SOFT METHODS FOR DATA SCIENCE |
Field | DocType | Volume |
Ontology (information science),Computer science,Sat problem,Possibility theory,Theoretical computer science,Knowledge base,Semantics | Conference | 456 |
ISSN | Citations | PageRank |
2194-5357 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Salem Benferhat | 1 | 2585 | 216.23 |
| Khaoula Boutouhami | 2 | 1 | 1.71 |
| Khellaf Faiza | 3 | 3 | 3.11 |
| Farid Nouioua | 4 | 131 | 15.10 |