We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute its so-called boundary, with respect to a given property. We show that axiom pinpointing is the most general instance of this problem. Finally, we present three applications of the problem of boundary computation.
Peñaloza, R. (2009). Reasoning with weighted ontologies. In Proceedings of the 2009 International Workshop on Description Logics (DL'09) (pp.1-12). CEUR.
Reasoning with weighted ontologies
Peñaloza, R
2009
Abstract
We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute its so-called boundary, with respect to a given property. We show that axiom pinpointing is the most general instance of this problem. Finally, we present three applications of the problem of boundary computation.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Pena-DL09.pdf
accesso aperto
Tipologia di allegato:
Submitted Version (Pre-print)
Dimensione
180 kB
Formato
Adobe PDF
|
180 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
