Re: results of untidy experiment

[...]

> 15:01:33 <DanC> yes, well, showing all the "no proof found" stuff is
likely
> to help folks understand.

the simplest example I can come up with is

==== aP
@prefix : <a#> .

:Maaike :age _:a"45" .
:Rita :age _:b"45" .
====

does not RDF-entail

==== aC
@prefix : <a#> .

:Maaike :age _:x .
:Rita :age _:x .
====


on the other hand either

==== a1P
@prefix : <a#> .

:Maaike :age :age"45" .
:Rita :age :age"45" .
====

or

==== a2P
@prefix : <a#> .

:Maaike "45" .
:Rita "45" .
====

or

==== a3P
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
@prefix : <a#> .

:Maaike :age _:a"45" .
:Rita :age _:b"45" .

:age rdfs:range xsd:int .
====

do (for the latter one we have (*))

-- ,
Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/

(*)
C:\temp>Euler a3P http://www.w3.org/2000/01/rdf-schema aC
# Generated with http://www.agfa.com/w3c/euler/#R31086 on 2002-09-28
10:16:07 AM
# for query file:/temp/aC.n3
# given file:/temp/a3P.n3 http://www.agfa.com/w3c/euler/rdfs-rules.n3

@prefix log: <http://www.w3.org/2000/10/swap/log#> .
@prefix ns: <http://www.agfa.com/w3c/euler/rdfs-rules#> .
@prefix : <a#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .

 {
  <http://www.agfa.com/w3c/euler/rdfs-rules#rule2b> .
  :Maaike :age ( _:a "45")} log:implies
{:Maaike :age ( xsd:int "45")}.
 {
  <http://www.agfa.com/w3c/euler/rdfs-rules#rule2b> .
  :Rita :age ( _:b "45")} log:implies
{:Rita :age ( xsd:int "45")}.


# Proof found for file:/temp/aC.n3 in 23 steps (2296 steps/sec) using 1
engine

Received on Saturday, 28 September 2002 06:20:43 UTC