Re: Parallel standards projects for KIF and CGsmacgregor@ISI.EDU
Content-Type: text/plain; charset="us-ascii"
Date: Thu, 28 Apr 1994 16:04:37 -0800
Subject: Re: Parallel standards projects for KIF and CGs
> 3. We discussed the check-in/check-out problem; i.e., since KIF
> and CGs are highly expressive, it is easy to map something into
> KIF or CGs, but there is no guarantee that the result will be
> mappable back into other languages that are less expressive.
This is NOT what many or most of us mean by the "check-in/check-out
problem". The problem with KIF is that it is not expressive enough
^^^ ^^^^^^^^^^ ^^^^^^
to guarantee that one can check out.
For example, until the distinction between analytic and non-analytic
was added to KIF, KL-ONE family systems couldn't check out.
Without adding types, a logic that distinguishes between types and
unary relations cannot check out (apparently this is now fixed, or
Presumably we will hit the same block on the notion of Proposition
(but apparently we have 5 years in which to fight that battle).
Expressing proposition using quotation does not solve the problem.
Robert M. MacGregor firstname.lastname@example.org
USC/ISI, 4676 Admiralty Way, Marina del Rey, CA 90292 (310) 822-1511