Using Description Logics for RDF Constraint Checking and Closed-World Recognition
DOI:
https://doi.org/10.1609/aaai.v29i1.9177Keywords:
Semantic Web, RDF, RDFS, Description Logics, OWL, ConstraintsAbstract
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.