[Top] [All Lists]

Re: [ontolog-forum] The Open world assumption shoe does not always fit -

To: "[ontolog-forum]" <ontolog-forum@xxxxxxxxxxxxxxxx>
Cc: semanticweb@xxxxxxxxxxxxxxx, welty@xxxxxxxxxx, public-semweb-lifesci hcls <public-semweb-lifesci@xxxxxx>, semantic_web@xxxxxxxxxxxxxxxx
From: "John F. Sowa" <sowa@xxxxxxxxxxx>
Date: Fri, 27 Jun 2008 13:03:39 -0400
Message-id: <48651D6B.6050908@xxxxxxxxxxx>
Adrian and Toby,    (01)

Some comments:    (02)

TC> Date had it right.  NULL is neither true nor false.    (03)

Yes, and he made some recommendations that can be applied to
any logic-based notation.  One of them is to introduce special
constants or relations to handle various kinds of nonmonotonic
issues, and then write explicit code or axioms to process them
in an application-dependent way.    (04)

AW> If you move from SQL-like NAF reasoning, to full FOL with
 > closure statements at the meta level, you may also be moving from
 > low order polynomial computational complexity to exponential, or
 > even into the undecidable region.  A succinct paper on this issue
 > would be good to have.    (05)

The succinct paper is very short:  Any kind of reasoning that can
be done with a special-purpose logic can be done just as fast,
just as efficiently, and in exactly the same way when the special-
purpose notation is mapped to a more general notation.    (06)

To handle negation as failure, for example, you can design a
theorem prover that has NAF as an option.  Whenever it fails
to prove p, it checks the metalevel assertions to see if that
option is valid.  If so, it takes it.    (07)

There are also many cases where a metalevel reasoner can make
orders of magnitude *improvement* in performance at the object
level.  Among them are various kinds of compilers that reorganize
or specialize the axioms at the object level before proceeding
with the proof.    (08)

For example, the optimizers implemented in nearly all SQL DBs
optimize each query to minimize the number of DB accesses.
This creates a major improvement over the brute-force method
of processing a query in the order written.    (09)

For further discussion, see slide #26 of my talk on Common Logic,
which cites a paper by Bill Andersen et al., which I highly
recommend:    (010)

    Tutorial on Common Logic    (011)

TC> ... what is CL, where should I start to read on it.    (012)

CL is Common Logic, and you can start by reading the above tutorial
and the web pages cited in the final slide.    (013)

AW> Then, there's no way for the English documentation to get
 > separated from the logic, because authors and users deal only
 > with the executable English.  English explanations can also help
 > to document how the answers are arrived at.    (014)

I agree.  And as I have emphasized many times, I approve of your
version of executable English and the many versions of controlled
NLs.  There is an enormous amount of human factors work remaining
to be done with such notations.  The real competition is not
between executable vs. controlled English, but with some of the
hopelessly unreadable notations that have proliferated in the
last few years.    (015)

John    (016)

Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/  
Subscribe/Config: 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 Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx    (017)

<Prev in Thread] Current Thread [Next in Thread>