Using Description Logics for RDF Constraint Checking and Closed-World Recognition
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
Text
Patel-Schneider. "Using Description Logics for RDF Constraint Checking and Closed-World Recognition." AAAI Conference on Artificial Intelligence, 2015. doi:10.1609/AAAI.V29I1.9177Markdown
[Patel-Schneider. "Using Description Logics for RDF Constraint Checking and Closed-World Recognition." AAAI Conference on Artificial Intelligence, 2015.](https://mlanthology.org/aaai/2015/patelschneider2015aaai-using/) doi:10.1609/AAAI.V29I1.9177BibTeX
@inproceedings{patelschneider2015aaai-using,
title = {{Using Description Logics for RDF Constraint Checking and Closed-World Recognition}},
author = {Patel-Schneider, Peter F.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2015},
pages = {247-253},
doi = {10.1609/AAAI.V29I1.9177},
url = {https://mlanthology.org/aaai/2015/patelschneider2015aaai-using/}
}