Using Description Logics for RDF Constraint Checking and Closed-World Recognition

11/15/2014
by   Peter F. Patel-Schneider, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset