- From: Michael Schneider <schneid@fzi.de>
- Date: Fri, 20 Mar 2009 17:59:46 +0100
- To: Reto Bachmann-Gmür <reto.bachmann@trialox.org>
- Cc: "Semantic Web" <semantic-web@w3.org>, "Bijan Parsia" <bparsia@cs.man.ac.uk>
- Message-ID: <0EF30CAA69519C4CB91D01481AEA06A0011D9B09@judith.fzi.de>
>-----Original Message-----
>From: semantic-web-request@w3.org [mailto:semantic-web-request@w3.org]
>On Behalf Of Reto Bachmann-Gmür
>The example 2 violates what's the convention described by RDF semantics,
>however I see no way to add tbox statements with the (current)
>expressivitiy of OWL that would contradict this graph.
Me neither.
[...]
>> (2) Lists should not be cyclic, though this is possible with RDF lists:
>>
>> A -> B
>> ^ |
>> | v
>> D <- C
Try to express such a general cycle prohibition axiom! This would roughly
need to say something like:
For any non-negative integer n:
there must not be nodes x1,...,xn
such that
x1 rdf:rest x2
x2 rdf:rest x3
...
xn rdf:rest x1
If the cycle size would be restricted, one could express this by a finite
set of axioms (I'm not necessarily talking about OWL here). But the cycles
may be arbitrarily large, so this is not possible.
Michael
--
Dipl.-Inform. Michael Schneider
Research Scientist, Dept. Information Process Engineering (IPE)
Tel : +49-721-9654-726
Fax : +49-721-9654-727
Email: michael.schneider@fzi.de
WWW : http://www.fzi.de/michael.schneider
=======================================================================
FZI Forschungszentrum Informatik an der Universität Karlsruhe
Haid-und-Neu-Str. 10-14, D-76131 Karlsruhe
Tel.: +49-721-9654-0, Fax: +49-721-9654-959
Stiftung des bürgerlichen Rechts, Az 14-0563.1, RP Karlsruhe
Vorstand: Prof. Dr.-Ing. Rüdiger Dillmann, Dipl. Wi.-Ing. Michael Flor,
Prof. Dr. Dr. h.c. Wolffried Stucky, Prof. Dr. Rudi Studer
Vorsitzender des Kuratoriums: Ministerialdirigent Günther Leßnerkraus
=======================================================================
Received on Friday, 20 March 2009 17:00:27 UTC