[Top] [All Lists]

Re: [ontolog-forum] CLIF as a sorted logic?

To: "[ontolog-forum] " <ontolog-forum@xxxxxxxxxxxxxxxx>
From: Christopher Menzel <cmenzel@xxxxxxxx>
Date: Thu, 5 Aug 2010 11:47:15 +0200
Message-id: <37E8C65E-47E3-4E0A-9C60-D853499340DE@xxxxxxxx>
On Aug 3, 2010, at 5:29 PM, Obrst, Leo J. wrote:
> John, Chris,
> Is this the same as guarded quantification?     (01)

It's sort of a limiting case.  The term "guarded quantification" is usually 
used in the context of rather advanced studies in modal logic, finite model 
theory, etc where the issue of complexity vs expressibility comes to the fore.  
The idea in these contexts is typically to add guarded quantifiers to some 
fragment of first-order logic (yielding a so-called "guarded fragment" of FOL) 
and explore its computational and model theoretic properties.  In the 
definition of typed quantification that I gave, I put no restrictions on the 
formulas that can serve as the "guard" F in a guarded quantifier.  In the study 
of guarded fragments, the complexity of the guard F is highly relevant.  In 
some contexts, for example, the guards might be restricted to atomic formulas.    (02)

There has been a great deal of research recently on guarded fragments in the 
study of modal logic (which, recall, can be represented as fragments of FOL), 
which has made them quite relevant to the study of OWL (as OWL can itself be 
represented as a modal logic).    (03)

Pat did some work on guarded fragments a while ago and might be able to add 
more here.    (04)

-chris    (05)

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
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx    (06)

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