Trust Models for RDF Data: Semantics and Complexity
Abstract
Due to the openness and decentralization of the Web, mechanisms to represent and reason about the reliability of RDF data become essential. This paper embarks on a formal analysis of RDF data enriched with trust information by focusing on the characterization of its model-theoretic semantics and on the study of relevant reasoning problems. The impact of trust values on the computational complexity of well-known concepts related to the entailment of RDF graphs is studied. In particular, islands of tractability are identified for classes of acyclic and nearly-acyclic graphs. Moreover, an implementation of the framework and an experimental evaluation on real data are discussed.
Cite
Text
Fionda and Greco. "Trust Models for RDF Data: Semantics and Complexity." AAAI Conference on Artificial Intelligence, 2015. doi:10.1609/AAAI.V29I1.9169Markdown
[Fionda and Greco. "Trust Models for RDF Data: Semantics and Complexity." AAAI Conference on Artificial Intelligence, 2015.](https://mlanthology.org/aaai/2015/fionda2015aaai-trust/) doi:10.1609/AAAI.V29I1.9169BibTeX
@inproceedings{fionda2015aaai-trust,
title = {{Trust Models for RDF Data: Semantics and Complexity}},
author = {Fionda, Valeria and Greco, Gianluigi},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2015},
pages = {95-101},
doi = {10.1609/AAAI.V29I1.9169},
url = {https://mlanthology.org/aaai/2015/fionda2015aaai-trust/}
}