W3C home > Mailing lists > Public > semantic-web@w3.org > June 2012

sparql querying on property reified shortcut triples

From: Rob Stewart <robstewart57@gmail.com>
Date: Fri, 8 Jun 2012 12:34:34 +0100
Message-ID: <CA+ZOas+sJcjisPQrLR8y1RueeLe548eNGTvN9Efy4uTAwg7gNg@mail.gmail.com>
To: semantic-web@w3.org

I have a question regarding the inference of shortcut triples using
RDF property reification. It is a pragmatic one, on the software tools
that support rule based shortcut property inference.

I'm referring mainly to this page [1]. The N3 rule implementation
looks nice [2].

On this wiki page, there are no comment on actually how to run these
rules against reified RDF data.. specifically a list on the rule-based
engines that'd work well with the N3 example that you give.

Perhaps there is another wiki page elsewhere that describes in
practical terms how to run these rules against RDF.. or perhaps even
how to plug these rules into on-the-fly SPARQL querying of some kind.
It'd be excellent to have such a rules triggered by a SPARQL SELECT
query that matches on the triples where the shortcut property is

Could you perhaps comment on:
- Rule-based reasoning engines that'd run the rules shown at [2]?
- Software tools that simplify that process?
- The feasibility of plugging the rules in [2] into a SPARQL endpoint
for on-the-fly property shortcut reasoning?

[1] - http://www.w3.org/wiki/PropertyReificationVocabulary
[2] - http://www.w3.org/wiki/PropertyReificationVocabulary#Implementation


Rob Stewart
Received on Friday, 8 June 2012 15:38:58 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 19:48:37 UTC