- From: Jos De_Roo <jos.deroo.jd@belgium.agfa.com>
- Date: Sat, 10 Aug 2002 12:24:27 +0200
- To: "Smith, Michael K" <michael.smith@eds.com>
- Cc: Dan Connolly <connolly@w3.org>, Christopher Welty <welty@us.ibm.com>, www-webont-wg@w3.org
[...]
> As a technical note, I don't understand how Jos's example can work,
> since the default namespaces for the hypothesis and conclusion are
> different in the two files referenced. And therefore the
> fred#customer references in the two files are to different
> resources. Did I miss something?
I've left a trace to http://www.w3.org/2002/03owlt/dbC
at http://lists.w3.org/Archives/Public/www-archive/2002Aug/0007.html
some remarks:
1/ this is done with the .NET CSharp implementation of Euler
http://www.agfa.com/w3c/euler/Euler.cs and is very experimental
(same functionality as http://www.agfa.com/w3c/euler/Euler.java)
2/ the trace has some ToString() errors in it
3/ the first 2190 steps are a (forward chaining) "Prepare" to find
{?s <http://www.w3.org/2002/07/owl#equivalentTo> ?o} log:forSome ?s, ?o.
the rest is a (backward chaining) "Proof"
4/ the "@@ cycle (2)..." are the non-"Euler path" detections
Euler paths are explained at
http://mathforum.org/isaac/problems/bridges2.html
i.e. an Euler path is a continuous path that
passes through every *arc* once and only once
(to avoid vicious circles)
5/ namespace prefixes always stand for something
e.g.
@prefix db: <http://www.w3.org/2002/03owlt/db#> .
@prefix log: <http://www.w3.org/2000/10/swap/log#> .
@prefix math: <http://www.w3.org/2000/10/swap/math#> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix : <http://www.agfa.com/w3c/euler/owl-rules#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
@prefix ns: <http://www.agfa.com/w3c/euler/rdfs-rules#> .
@prefix fred: <http://www.w3.org/2002/03owlt/fred#> .
@prefix owl: <http://www.w3.org/2002/07/owl#> .
-- ,
Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
Received on Saturday, 10 August 2002 06:25:08 UTC