Named graphs, provenance and trust
WWW '05 Proceedings of the 14th international conference on World Wide Web
From SPARQL to rules (and back)
Proceedings of the 16th international conference on World Wide Web
Minimal Deductive Systems for RDF
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
Logical foundations of (e)RDF(S): complexity and reasoning
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Semantics and complexity of SPARQL
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Hi-index | 0.00 |
We provide an agent the capability to infer the relations (assertions) entailed by the rules that describe the formal semantics of an RDFS knowledge-base. The proposed inferencing process formulates each semantic restriction as a rule implemented within a SPARQL query statement. The process expands the original RDF graph into a fuller graph that explicitly captures the rule's described semantics. The approach is currently being explored in order to support descriptions that follow the generic Semantic Web Rule Language. An experiment, using the Fire-Brigade domain, a small-scale knowledge-base, is adopted to illustrate the agent modeling method and the inferencing process.