W3C home > Mailing lists > Public > public-webont-comments@w3.org > August 2003

soundness, completeness and decidability proofs

From: Christoph Mangold <Mangold@informatik.uni-stuttgart.de>
Date: Wed, 27 Aug 2003 13:20:00 +0200 (MEST)
To: public-webont-comments@w3.org
Cc: copy <mangold@informatik.uni-stuttgart.de>
Message-ID: <Pine.GSO.4.56.0308271201150.1690@assun99.informatik.uni-stuttgart.de>


I am new to the owl subject and I don't know if this is the appropriate
place to ask my question.

As far as I understand, OWL DL is the part of OWL that enables a sound and
complete inference calculus and where the entailment of statements is
decidable. I just couldn't find any proofs for these properties of OWL DL.
Can anyone give me directions?


Christoph Mangold
Received on Thursday, 28 August 2003 03:28:19 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 20:09:29 UTC