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

arXiv: https://arxiv.org/abs/1411.4156 · HTML: https://mlsanity.com/paper/1411.4156/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Nov 2014.

## Built on by (most cited first, 1 of 1)

- [Leveraging Wikidata's edit history in knowledge graph refinement tasks](https://mlsanity.com/paper/2210.15495/) (2022)

## Abstract (arXiv)

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.