The basic principle of the Semantic Web carried by the RDF data model is that a collection of RDF statements coexist all together and are universally true. However some case study imply contextual relevancy and truth. The SPARQL query language is provided with patterns enabling to choose the RDF dataset against which a query is executed. This is a first step to handle contextual metadata. Based on it, we present in this paper a design pattern to handle contextual metadata hierarchically organized. This is done by means of a subStateOf property reifying RDF entailment between contextual graphs. The subStateOf relation is modelled within RDF and therefore context hierarchies can be described and queried by means of SPARQL queries. We propose a slight syntactic extension to SPARQL to facilitate the query of context hierarchies, together with rewriting rules to return to standard SPARQL.
[1]
John F. Sowa,et al.
Conceptual Structures: Information Processing in Mind and Machine
,
1983
.
[2]
Catherine Faron-Zucker,et al.
Searching the semantic Web: approximate query processing based on ontologies
,
2006,
IEEE Intelligent Systems.
[3]
Catherine Faron-Zucker,et al.
Implementation of SPARQL Query Language Based on Graph Homomorphism
,
2007,
ICCS.
[4]
Álvaro F. Moreira,et al.
Proving the Asymmetry Thesis Principles for a BDI Agent-Oriented Programming Language
,
2002,
Computational Logic in Multi-Agent Systems.
[5]
Sharon C. Salveter.
Review of Conceptual structures: information processing in mind and machine by John F. Sowa. Addison-Wesley 1984.
,
1986
.
[6]
Jeremy J. Carroll,et al.
Named graphs, provenance and trust
,
2005,
WWW '05.