Integrity Constraints for Linked Data

Linked Data makes one central addition to the Semantic Web principles: all entity URIs should be dereferenceable to provide an authoritative RDF representation. URIs in a linked dataset can be partitioned into the exported URIs for which the dataset is authoritative versus the imported URIs the dataset is linking against. This partitioning has an impact on integrity constraints, as a Closed World Assumption applies to the exported URIs, while a Open World Assumption applies to the imported URIs. We provide a definition of integrity constraint satisfaction in the presence of partitioning, and show that it leads to a formal interpretation of dependency graphs which describe the hyperlinking relations between datasets. We prove that datasets with integrity constraints form a symmetric monoidal category, from which the soundness of acyclic dependency graphs follows.

• Type: Journal
• Year: 2011
• Where: DLOG
• Authors: Alan Jeffrey, Peter F. Patel-Schneider
• Keywords: Automated Reasoning, Constraint Satisfaction, DLOG 2011, Integrity Constraint, Integrity Constraints