W3C home > Mailing lists > Public > semantic-web@w3.org > October 2007

some problems of DL Reasoning

From: Jun Fang <leon.essence@gmail.com>
Date: Mon, 29 Oct 2007 17:46:38 +0800
Message-ID: <6869a86b0710290246o5e045e9fu4b0534d07ab61b36@mail.gmail.com>
To: semantic-web@w3.org
I am new to the Description Logics. I have met the following problem.

As we know, K |= C <==> ¬C unsatisfiable with K,
here K is a DL knowledge base, and C is a concept

If K is set to {A,B}, and C is set to ¬(A∧¬B), then ¬C is unsatisfiable with
it means K|=A subclassof B

using the similar way, we  can also get K|=B subclassof A,

I must be missing something obvious here. Can someone can tell me the reason

Thank you for any comments!

Best Regards!

Jun Fang - PhD candidate,
Control & Networks Institute,
College of Automation,
Northwestern Polytechnical University,
Xi'an, Shaanxi Province, China
Received on Monday, 29 October 2007 09:46:49 UTC

This archive was generated by hypermail 2.4.0 : Thursday, 24 March 2022 20:41:07 UTC