It is well-known that crisp RDF is not suitable to represent vague information. Fuzzy RDF variants are emerging to overcome to this limitations. In this work we provide, under a very general semantics, a deductive system for a salient fragment of fuzzy RDF. We then also show how we may compute the top-k answers of the union of conjunctive queries in which answers may be scored by means of a scoring function.
A minimal deductive system for general fuzzy RDF
Straccia U
2009
Abstract
It is well-known that crisp RDF is not suitable to represent vague information. Fuzzy RDF variants are emerging to overcome to this limitations. In this work we provide, under a very general semantics, a deductive system for a salient fragment of fuzzy RDF. We then also show how we may compute the top-k answers of the union of conjunctive queries in which answers may be scored by means of a scoring function.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_161059-doc_131347.pdf
non disponibili
Descrizione: A minimal deductive system for general fuzzy RDF
Dimensione
244.29 kB
Formato
Adobe PDF
|
244.29 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
