Hello Pat, (01)
On Fri, Nov 16, 2012 at 02:20:50PM -0800, Pat Hayes wrote:
> I wish this were true. Unfortunately, there are many users who either ask
> for, or worse simply *presume* decideability. So that if you give them a
> system which sometimes says "no answer", they will simply take this as the
> answer, "no". Which is one of Ian's arguments: whatever you give users,
> they will treat it as an oracle. (02)
Sounds like those users would also have a problem with "not deriveable", which
should also be a possible answer of decideable systems ? (03)
I am confused by the Wikipedia article about OWL: (04)
https://en.wikipedia.org/wiki/Web_Ontology_Language#OWL_DL (05)
It says that "OWL DL was designed to provide the maximum expressiveness
possible while retaining computational completeness (either phi or not phi
belong), decidability (there is an effective procedure to determine whether
phi is derivable or not)". (06)
The statement about computational completeness of OWL DL is wrong, isn't it ? (07)
OWL Full is undecidable but less expressive than FOL for reasons of
better computational complexity of reasoning ? (08)
Regards, (09)
Michael Brunnbauer (010)
--
++ Michael Brunnbauer
++ netEstate GmbH
++ Geisenhausener Straße 11a
++ 81379 München
++ Tel +49 89 32 19 77 80
++ Fax +49 89 32 19 77 89
++ E-Mail brunni@xxxxxxxxxxxx
++ http://www.netestate.de/
++
++ Sitz: München, HRB Nr.142452 (Handelsregister B München)
++ USt-IdNr. DE221033342
++ Geschäftsführer: Michael Brunnbauer, Franz Brunnbauer
++ Prokurist: Dipl. Kfm. (Univ.) Markus Hendel (011)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J (012)
|