W3C home > Mailing lists > Public > www-rdf-interest@w3.org > November 2000

looking at description logics

From: Jos De Roo <jdroo@roam.agfa.be>
Date: Sun, 26 Nov 2000 21:40:42 +0100
Message-Id: <200011262039.PAA13985@tux.w3.org>
To: <www-rdf-interest@w3.org>
While looking at description logics we found lots of Euler circuits ...

Example 1: person subsumes parent

  person(X):- parent(X).

  parent(X):- person(X), has-child(X,Y), person(Y).

Example 2: animal AND biped subsumes human

  animal(X):- human(X).

  biped(X):- human(X).

  human(X):- animal(X), biped(X), ...

Example 3: human AND female defines woman

  human(X):- woman(X).

  female(X):- woman(X).

  woman(X):- human(X), female(X).

Example 4: conceptC equiv conceptD

  conceptC(X):- conceptC(X).

  conceptD(X):- conceptC(X).

If for example 4 we also assert conceptD("a") and conceptC("b")

so that we have http://www.agfa.com/w3c/euler/equiv.axiom.rdf

then conceptC("a") http://www.agfa.com/w3c/euler/equiv.lemma.rdf

is proved non-empty at http://www.agfa.com/w3c/euler/equiv.proof.rdf

If we indeed have Euler circuit detection to stop looping around,

then http://www.agfa.com/w3c/euler/ is working for such examples.

Are there any issues that we should think about?

--

Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
Received on Sunday, 26 November 2000 15:39:21 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:51:47 GMT