Re: Higher-order KIF & Conceptual Graphs
sowa <sowa@turing.pacss.binghamton.edu>
Date: Fri, 21 Jan 94 20:27:55 EST
From: sowa <sowa@turing.pacss.binghamton.edu>
Message-id: <9401220127.AA09692@turing.pacss.binghamton.edu>
To: cg@cs.umn.edu, fritz@rodin.wustl.edu, interlingua@ISI.EDU,
phayes@cs.uiuc.edu
Subject: Re: Higher-order KIF & Conceptual Graphs
Fritz,
Please do not include me under the first-orderites. As I have been
trying to get across in message after message to these lists,
the approach of using metalevel reasoning together with sorted logic
gives us the ability to do the same kinds of things that are done
in higher-order logic with exactly the same semantics.
As Mike Genesereth pointed out, the only difference is whether you
specify up front the range of quantification; i.e. in the FOL case,
you specify the sets over which you permit quantifiers to range,
whereas in "true" HOL, you allow those sets to be implicit.
John