Using Description Logics for RDF Constraint Checking and Closed-World Recognition
Artificial Intelligence
2015-01-23 v2
Abstract
RDF and Description Logics work in an open-world setting where absence of information is not information about absence. Nevertheless, Description Logic axioms can be interpreted in a closed-world setting and in this setting they can be used for both constraint checking and closed-world recognition against information sources. When the information sources are expressed in well-behaved RDF or RDFS (i.e., RDF graphs interpreted in the RDF or RDFS semantics) this constraint checking and closed-world recognition is simple to describe. Further this constraint checking can be implemented as SPARQL querying and thus effectively performed.
Cite
@article{arxiv.1411.4156,
title = {Using Description Logics for RDF Constraint Checking and Closed-World Recognition},
author = {Peter F. Patel-Schneider},
journal= {arXiv preprint arXiv:1411.4156},
year = {2015}
}
Comments
Extended version of a paper of the same name that will appear in AAAI-2015