W3C home > Mailing lists > Public > public-semweb-lifesci@w3.org > June 2008

Re: The Open world assumption shoe does not always fit - was: RE: [ontolog-forum] Fwd: Ontolog invited speaker session - Dr. Mark Greaves on the Halo Project - Thu 2008.06.19

From: John F. Sowa <sowa@bestweb.net>
Date: Fri, 27 Jun 2008 01:34:02 -0400
Message-ID: <48647BCA.20707@bestweb.net>
To: "[ontolog-forum]" <ontolog-forum@ontolog.cim3.net>
CC: welty@us.ibm.com, semantic_web@googlegroups.com, public-semweb-lifesci hcls <public-semweb-lifesci@w3.org>, semanticweb@yahoogroups.com

Folks,

I'd just like to summarize a few points, which reinforce the claim I
made earlier:  There is an open-ended number of different variations of
nonmonotonic logic, and it's impossible to adopt a one-size-fits-all
solution for nonmonotonic logic.

To paraphrase Tolstoy, every happy logic (i.e., classical) is happy
in the same way, but every unhappy logic (nonmonotonic) is unhappy
in its own way.

The solution I recommend is to treat all nonmonotonic operators
as metalevel predicates about some proposition or some proof.
In IKL (or any other logic that supports metalevel statements),
predicates such as is-provable(p), is-not-provable(p), is-default(p),
has-fuzzy-value(p,x), or probability-of(p,x), are metalevel
statements about some proposition p.

If you assume a closed world (such as a database of all airline
reservations or all employees), you can write metalevel axioms
saying that anything not provable is false.  If you have an open
world with incomplete information, you can write metalevel axioms
that say what to do about such cases.  If you have a mixed DB
with complete info about some things and incomplete info about
other things, you can write axioms to say what to do in each case.

Professional database administrators and authors who have studied
the issue for a long time (such as Chris Date), know how to
design and use DB systems in order to achieve predictable
results.  Many casual users manage to avoid trouble by using
a database as a convenient way of storing and accessing positive
data, and they assume that the "not" operator is shorthand for
"not found".

In short, a logic with a classical semantics, such as CL or IKL,
is an ideal foundation for defining the semantics of any and every
version of nonmonotonic logic that has ever been invented.

John
Received on Friday, 27 June 2008 05:34:36 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 18:00:52 GMT