Re: Propositions

phayes@cs.uiuc.edu

Mail folder: Interlingua Mail
Next message: macgregor@ISI.EDU: "Propositions and Knowledge Interchange"
Previous message: sowa: "Re: Propositions"
In-reply-to: sowa: "Re: Propositions"

Message-id: <199402151618.AA05047@dante.cs.uiuc.edu>
X-Sender: phayes@dante.cs.uiuc.edu
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Tue, 15 Feb 1994 10:25:17 +0000
To: sowa <sowa@turing.pacss.binghamton.edu>, cg@cs.umn.edu,
        interlingua@ISI.EDU
From: phayes@cs.uiuc.edu
Subject: Re: Propositions

At  6:27 AM 2/15/94 -0500, sowa wrote:
>PS:  Actually, that procedure I defined in my previous note
>does not even depend on the predicate names and alphabetical order.
>The primary purpose of sorting is to eliminate duplicates and
>to ensure a unique normal form. .....

Why not define conjunctions to be finite sets of conjuncts? Then issues of
ordering and duplication just don't arise. Finite sets can be considered a
data type in computational discussions. 


Pat


----------------------------------------------------------------------------
Beckman Institute                                    (217)244 1616 office
405 North Mathews Avenue        	   (217)328 3947 or (415)855 9043 home
Urbana, IL. 61801                                    (217)244 8371 fax  	  

hayes@cs.stanford.edu  or Phayes@cs.uiuc.edu