W3C home > Mailing lists > Public > public-owl-dev@w3.org > April to June 2007

Re: OWL reasoning in rules

From: Jeremy Carroll <jjc@hpl.hp.com>
Date: Tue, 29 May 2007 15:07:48 +0100
Message-ID: <465C33B4.9060502@hpl.hp.com>
To: Ulrike Sattler <sattler@cs.man.ac.uk>
CC: Matt Williams <matthew.williams@cancer.org.uk>, Ian Horrocks <horrocks@cs.man.ac.uk>, Owl Dev <public-owl-dev@w3.org>, Semantic Web <semantic-web@w3.org>, Bijan Parsia <bparsia@cs.man.ac.uk>



Ulrike Sattler wrote:
> It is not too difficult to see that we can construct an OWL ontology all 
> of whose models are infinite (let me know if you want  to see an example 
> of such an ontology), e.g., where each model contains an infinite chain 
> of fathers *in addition to the fathers that are explicitly present in 
> the ontology, 


Hmmm, I would like to see a small ontology which is necessarily infinite.

I've just being looking with google, and found my own
http://www.w3.org/TR/owl-test/dl-900-arith#description-logic-908

which I believe hinges on
    2*3*n = 5*n & n>0
     implies n >= aleph0,
but I am still trying to understand it.

thanks for a pointer

Jeremy



-- 
Hewlett-Packard Limited
registered Office: Cain Road, Bracknell, Berks RG12 1HN
Registered No: 690597 England
Received on Tuesday, 29 May 2007 14:08:31 GMT

This archive was generated by hypermail 2.3.1 : Wednesday, 27 March 2013 09:32:54 GMT