Semantics of Constraints in RDFS.
Álvaro Cortés-Calabuig, Jan Paredaens · 2012
Abstract. We study constraints for RDF-Schema (RDFS) graphs. The syntax and semantics is defined for constraints in graphs that can contain RDFS properties and blank nodes. The proposal for constraint satisfaction closely resembles the possible world approach found in various contexts of incomplete databases and knowledge bases. Positive decidability results for checking satisfaction of RDFS constraints under blank nodes are given. In addition, we present deductive rules for different kinds of constraints and for several combination of them. Our approach resembles similar deductive rules of relational database contexts, but they are generalized and adapted to the RDFS data model using homomorphisms and embeddings. 1