Title: Message
Thanks Pei.  Post a link to your paper if possible. 
 
Do you think you lose anything when you go from a  "predicate logic" system to a "subject-copula-predicate"?
Specifically it seems like it would be difficult ( maybe impossible )to represent concepts of relevance and evidence as a acyclical graph.
 
Is this anything like the difference between axiom inference systems and natural deduction systems? 
 
-Daniel   

-----Original Message-----
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]] On Behalf Of Pei Wang
Sent: Monday, February 03, 2003 9:34 AM
To: [EMAIL PROTECTED]
Subject: [agi] KNOW

Hi,
 
The basic difference between KNOW and existing formal languages used for knowledge representation is that KNOW belongs to a "term logic", while the others belong to "predicate logic".  Atomic sentences in term logic have the format "subject-copula-predicate", while sentences in predicate logic have the format "predicate(arguments)".
 
These two types of language are not equivalent at the level of object-language.  The detailed comparison of the two is a long story. I'm working on a paper for it, and here is a brief summary:
 
The term logic framework as the following advantages over the predicate logic framework:
 \item Its syntactic structure is closer to that of a natural language.
 \item It is easier to represent various types of uncertainty in a uniform.
 \item The concept of evidence can be naturally defined.
 \item The inference rules are simple and natural.
 \item The inference rules guarantee the semantic relevance among premises and conclusions.
 \item Multiple types of non-deductive inference can be defined and justified in a unified manner.
 \item Inference process is unified with other processes, such as learning and categorization.
 
Pei
----- Original Message -----
Sent: Monday, February 03, 2003 9:07 AM
Subject: RE: [agi] An Artificial General Intelligence in the Making

For those of us who are following the KNOW thread, could somebody comment on the capabilities of KNOW beyond existing knowledge representation language such as the ARFF format for the popular WEKA system.
 
I've input data into such a system before and while existing systems have extensive grammar for representing logical relations they have very limited capabilities for more ambiguous  knowledge.
 
The KNOW document Ben posted a link too says:
 
"Syntax to semantics mapping in the natural language module, in which the final result should be represented in this language;"
 
This kind of capabilities would certainly be a huge advance over something like ARFF.  If anyone works with ARFF, could he or she comment on the possibilities of such translation with the ARFF grammar?  Does anyone who's familiar with the technical workings of knowledge representation language have any idea on how this kind of mapping could be accomplished? 
 
-Daniel


*************************************
 Daniel Colonnese
 Computer Science Dept. NCSU
 2718 Clark Street
 Raleigh NC 27670
 Voice: (919) 451-3141
 Fax: (775) 361-4495
 http://www4.ncsu.edu:8030/~dcolonn/
*************************************

-----Original Message-----
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]] On Behalf Of Gus Constan
Sent: Sunday, February 02, 2003 8:12 PM
To: [EMAIL PROTECTED]
Subject: RE: [agi] An Artificial General Intelligence in the Making

Hi Ben;
Would you kindly provide a valid url for Knowledge Representation for Inference
 
thanks
 
Gus
 
 

Reply via email to