| Question asked
|
In section 5.3- SPARQL as a Rules Language … In section 5.3- SPARQL as a Rules Language- I am able to see how we could use the translation to datalog under ASP semantics as a rule language, but am having some difficulty in seeing SPARQL itself as a rule language. I can think of a rule base in SPARQL as a set of rules that have a graph pattern as their body and a construct statement in the head. Can you elaborate on what would be increase in complexity of such a language- especially when some kind of rule ordering would have to taken into account, and rules (therefore pattern matching) may have to be applied more than once? ng) may have to be applied more than once?
|