W3C home > Mailing lists > Public > public-lod@w3.org > July 2009

Re: Alternatives to OWL for linked data?

From: Axel Rauschmayer <axel@rauschma.de>
Date: Mon, 27 Jul 2009 12:59:37 +0200
Cc: public-lod@w3.org
Message-Id: <AC120561-A100-4782-A01B-6F76370ED2FB@rauschma.de>
To: Ivan Herman <ivan@w3.org>
> You were asking about description logic programming; well, OWL 2 RL:
>
> http://www.w3.org/TR/owl2-profiles/#OWL_2_RL
>
> is exactly that: it is a manifestation of DLP. It has a Direct  
> Semantics
> 'side', compatible with OWL 2 DL, and a rule based 'side', described  
> by
> the rule set:
>
> http://www.w3.org/TR/owl2-profiles/#Reasoning_in_OWL_2_RL_and_RDF_Graphs_using_Rules
>
> This rule set can be used for a forward or backward chaining approach
> (or a combination thereof) that you describe. I have heard rumours
> and/or statements on implementations coming up from various vendors. I
> have, actually, a purely proof-of-concept-stupid-simple implementation
> doing brute force forward chaining:
>
> http://www.ivan-herman.net/Misc/2008/owlrl/
>
> Just to show what happens. And I am sure other implementations will  
> come
> to the fore that I do not yet about.


Cool stuff. How would backward chaining work? Would it be invoked via  
SPARQL? Is listing all properties of a given resource still possible?

Axel

-- 
Axel.Rauschmayer@ifi.lmu.de
http://www.pst.ifi.lmu.de/~rauschma/
Received on Monday, 27 July 2009 11:00:14 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 16:20:51 UTC