Current State of the Noun Definition Algorithm and Associated
Demonstrations
Scott Napieralski
stn2@cse.buffalo.edu
May 1, 2003
Abstract
This document describes work on the Contextual Vocabulary Acquisition project that was conducted
during the Spring 2003 semester under the supervision of Dr. William Rapaport. The majority of the
work during this semester was focused on updating, improving and annotating the various demonstration
programs that were originally created by Karen Ehrlich. These changes will be described in detail. In
addition, a short examination of the verb algorithm was performed. This work will also be described.
1
Introduction
The work described in this paper was performed as part of the Contextual Vocabulary Acquisition project.
Researchers from the University at Buffalo Departments of Computer Science & Engineering and Learning
& Instruction are cooperating to develop a greater understanding of the human process of learning new
vocabulary from context clues. In order to improve our understanding and test our theories, we have made
use of a computational algorithm that attempts to model the human process of defining an unknown noun
based on context.
The noun definition algorithm implements a theory of how an unknown word can be learned based on
the passages of text in which the unknown word occurs. The information that is contained in a passage is
first encoded as a SNePS network [Shapiro 1999]. Then, when asked to provide a definition for the unknown
word the algorithm searches the SNePS network for certain types of information. When all the relevant
information in the network has been found, the algorithm reports it as a definition for the unknown word.
1
The major goal of the research performed this semester was to complete work on the demonstration
programs that was begun during the previous semester [Napieralski 2002B]. There are several demonstration
programs derived from Karen Ehrlich’s dissertation [Ehrlich 1995] that illustrate the various capabilities of
the noun algorithm. In order to similarly demonstrate the capabilities of the improved noun definition
algorithm [Napieralski 2002A], these programs required some updates and modifications. Specifically the
“brachet”, “cat”, and “hackney” demos have each been updated, so that they generate definitions that are
at least as complete as the definitions created by the original demos in combination with Ehrlich’s original
noun definition algorithm [Ehrlich 1995].
2
Changes to the Demos
The first task undertaken this semester was to complete the work on the “brachet” demo that was left
incomplete after the fall semester. This consisted of thoroughly annotating the demo and changing the order
in which the information was entered. Previously, the information in the background knowledge file had
been in nearly random order. In the updated file, semantically similar facts and rules are grouped together.
This does not have any effect on SNePS or the algorithm, but it does make the file easier for a human to read
and understand. The completed demo was then sent to Fran Johnson to be included in the set of standard
SNePS demonstrations.
The next task was to examine the “cat” demo and attempt to update it so that it would produce a
definition that was at least as good at the definition given by Ehrlich’s original demonstration. The major
problem with this demo was the difficulty of inferring that cats are mammals after we learn that Pyewacket
bears kittens. At this point in the demonstration, we know that Pyewacket is a mammal and Pyewacket is
a cat and we want to infer that cats are mammals. In order to make this inference, a new rule (figure 1)
was developed (with the help of Dr. Shapiro). The rule is as follows: if X is a member of some class Y and
X is a member of some class Z and Y is an unknown word and Z is not (known to be) a subclass of Y, then
presumably Y is a subclass of Z. In order to make the part of the rule that says “Z is not (known to be)
a subclass of Y” work we used SNeRE, the SNePS Rational Engine [Shapiro 1999]. Although this makes
2
Figure 1: This rule allows us to infer that cats are mammals.
for a more complicated rule, it does not change the way that the demo is invoked or used. In addition, to
prevent degenerate situations where SNePS could infer that X is a subclass of Y and Y is a subclass of X,
we added the antecedent that says “Y is an unknown word”. By marking the target word as unknown, we
are modeling the cognitive agent’s awareness that it does has encountered and unknown word and that it is
trying to compute a definition. In order to trigger this antecedent, it was necessary to add some information
to the demonstration. At the beginning of the demo, “cat” is now explicitly marked as a unknown word.
This marking is accomplished by using the “object-property” case frame [Shapiro 1996] where “cat” is the
object and its property “unknown”.
The final noun demo that has been modified is the “hackney” demo. This demo required the fewest
modifications, it immediately provided the same definition using the new noun definition algorithm that it
had provided using Ehrlich’s original noun definition algorithm. Unlike the other demos, changes that were
made to this demo were designed to exploit some information that the original demo had not picked up,
rather than to fix errors or incomplete definitions.
Early in the demo we learn that King Arthur gets on a hackney, then a short time later we learn that
he has jumped off of a horse. Based on this sequence of events, we believed the system should conclude
that hackneys are horses. In order to achieve this goal, the following rules were added to the background
knowledge.
The first rule states that if X leaps onto Y and sometime later X leaps off of Z then Y and
Z are equivalent. The second rule says that if two individuals are equivalent and they are each a member
3
Figure 2: If something leaps onto Y and then leaps off of Z, Y and Z are equivalent.
Figure 3: This rule allows us to infer that cats are mammals.
of some class where the class is unknown, then the unknown class is a subclass of the known class. The
latter rule requires that “hackney” be marked as an unknown word, just as “cat” was previously marked as
“unknown”.
Unfortunately, these rules did not provide the results we were seeking without further modification of
the demo. When the system was told that King Arthur got off of a horse (using the “add” command)
[Shapiro 1999] the forward inference procedure failed to conclude that the thing King Arthur got on and
the thing that he got off of were equivalent. In order to get the system to infer this information, it was
necessary to issue the “clear-infer” [Shapiro 1999] command immediately before adding the knowledge that
King Arthur jumped off a horse. With the addition of a “clear-infer” the system was able to infer the
necessary information.
Currently, the algorithm correctly reports that a hackney is a type of horse, but it does not report this
information as quickly as expected. After we learn that King Arthur jumped off a horse, horse only appears
in the definition as a possible class inclusion. The algorithm does not report the fact that a hackney is
4
definitely a type of horse until it is asked to provide a definition three more times. At the conclusion of my
work this semester, the reason for this behavior is still unknown. I suspect that it might be caused when
“deduce” commands [Shapiro 1999] embedded in the algorithm find the information at a later time, but I
cannot be sure. The next researcher to work on this project should investigate this matter, both to resolve
the problem and as an excellent way to familiarize himself/herself with the noun algorithm.
3
The Verb Algorithm
The other major task that I performed this semester was an examination of the verb algorithm that was
created during the summer of 2002 by Justin Del Vecchio [Del Vecchio 2002]. Unfortunately, the spring
semester came to a close before I could complete a detailed examination of how the algorithm operates and
compare it to Ehrlich’s original verb definition algorithm [Ehrlich 1995].
During the relatively short period of time that I did work on the verb algorithm, several changes were
made. In order to get the verb algorithm to correctly run on the UB CSE systems under ACL 6.2, several
minor modifications were necessary. These changes were all syntactic in nature, such as adding empty
argument lists to functions that take no arguments. The only other change to the Del Vecchio’s verb
algorithm was that the trace level argument to the main function (defineVerb) was made optional, with the
default set to no tracing.
In order to test the verb algorithm, it was necessary to create a demonstration program for a verb. I
chose to recreate the “joust” demo described in Ehrlich’s dissertation [Ehrlich 1995]. In recreating this demo,
I attempted to follow Ehrlich’s demonstration as closely as possible. Despite this fact, several changes to
the “joust” demo were made, but they all were minor changes. Specifically, the case frames were changed
to conform to the set of case frames expected by the most recent versions of the noun and verb definition
algorithms. The “joust” demo was tested using both the noun and verb algorithms, but there was no time
for a detailed examination of this demo so no major changes to the demo were performed.
5
4
Future Work
The immediate next step for my successor should be to investigate the strange behavior of the “hackney”
demo that is described above. Specifically, the next researcher should attempt to determine why using “clearinfer” produces better results and why the algorithm only reports “horse” as a superclass of “hackney” after
the third request for a definition.
Another issue that the next researcher may wish to investigate is the possibility of merging all the
background knowledge files. Currently, each demonstration program has its own set of background knowledge
(contained in files with the extension “.base”). Ehrlich’s original intent was to have a single set of background
knowledge that was used for all of the demos. Fortunately, all of the background files are fairly similar. It
should be possible to merge them into a single file containing all the knowledge that is common to each of
the background files plus all the background information that is unique to each demo. However, if such a
merger is attempted, a thorough examination of each of the demos will be required to insure that the change
has had no unexpected effects. If my experience working on this project has taught me anything, it is that
even the most seemingly benign changes can wreak havoc in a complex system such as SNePS.
Once work on the noun demonstrations has been successfully completed, the researcher should investigate
the verb algorithms, both Del Vecchio’s version and Ehrlich’s version. Neither of these algorithms has been
nearly as well researched and implemented as the noun definition algorithm. In the future, significant effort
should be devoted to creating a verb definition algorithm that is at least as complete as the noun definition
algorithm. After the next investigator has developed a thorough understand of the verb algorithms by
examining them and attempting to develop new demos for them, a longer term goal should be to improve
Del Vecchio’s algorithm. This can probably accomplished by incorporating some of Ehrlich’s old ideas and
implementing some new techniques.
References
[Del Vecchio 2002] Del Vecchio, J. (2002), “Summer Research - 2002 - Verb
[http://www.cse.buffalo.edu/ jmdv/summer2002-verbalgorithm-jmdv/].
6
Algorithm”,
[Ehrlich 1995]
Ehrlich, K. (1995), “Automatic Vocabulary Expansion through Narrative Context”,
SUNY Buffalo Computer Science Technical Report 95-09.
[Napieralski 2002A] Napieralski,
S.
(2002),
“An
Enhanced
Noun
Definition
[http://www.cse.buffalo.edu/ stn2/cva/summer02/summer-report.pdf].
Algorithm”
[Napieralski 2002B] Napieralski, S. (2002), “Progress of the Noun Definition Algorithm During the Fall 2002
Semester”, [http://www.cse.buffalo.edu/ stn2/cva/fall02/reportFall02.pdf].
[Shapiro 1996]
Shapiro, S., et. al. (1996). “A Dictionary of SNePS
[http://www.cse.buffalo.edu/sneps/Manuals/dictionary.pdf].
[Shapiro 1999]
Shapiro,
S.
(1999),
“SNePS
2.5
[http://www.cse.buffalo.edu/sneps/Manuals/manual25.ps].
A
Case
User’s
The Noun Algorithm
( in−package : s n e p s u l )
( defvar ∗ dmode ∗ n i l
” I n d i c t a t e s whether a l g o r i t h m s h o u l d o p e r a t e i n d e f i n i t i o n mode ( t ) which
u s e s E h r l i c h ’ s l o g i c t o d e c i d e which i n f o r m a t i o n s h o u l d be r e p o r t e d and
which i n f o m a t i o n s h o u l d be i g n o r e d , or t e a c h i n g mode ( n i l ) which r e p o r t s
a l l i n f o r m a t i o n t h a t can be found . ” )
( defstruct n d e f n
”A s t r u c t u r e t o s t o r e and r e p o r t d e f i n i t i o n s o f nouns ”
noun
classInclusions
probableClassInclusions
possibleClassInclusions
structuralElements
probableStructuralElements
possibleStructuralElements
actions
probableActions
possibleActions
properties
probableProperties
possibleProperties
owners
synonyms
possibleSynonyms
agents
spatial
namedIndividuals )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : defineNoun
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun defineNoun ( noun & o p t i o n a l ( l e x i c o g r a p h i c M o d e t ) ( t r a c e L e v e l − 1 ) )
” G e n e r a t e s a d e f i n i t i o n f o r ’ noun ’ . I f t h e o p t i o n a l argument
l e x i c o g r a p h i c M o d e i s t then E h r l i c h ’ s t h e o r y w i l l be used t o e x c l u d e
some i n f o r m a t i o n from t h e d e f i n i t i o n , e l s e a l l i n f o w i l l be r e p o r t e d .
I f t h e o p t i o n a l argument t r a c e L e v e l i s s p e c i f i e d t r a c i n g / debugging w i l l
be e n a b l e d . The values o f t r a c e L e v e l a r e 0−4 where 0 means no
7
Frames”
Manual”
t r a c i n g and 4 means trace a l l f u n c t i o n s . ”
; ; t h e d e f a u l t f o r t r a c e L e v e l i s −1 s o t h a t any t r a c i n g s e t up manually
; ; by t h e u s e r w i l l not be o v e r r i d d e n by t h e program when t h e o p t i o n a l
; ; argument t r a c e L e v e l i s not s p e c i f i e d .
( setTraceLevel traceLevel )
( s e t q ∗ dmode ∗ l e x i c o g r a p h i c M o d e )
; ; g e t t h e r e q u e s t e d d e f i n i t i o n and p r i n t i t i n human r e a d a b l e for mat .
( prettyPrintDef ( i f lexicographicMode
( d e f i n e N o u n L e x i c o g r a p h i c noun )
( d e f in e N o u n T e ac hing noun ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : defineNounLexicographic
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun d e f i n e N o u n L e x i c o g r a p h i c ( noun )
”Makes a l i s t o f i n f o r m a t i o n t h a t i s known about t h e noun and r e p o r t s o n l y
t h e i n f o r m a t i o n t h a t i s deemed r e l e v a n t a c c o r d i n g t o E h r l i c h ’ s t h e o r y . ”
( let ( d e f i n i t i o n )
; ; get a l l the i n f o
( s e t f d e f i n i t i o n ( d e f i n e N o u n T e a ch in g noun ) )
; ; Now examine a l l t h e i n f o and e l i m i n a t e p a r t s t h a t E h r l i c h ’ s t h e o r y
; ; says are unnecessary .
; ; i f t h e r e a r e c l a s s i n c l u s i o n s , don ’ t r e p o r t p r o b a b l e c l a s s i n c l u s i o n s
( i f ( ndefn−classInclusions definition )
( or ( s e t f ( n d e f n − p r o b a b l e C l a s s I n c l u s i o n s d e f i n i t i o n ) n i l )
( setf ( ndefn−possibleClassInclusions d e f i n i t i o n ) n i l )))
; ; i f t h e r e a r e p r o b a b l e c l a s s i n c l u s i o n s , don ’ t r e p o r t p o s s i b l e
;;
class inclusions
( i f ( ndefn−probableClassInclusions d e f i n i t i o n )
( setf ( ndefn−possibleClassInclusions d e f i n i t i o n ) n i l ))
; ; i f t h e r e a r e s t r u c t u r a l e l e m e n t s don ’ t r e p o r t p r o b a b l e o r p o s s i b l e
;;
s t r u c t . elems .
( i f ( ndefn−structuralElements d e f i n i t i o n )
; ; u s i n g ” o r ” i s j u s t a way t o make s u r e t h a t both s e t f s t a t e m e n t s
;;
get evaluated
( or ( s e t f ( n d e f n − p r o b a b l e S t r u c t u r a l E l e m e n t s d e f i n i t i o n ) n i l )
( setf ( ndefn−possibleStructuralElements d e f i n i t i o n ) n i l )))
; ; i f t h e r e a r e p r o b a b l e s t r u c t u r a l e l e m e n t s don ’ t r e p o r t p o s s i b l e
;;
s t r u c t u r a l elements
( i f ( ndefn−probableStructuralElements d e f i n i t i o n )
( setf ( ndefn−possibleStructuralElements d e f i n i t i o n ) n i l ))
; ; i f t h e r e a r e a c t i o n s don ’ t r e p o r t p r o b a b l e o r p o s s i b l e a c t i o n s
( i f ( ndefn−actions d e f i n i t i o n )
( or ( s e t f ( n d e f n − p r o b a b l e A c t i o n s d e f i n i t i o n ) n i l )
( setf ( ndefn−possibleActions d e f i n i t i o n ) n i l )) )
; ; i f t h e r e a r e p r o b a b l e a c t i o n s don ’ t r e p o r t p o s s i b l e a c t i o n s
( i f ( ndefn−probableActions d e f i n i t i o n )
( setf ( ndefn−possibleActions d e f i n i t i o n ) n i l ))
; ; i f t h e r e a r e any type o f a c t i o n s , don ’ t r e p o r t a g e n t s
( i f ( or ( n d e f n − a c t i o n s d e f i n i t i o n )
( ndefn−probableActions d e f i n i t i o n )
( ndefn−possibleActions d e f i n i t i o n ))
( s e t f ( ndefn−agents d e f i n i t i o n ) n i l ) )
; ; i f t h e r e a r e p r o p e r t i e s , don ’ t r e p o r t p r o b a b l e o r p o s s i b l e p r o p e r t i e s
( i f ( ndefn−properties d e f i n i t i o n )
8
( or ( s e t f ( n d e f n − p r o b a b l e P r o p e r t i e s d e f i n i t i o n ) n i l )
( setf ( ndefn−possibleProperties d e f i n i t i o n ) n i l )))
; ; i f t h e r e a r e p r o b a b l e p r o p e r t i e s , don ’ t r e p o r t p o s s i b l e p r o p e r t i e s
( i f ( ndefn−probableProperties d e f i n i t i o n )
( setf ( ndefn−possibleProperties d e f i n i t i o n ) n i l ))
; ; i f there are c l a s s i n c l u s i o n s or probable c l a s s i n c l u s i o n s ,
;;
don ’ t r e p o r t named i n d i v i d u a l s
( i f ( or ( n d e f n − c l a s s I n c l u s i o n s d e f i n i t i o n )
( ndefn−probableClassInclusions d e f i n i t i o n ))
( setf ( ndefn−namedIndividuals d e f i n i t i o n ) n i l ) )
; ; now r e t u r n t h e r e v i s e d d e f i n i t i o n
definition
))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : d e f in eN o u n T ea ch i ng
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun d e fin e N o u n T e a c h i n g ( noun )
”Makes a l i s t o f a l l i n f o r m a t i o n t h a t i s known about t h e noun .
This i n f o r m a t i o n makes up t h e d e f i n i t i o n . ”
( let ( d e f i n i t i o n )
; ; g e t a new i n s t a n c e o f t h e s t r u c t u r e nde fn
( s e t f d e f i n i t i o n ( make−ndefn ) )
; ; populate the f i e l d s of the d e f i n i t i o n s t r u c t u r e
; ; t h e noun i t s e l f
( s e t f ( ndefn−noun d e f i n i t i o n ) noun )
; ; class inclusions
( s e t f ( n d e f n − c l a s s I n c l u s i o n s d e f i n i t i o n ) ( f i n d C l a s s I n c l u s i o n s noun ) )
; ; p r o b a b l e ( with ’ mode presumably ’ ) c l a s s i n c l u s i o n s
( setf ( ndefn−probableClassInclusions d e f i n i t i o n )
( f i n d P r o b a b l e C l a s s I n c l u s i o n s noun ) )
; ; possible class inclusions
( setf ( ndefn−possibleClassInclusions d e f i n i t i o n )
( classFilter
( f i n d P o s s i b l e C l a s s I n c l u s i o n s noun
( append ( n d e f n − c l a s s I n c l u s i o n s d e f i n i t i o n )
( ndefn−probableClassInclusions d e f i n i t i o n )))
noun ) )
; ; structure
( s e t f ( n d e f n − s t r u c t u r a l E l e m e n t s d e f i n i t i o n ) ( f i n d S t r u c t u r e noun ) )
; ; probable structure
( setf ( ndefn−probableStructuralElements d e f i n i t i o n )
( f i n d P r o b a b l e S t r u c t u r e noun ) )
; ; possible structure
( setf ( ndefn−possibleStructuralElements d e f i n i t i o n )
( f i n d P o s s i b l e S t r u c t u r e noun ( n d e f n − c l a s s I n c l u s i o n s d e f i n i t i o n ) ) )
; ; properties
( s e t f ( n d e f n − p r o p e r t i e s d e f i n i t i o n ) ( f i n d P r o p e r t i e s noun ) )
; ; probable p r o p e r t i e s
( s e t f ( n d e f n − p r o b a b l e P r o p e r t i e s d e f i n i t i o n ) ( f i n d P r o b a b l e P r o p e r t i e s noun ) )
; ; possible properties
( s e t f ( n d e f n − p o s s i b l e P r o p e r t i e s d e f i n i t i o n ) ( f i n d P o s s i b l e P r o p e r t i e s noun ) )
; ; owners
( s e t f ( ndefn−owners d e f i n i t i o n ) ( findOwners noun ) )
; ; s p at ia l information
9
( s e t f ( n d e f n − s p a t i a l d e f i n i t i o n ) ( f i n d S p a t i a l noun ) )
; ; synonyms
( s e t f ( ndefn−synonyms d e f i n i t i o n ) ( findSynonyms noun ) )
; ; p o s s i b l e synonyms
( s e t f ( ndefn−possibleSynonyms d e f i n i t i o n )
( f i n d P o s s i b l e S y n o n y m s noun
( union ( n d e f n − s t r u c t u r a l E l e m e n t s d e f i n i t i o n )
( ndefn−probableStructuralElements d e f i n i t i o n
))
( union ( n d e f n − c l a s s I n c l u s i o n s d e f i n i t i o n )
( ndefn−probableClassInclusions d e f i n i t i o n ))
( ndefn−owners d e f i n i t i o n )
( ndefn−synonyms d e f i n i t i o n ) ) )
; ; a g e n t s who a c t on ’ noun ’ s
( s e t f ( ndefn−agents d e f i n i t i o n ) ( f i n d A g e n t s noun ) )
; ; names o f s p e c i f i c ’ noun ’ s
( s e t f ( n d e f n − n a m e d I n d i v i d u a l s d e f i n i t i o n ) ( f i n d N a m e d I n d i v i d u a l s noun ) )
; ; actions
( s e t f ( n d e f n − a c t i o n s d e f i n i t i o n ) ( a c t f i l t e r ( f i n d A c t i o n s noun ) noun ) )
; ; probable actions
( setf ( ndefn−probableActions d e f i n i t i o n )
( a c t f i l t e r ( f i n d P r o b a b l e A c t i o n s noun ) noun ) )
; ; possible actions
( s e t f ( n d e f n − p o s s i b l e A c t i o n s d e f i n i t i o n ) ( f i n d P o s s i b l e A c t i o n s noun ) )
; ; we a r e done u s i n g i t , s o we can run c l a s s f i l t e r on c l a s s i n c l u s i o n i n f o
( setf ( ndefn−classInclusions d e f i n i t i o n )
( c l a s s F i l t e r ( n d e f n − c l a s s I n c l u s i o n s d e f i n i t i o n ) noun ) )
( setf ( ndefn−probableClassInclusions d e f i n i t i o n )
( c l a s s F i l t e r ( n d e f n − p r o b a b l e C l a s s I n c l u s i o n s d e f i n i t i o n ) noun ) )
; ; return the d e f i n i t i o n
definition ))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : traceLevel
;;;
input :
An i n t e g e r 0−4 r e p r e s e n t i n g t h e amount o f t r a c i n g i n f o t h a t
;;;
s h o u l d be g i v e n :
;;;
0 − no t r a c i n g
;;;
1 − t r a c e o n l y d e f i n i t i o n f u n c t i o n ( defineNoun )
;;;
2 − trace d i f f e r e n t d e f i n i t i o n types ( le x i c o g r a p h i c ,
;;;
teaching )
;;;
3 − t r a c e top l e v e l i n f o f i n d i n g f u n c t i o n s
;;;
4 − trace a l l info finding functions .
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun s e t T r a c e L e v e l ( l e v e l )
( case l e v e l
( 0 ( untrace defineNoun d e f in eN o u nT ea chi ng d e f i n e N o u n L e x i c o g r a p h i c
structureOfAll findStructure indiv struct
f i n d P r o b a b l e S t r u c t u r e s t r u c t − r u l e struct−presume
findPossibleStructure
struct−indiv findClassInclusions findPossibleClassInclusions
c l a s s − i n d i v f i n d P r o b a b l e C l a s s I n c l u s i o n s class−sub−sup
class−rule findActions findProbableActions findPossibleActions
a c t − o b j e c t − r u l e act−object−&−r u l e act−object−presum−rule
act−object−presum−&−r u l e act−object−noun
10
ob j−act−in div obj−act−presume−&−r u l e obj−act−presum−rule
obj−act−&−r u l e o b j − a c t − r u le
findProperties findProbableProperties
f i n d P o s s i b l e P r o p e r t i e s prop−rule
prop−presume prop−indiv findOwners owner−rel
owner−poss rel−for−owner
syn−sub−sup syn−syn findSynonyms f i n d P o s s i b l e S y n o n y m s
e l i m i n a t e D i s s i m i l a r C l a s s e s s i m i l a r S u p e r c l a s s e s p noAntonymsp
antonymp e l i m i n a t e D i s s i m i l a r S t r u c t u r e s i m i l a r S t r u c t u r e p
eliminateDissimilarOwners findSpatial
s i m i l a r O w n e r s p removeElement f i n d N a m e d I n d i v i d u a l s named−indiv
findAgents agent−object action−object prop−relation−1
prop−& prop−&−r e l a t i o n − 1 prop−&−relation−1−presume
prop−relation−1−presume prop−&−presume p r o p − r e l a t i o n − 2
prop−&−r e l a t i o n − 2 prop−relation−2−presume
prop−&−relation−2−presume prop−indiv p r o p − r e l a t i o n − 1 − i n d i v
p r o p − r e l a t i o n − 2 − i n d i v obj−rel−1 obj−&−r e l − 1 obj−rel−2
obj−&−r e l − 2 obj−rel−1−presume obj−&−rel−1−presume
obj−rel−2−presume obj−&−rel−2−presume obj−rel−1−indiv
obj−rel−2−indiv loc−prop l o c − c l s l o c − s t r loc−act−obj
l o c − r e l loc−own loc−prop−cat l o c − c l s − c a t l o c − s t r − c a t
loc−act−obj−cat l o c − r e l − c a t loc−own−cat
))
( 1 ( trace defineNoun ) )
( 2 ( trace defineNoun d ef in e No unT e a chi ng d e f i n e N o u n L e x i c o g r a p h i c ) )
( 3 ( trace defineNoun d ef in e No unT e a chi ng d e f i n e N o u n L e x i c o g r a p h i c
indiv struct structureOfAll findStructure findProbableStructure
findPossibleStructure findProperties findProbableProperties
findClassInclusions findProbableClassInclusions
findPossibleClassInclusions
findPossibleActions findActions findProbableActions
findPossibleProperties
findOwners findSynonyms f i n d P o s s i b l e S y n o n y m s f i n d S p a t i a l ) )
( 4 ( trace defineNoun d e f in e No unT e a chi ng d e f i n e N o u n L e x i c o g r a p h i c
structureOfAll findStructure findSpatial
f i n d P r o b a b l e S t r u c t u r e s t r u c t − r u l e struct−presume
findPossibleStructure
struct−indiv findClassInclusions findPossibleClassInclusions
c l a s s − i n d i v f i n d P r o b a b l e C l a s s I n c l u s i o n s class−sub−sup
class−rule findActions findProbableActions findPossibleActions
a c t − o b j e c t − r u l e act−object−&−r u l e act−object−presum−rule
act−object−presum−&−r u l e act−object−noun
ob j−act−in div obj−act−presume−&−r u l e obj−act−presum−rule
obj−act−&−r u l e o b j − a c t − r u le i n d i v s t r u c t
findProperties findProbableProperties findPossibleProperties
prop−rule prop−presume prop−indiv findOwners
owner−rel owner−poss rel−for−owner
syn−sub−sup syn−syn f i n d P o s s i b l e S y n o n y m s
findSynonyms e l i m i n a t e D i s s i m i l a r C l a s s e s
s i m i l a r S u p e r c l a s s e s p noAntonymsp
antonymp e l i m i n a t e D i s s i m i l a r S t r u c t u r e s i m i l a r S t r u c t u r e p
eliminateDissimilarOwners
s i m i l a r O w n e r s p removeElement f i n d N a m e d I n d i v i d u a l s named−indiv
findAgents agent−object action−object prop−relation−1
prop−& prop−&−r e l a t i o n − 1 prop−&−relation−1−presume
prop−relation−1−presume prop−&−presume p r o p − r e l a t i o n − 2
prop−&−r e l a t i o n − 2 prop−relation−2−presume
prop−&−relation−2−presume prop−indiv p r o p − r e l a t i o n − 1 − i n d i v
11
p r o p − r e l a t i o n − 2 − i n d i v obj−rel−1 obj−&−r e l − 1 obj−rel−2
obj−&−r e l − 2 obj−rel−1−presume obj−&−rel−1−presume
obj−rel−2−presume obj−&−rel−2−presume obj−rel−1−indiv
obj−rel−2−indiv loc−prop l o c − c l s l o c − s t r loc−act−obj
l o c − r e l loc−own loc−prop−cat l o c − c l s − c a t l o c − s t r − c a t
loc−act−obj−cat l o c − r e l − c a t loc−own−cat
))
))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : prettyPrintDef
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun p r e t t y P r i n t D e f ( d e f i n i t i o n )
” P r i n t s human r e a d a b l e v e r s i o n o f t h e d e f i n i t i o n g e n e r a t e d by t h e
a l g o r i t h m t o s t a n d a r d output . ”
( format t ”˜& D e f i n i t i o n o f ˜A: ” ( ndefn−noun d e f i n i t i o n ) )
( i f ( not ( nu ll ( n d e f n − c l a s s I n c l u s i o n s d e f i n i t i o n ) ) )
( format t ”˜& C l a s s I n c l u s i o n s : ˜ { ˜A, ˜ } ”
; ; c a l l l e x i c a l i z e on each e l e m e n t o f t h e l i s t o f
;;
c l a s s i n c l u s i o n s and then p r i n t each o f them ,
;;
s e p a r a t e d by commas
( report ( ndefn−classInclusions definition ))))
( i f ( not ( nu ll ( n d e f n − p r o b a b l e C l a s s I n c l u s i o n s d e f i n i t i o n ) ) )
( format t ”˜& P r o b a b l e C l a s s I n c l u s i o n s : ˜ { ˜A, ˜ } ”
( report ( ndefn−probableClassInclusions d e f i n i t i o n ) ) ) )
( i f ( not ( nu ll ( n d e f n − p o s s i b l e C l a s s I n c l u s i o n s d e f i n i t i o n ) ) )
( format t ”˜& P o s s i b l e C l a s s I n c l u s i o n s : ˜ { ˜A, ˜ } ”
( report ( ndefn−possibleClassInclusions definition ))))
( i f ( not ( nu ll ( n d e f n − s t r u c t u r a l E l e m e n t s d e f i n i t i o n ) ) )
( format t ”˜& S t r u c t u r e : ˜ { ˜A, ˜ } ”
( report ( ndefn−structuralElements d e f i n i t i o n ) ) ) )
( i f ( not ( nu ll ( n d e f n − p r o b a b l e S t r u c t u r a l E l e m e n t s d e f i n i t i o n ) ) )
( format t ”˜& P r o b a b l e S t r u c t u r e : ˜ { ˜A, ˜ } ”
( report ( ndefn−probableStructuralElements d e f i n i t i o n ) ) ) )
( i f ( not ( nu ll ( n d e f n − p o s s i b l e S t r u c t u r a l E l e m e n t s d e f i n i t i o n ) ) )
( format t ”˜& P o s s i b l e S t r u c t u r e : ˜ { ˜A, ˜ } ”
( report ( ndefn−possibleStructuralElements d e f i n i t i o n ) ) ) )
; ; ; I f f u n c t i o n s a r e put back i n t o t h e a l g o r i t h m , th ey w i l l go h e r e
( i f ( not ( nu ll ( n d e f n − a c t i o n s d e f i n i t i o n ) ) )
( format t ”˜& A c t i o n s : ˜ { ˜A, ˜ } ”
( report ( ndefn−actions d e f i n i t i o n ) ) ) )
( i f ( not ( nu ll ( n d e f n − p r o b a b l e A c t i o n s d e f i n i t i o n ) ) )
( format t ”˜& P r o b a b l e A c t i o n s : ˜ { ˜A, ˜ } ”
( report ( ndefn−probableActions d e f i n i t i o n ) ) ) )
( i f ( not ( nu ll ( n d e f n − p o s s i b l e A c t i o n s d e f i n i t i o n ) ) )
( format t ”˜& P o s s i b l e A c t i o n s : ˜ { ˜A, ˜ } ”
( report ( ndefn−possibleActions d e f i n i t i o n ) ) ) )
( i f ( not ( nu ll ( ndefn−agents d e f i n i t i o n ) ) )
( format t ”˜& A c t i o n s p e r f o r m e d on a ˜A: ˜ { ˜A, ˜ } ”
( ndefn−noun d e f i n i t i o n )
( r e p o r t ( ndefn−agents d e f i n i t i o n ) ) ) )
( i f ( not ( nu ll ( n d e f n − p r o p e r t i e s d e f i n i t i o n ) ) )
( format t ”˜& P r o p e r t i e s : ˜ { ˜A, ˜ } ”
( report ( ndefn−properties d e f i n i t i o n ) ) ) )
( i f ( not ( nu ll ( n d e f n − p r o b a b l e P r o p e r t i e s d e f i n i t i o n ) ) )
12
( if
( if
( if
( if
( if
( if
( format t ”˜& P r o b a b l e P r o p e r t i e s : ˜ { ˜A, ˜ } ”
( report ( ndefn−probableProperties d e f i n i t i o n ) ) ) )
( not ( nu ll ( n d e f n − p o s s i b l e P r o p e r t i e s d e f i n i t i o n ) ) )
( format t ”˜& P o s s i b l e P r o p e r t i e s : ˜ { ˜A, ˜ } ”
( report ( ndefn−possibleProperties definition ))))
( not ( nu ll ( n d e f n − s p a t i a l d e f i n i t i o n ) ) )
( format t ”˜& ˜A i s a p l a c e where : ˜ { ˜A, ˜ } ”
( ndefn−noun d e f i n i t i o n )
( report ( ndefn−spatial d e f i n i t i o n ) ) ) )
( not ( nu ll ( ndefn−owners d e f i n i t i o n ) ) )
( format t ”˜& P o s s e s s i v e : ˜ { ˜A, ˜ } ”
( r e p o r t ( ndefn−owners d e f i n i t i o n ) ) ) )
( not ( nu ll ( ndefn−synonyms d e f i n i t i o n ) ) )
( format t ”˜& Synonyms : ˜ { ˜A, ˜ } ”
( r e p o r t ( ndefn−synonyms d e f i n i t i o n ) ) ) )
( not ( nu ll ( ndefn−possibleSynonyms d e f i n i t i o n ) ) )
( format t ”˜& P o s s i b l y S i m i l a r Items : ˜ { ˜A, ˜ } ”
( r e p o r t ( ndefn−possibleSynonyms d e f i n i t i o n ) ) ) )
( not ( nu ll ( n d e f n − n a m e d I n d i v i d u a l s d e f i n i t i o n ) ) )
( format t ”˜& Named I n d i v i d u a l s : ˜ { ˜A, ˜ } ”
( r e p o r t ( ndefn−namedIndividuals d e f i n i t i o n ) ) ) )
)
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : report
;;;
created : stn 2003
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun r e p o r t ( nodes )
” Returns a l i s t o f t h e human l a n g u a g e r e p r e s e n t a t i o n s o f t h e i n p u t l i s t
o f nodes with any d u p l i c a t e s removed . ”
( cond ( ( nu ll nodes ) n i l )
( t ( union ( l e x i c a l i z e ( f i r s t nodes ) )
( r e p o r t ( r e s t nodes ) ) : t e s t #’ s t r i n g = ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : l e x i c a l i z e
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun l e x i c a l i z e ( nodes )
” Finds and r e t u r n s t h e human l a n g u a g e r e p r e s e n t a t i o n o f t h e s n e p s
nodes l i s t e d i n ’ nodes ’ i f one e x i s t s . I f no human l a n g u a g e
r e p r e s e n t a t i o n can be found , t h e node i t s e l f i s r e t u r n e d . ”
( l e t ( humanRep )
( cond
; ; i f t h e l i s t i s empty r e t u r n t h e empty s t r i n g
( ( null nodes ) n i l )
; ; i f we have a l i s t o f l i s t s p r o c e s s each s u b l i s t i n d i v i d u a l l y
( ( and ( l i s t p nodes ) ( l i s t p ( f i r s t nodes ) ) )
( append ( l e x i c a l i z e ( f i r s t nodes ) ) ( l e x i c a l i z e ( r e s t nodes ) ) ) )
; ; i f we have a l i s t c o n s i s t i n g o f two nodes , p r o c e s s them and
;;
concatenate the r e s u l t
( ( and ( l i s t p nodes ) ( eql ( length nodes ) 2 )
( not ( l i s t p ( f i r s t nodes ) ) ) ( not ( l i s t p ( second nodes ) ) ) )
( l i s t ( concatenate ’ s t r i n g ( f i r s t ( l e x i c a l i z e ( f i r s t nodes ) ) ) ” ”
( f i r s t ( l e x i c a l i z e ( second nodes ) ) ) ) ) )
13
; ; l o o k f o r l e x a r c s coming from t h e node
( ( s e t f humanRep # 3 ! ( ( find lex− ˜ nodes ) ) )
( l i s t ( n o d e s 2 s t r i n g humanRep ) ) )
; ; l o o k f o r mod/ head a r c s coming from t h e node
( ( s e t f humanRep ( append # 3 ! ( ( find ( compose mod− lex− ) ˜ nodes ) )
# 3 ! ( ( find ( compose head− lex− ) ˜ nodes ) ) ) )
( l i s t ( n o d e s 2 s t r i n g humanRep ) ) )
; ; i f t h e node i t s e l f i s not named , s e e i f i t i s a member o f a named c l a s s
( ( s e t f humanRep
( removeAllSuperclasses
# 3 ! ( ( find ( compose lex− c l a s s − ! member) ˜ nodes ) ) ) )
( l i s t ( n o d e s 2 s t r i n g humanRep ) ) )
; ; i f t h e node i s p a r t o f a skolem f u n c t i o n , j u s t u s e ” something ”
; ; Note : t h e s e t f h e r e i s u n n e c e s s a r y , but l e a v i n g i t out was c o n f u s i n g
( ( s e t f humanRep # 3 ! ( ( find skf− ˜ nodes ) ) )
( l i s t ” something ” ) )
; ; o t h e r p o s s i b l e r e p r e s e n t a t i o n s would go h e r e
; ; i f we can ’ t f i n d a human l a n g u a g e r e p r e s e n t a t i o n , r e t u r n t h e
; ; name o f t h e s n e p s node
( t ( l i s t ( n o d e s 2 s t r i n g nodes ) ) ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : removeAllSuperclasses
;;;
Due t o p a t h − b a s e d − i n f e r e n c e making class−sub−sup t r a n s i t i v e ,
;;;
e x t r a n e o u s s u p e r c l a s s e s were b e i n g added t o t h e d e f i n i t i o n ;
;;;
t h i s f u n c t i o n removes them .
;;;
−− This f u n c t i o n may need t o be a p p l i e d t o o t h e r a r e a s o f l e x i c a l i z e .
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun r e m o v e A l l S u p e r c l a s s e s ( i n L i s t & o p t i o n a l o u t L i s t )
” Returns a l l e l e m e n t s o f t h e i n p u t l i s t t h a t do not have any s u b c l a s s
in the l i s t . ”
; ; i f we a r e done c h e c k i n g t h e incoming l i s t , check t h e o u t g o i n g l i s t
( i f ( null i n L i s t ) o u t L i s t
( let ( subs )
; ; f i n d a l l s u b c l a s s e s o f the f i r s t element o f i n L i s t
( s e t f s u b s # 3 ! ( ( find ( compose lex− s u b c l a s s − ! s u p e r c l a s s l e x )
˜( f i r s t i n L i s t ) ) ) )
; ; i f t h e r e a r e no s u b c l a s s e s i n t h e r e s t o f t h e i n p u t l i s t
;;
o r i n t h e c u r r e n t output l i s t
( i f ( nu ll ( i n t e r s e c t i o n s u b s ( append ( r e s t i n L i s t ) o u t L i s t ) ) )
; ; add t h e e l e m e n t t o t h e output l i s t and p r o c e s s t h e r e s t
;;
of the input l i s t
( r e m o v e A l l S u p e r c l a s s e s ( r e s t i n L i s t ) ( cons ( f i r s t i n L i s t ) o u t L i s t ) )
; ; o t h e r w i s e , omit t h e e l e m e n t from t h e output l i s t and
;;
p r o c e s s the r e s t
( removeAllSuperclasses ( rest i n L i s t ) o u t L i s t ) ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : nodes2string
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun n o d e s 2 s t r i n g ( nodes )
” C onv erts a l i s t o f s n e p s nodes i n t o a s t r i n g c o n s i s t i n g o f t h e names
14
o f t h e nodes , s e p a r a t e d a s s p a c e s . ”
( cond ( ( nu ll nodes ) ”” )
( ( not ( l i s t p nodes ) ) ( g e t N o d e S t r i n g nodes ) )
; ; t h i s i s j u s t a hack t o remove e x t r a s p a c e s t h a t were showing up
( ( and ( eql ( length nodes ) 1 ) ( not ( l i s t p ( f i r s t nodes ) ) ) )
( g e t N o d e S t r i n g ( f i r s t nodes ) ) )
( t ( concatenate ’ s t r i n g ( g e t N o d e S t r i n g ( f i r s t nodes ) )
” ” ( n o d e s 2 s t r i n g ( r e s t nodes ) ) ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
CLASS INCLUSIONS SECTION
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findClassInclusions
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d C l a s s I n c l u s i o n s ( noun )
” Find a l l s u p e r c l a s s e s o f ’ noun ’ .
Find a l l t h i n g s Y such t h a t , i f X
i s a ’ noun ’ then X i s a Y. ”
( let ( superclasses )
; ; s e e i f we can i n f e r any c l a s s r e l a t i o n s h i p s t h a t we don ’ t
;;
e x p l i c i t l y know about y e t −− a f t e r i n f e r e n c e we w i l l f i n d t h i s
;;
i n f o in subsequent steps
; # 3 ! ( ( deduce s u p e r c l a s s ( b u i l d l e x $ s p r ) s u b c l a s s ( b u i l d l e x ˜ noun ) ) )
; ; now e x t r a c t any r e l e v a n t i n f o
( cond
; ; g e t s u p e r c l a s s e s r e p r e s e n t e d u s i n g sub−sup c a s e frame ,
;;
i n d e f i n i t i o n mode r e t u r n them , i n t e a c h i n g mode
;;
continue accumulating information
( ( and ( s e t f s u p e r c l a s s e s ( append s u p e r c l a s s e s ( class−sub−sup noun ) ) )
∗dmode ∗ )
superclasses )
; ; s u p er c la s s e s represented using a rule
( ( and ( s e t f s u p e r c l a s s e s ( append s u p e r c l a s s e s ( c l a s s − r u l e noun ) ) )
∗dmode ∗ )
superclasses )
; ; i f we a r e i n t e a c h i n g mode , r e t u r n a l l t h e accumulated i n f o
; ; i f we a r e i n d e f i n i t i o n mode , s u p e r c l a s s e s must be n i l h e r e ,
;;
so return n i l
( t superclasses )))
)
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findProbableClassInclusions
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d P r o b a b l e C l a s s I n c l u s i o n s ( noun )
” Find a l l s u p e r c l a s s e s o f ’ noun ’ t h a t a r e marked with t h e
’ mode presumably ’ t a g . ”
( let ( superclasses )
( cond
; ; SN : I don ’ t know why E h r l i c h u s e s deduce h e r e , t h i s i s t h e
;;
o n l y p l a c e i n t h e a l g o r i t h m t h a t i t i s used −− I am l e a v i n g
;;
i t as i t i s u n t i l I understand i t
15
( ( and ∗ dmode ∗ # 3 ! ( ( deduce mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d s u b c l a s s ( b u i l d l e x ˜ noun )
s u p e r c l a s s ( b u i l d l e x $maybesuper
)))))
( s e t f s u p e r c l a s s e s ( append s u p e r c l a s s e s ( class−sub−sup−presum noun ) ) ) )
; ; s u p e r c l a s s e s r e p r e s e n t e d u s i n g a presumable r u l e
( ( and ( s e t f s u p e r c l a s s e s ( append s u p e r c l a s s e s ( c l a s s − r u l e − p r e s u m noun ) ) )
∗dmode ∗ )
superclasses )
; ; i f we a r e i n t e a c h i n g mode , r e t u r n a l l t h e accumulated i n f o
; ; i f we a r e i n d e f i n i t i o n mode , s u p e r c l a s s e s must be n i l h e r e ,
;;
so return n i l
( t superclasses )))
)
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findPossibleClassInclusions
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d P o s s i b l e C l a s s I n c l u s i o n s ( noun c l a s s I n c l s )
” Find p o s s i b l e s u p e r c l a s s e s o f noun .
I f some X i s a member o f t h e
c l a s s ’ noun ’ and X i s a l s o a member o f t h e c l a s s Y , then Y i s
l i s t e d a s a p o s s i b l e c l a s s i n c l u s i o n f o r ’ noun ’ . ”
; ; e l i m i n a t e any i t e m s t h a t would be d u p l i c a t e s o f c l a s s i n c l u s i o n s
;;
o r p r o b a b l e c l a s s i n c l u s i o n s from t h e l i s t o f p o s s i b l e c l a s s i n c l u s i o n s
( s e t − d i f f e r e n c e ( c l a s s − i n d i v noun )
; ; e l i m i n a t e c l a s s I n c l s and t h e noun i t s e l f from t h e l i s t
( append c l a s s I n c l s # 3 ! ( ( find l e x ˜ noun ) ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : class−sub−sup
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun class−sub−sup ( noun )
” Finds s u p e r c l a s s e s o f ’ noun ’ r e p r e s e n t e d u s i n g t h e s u b c l a s s / s u p e r c l a s s
case frame . ”
# 3 ! ( ( find ( compose s u p e r c l a s s − ! s u b c l a s s l e x ) ˜ noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : class−rule
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun c l a s s − r u l e ( noun )
” Finds s u p e r c l a s s e s o f ’ noun ’ r e p r e s e n t e d u s i n g a r u l e ”
# 3 ! ( ( find ( compose c l a s s − cq− ! ant c l a s s l e x ) ˜ noun
( compose c l a s s − member member− c l a s s l e x ) ˜ noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : class−sub−sup−presum
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun class−sub−sup−presum ( noun )
” Finds t h i n g s t h a t a r e presumably s u p e r c l a s s e s o f ’ noun ’ . ”
16
# 3 ! ( ( find ( compose s u p e r c l a s s − s u b c l a s s l e x ) ˜ noun
( compose s u p e r c l a s s − o b j ec t − ! mode l e x ) ” presumably ” ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : class−rule−presum
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun c l a s s − r u l e − p r e s u m ( noun )
” Finds s u p e r c l a s s e s o f ’ noun ’ r e p r e s e n t e d u s i n g a r u l e ”
# 3 ! ( ( find ( compose c l a s s − o b j e c t − cq− ! ant c l a s s l e x ) ˜ noun
( compose c l a s s − o b j e c t − mode l e x ) ” presumably ”
( compose c l a s s − member member− c l a s s l e x ) ˜ noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : class−indiv
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun c l a s s − i n d i v ( noun )
” Finds p o s s i b l e l e v e l s u p e r c l a s s e s o f a l e v e l noun . ”
# 3 ! ( ( find ( compose c l a s s − ! member member− ! c l a s s l e x ) ˜ noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : c l a s s F i l t e r
;;;
i n p u t : a l i s t o f s u p e r c l a s s e s a s output by ” c l a s s e s ” , an empty l i s t ,
;;;
and t h e noun t o be d e f i n e d .
;;;
output : a l i s t o f c l a s s e s not redundant with t h e r e s t o f t h e d e f i n i t i o n
;;;
calls :
mostSpecificSuperclassp , c l a s s F i l t e r recursively
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun c l a s s F i l t e r ( s u p e r c l a s s e s noun & o p t i o n a l f i l t e r e d )
”Removes any s u p e r c l a s s e s o f ’ noun ’ which l e s s s p e c i f i c than o t h e r
s u p e r c l a s s e s o f ’ noun ’ from t h e l i s t o f c l a s s i n c l u s i o n s and r e t u r n s
t h e r e s u l t . For an example o f t h e h e i r a r c h y o f c l a s s i n c l u s i o n s s e e
t h e documentation f o r m o s t S p e c i f i c S u p e r c l a s s p . ”
( cond ( ( nu ll s u p e r c l a s s e s ) f i l t e r e d )
; ; i f f i r s t element of input i s a l i s t
(( listp ( first superclasses ))
; ; add c l a s s F i l t e r o f c a r &
( append f i l t e r e d
; ; c l a s s F i l t e r o f c d r t o output
( l i s t ( c l a s s F i l t e r ( f i r s t s u p e r c l a s s e s ) noun f i l t e r e d ) )
( c l a s s F i l t e r ( r e s t s u p e r c l a s s e s ) noun f i l t e r e d ) ) )
; ; i f c a r i n p u t i s an ok atom
; ; add i t and c l a s s F i l t e r o f
; ; c d r t o output .
(( basicLevelp ( first superclasses ))
( list ( first superclasses )))
( ( m o s t S p e c i f i c S u p e r c l a s s p ( f i r s t s u p e r c l a s s e s ) noun )
( append f i l t e r e d ( l i s t ( f i r s t s u p e r c l a s s e s ) )
( c l a s s F i l t e r ( r e s t s u p e r c l a s s e s ) noun f i l t e r e d ) ) )
; ; o t h e r w i s e c a r i n p u t not ok .
; ; add c l a s s F i l t e r o f c d r t o output .
( t ( c l a s s F i l t e r ( r e s t s u p e r c l a s s e s ) noun f i l t e r e d ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : basicLevelp
;;;
created : stn 2002
17
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun b a s i c L e v e l p ( word )
” I f ’ word ’ i s b a s i c l e v e l r e t u r n T e l s e r e t u r n n i l . ”
# 3 ! ( ( deduce member ˜ word c l a s s ( b u i l d l e x ” b a s i c c t g y ” ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : mostSpecificSuperclassp (a predicate )
;;;
i n p u t : a noun t o be d e f i n e d and a s u p e r c l a s s a t t r i b u t e d t o <noun>
;;;
r e t u r n s n i l i f t h e c l a s s can be deduced from o t h e r e l e m e n t s o f t h e
;;;
d e f i n i t i o n , t otherwise .
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun m o s t S p e c i f i c S u p e r c l a s s p ( c l a s s noun )
” Returns t i f t h e r e a r e no c l a s s e s between ’ c l a s s ’ and ’ noun ’ i n a
s u p e r c l a s s − s u b c l a s s r e l a t i o n , n i l o t h e r w i s e . For example i f
c l a s s = v e r t e b r a t e , noun = c a t and v e r t e b r a t e i s a s u p e r c l a s s o f
mammal which i s a s u p e r c l a s s o f c a t , m o s t S p e c i f i c S u p e r c l a s s p would
return n i l b e c a u s e mammal i s a c l a s s between c a t and v e r t e b r a t e . ”
( not # 3 ! ( ( find ( compose s u p e r c l a s s − ! s u b c l a s s l e x ) ˜ noun
( compose s u b c l a s s − ! s u p e r c l a s s ) ˜ c l a s s ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
ACTIONS SECTION
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : act−object−rule
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun a c t − o b j e c t − r u l e ( noun )
” Finds a c t i o n s p e r f o r m e d by a l l ’ noun ’ s and t h e o b j e c t s t h a t t h o s e
a c t i o n s a r e p e rf o r me d on ”
( let ( actions )
( setf actions
# 3 ! ( ( find ( compose action− act− ! cq− ! ant ! c l a s s l e x ) ˜ noun
( compose action− act− ! a g e n t member− ! c l a s s l e x ) ˜ noun ) ) )
; ; f i n d o b j e c t s a s s o c i a t e d with each o f t h e a c t i o n s
(mapcar # ’ ( lambda ( a c t ) ( o b j − a c t − r u le noun a c t ) ) a c t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : o b j − a c t − r u le
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun o b j − a c t − r u le ( noun a c t i o n )
” Finds t h e o b j e c t s t h a t ’ noun ’ p e r f o r m s ’ a c t i o n ’ on . ”
( let ( objects )
( setf objects
# 3 ! ( ( find ( compose ob j e ct − act− ! cq− ! ant ! c l a s s l e x ) ˜ noun
( compose o b j e c t − a c t i o n ) ˜ a c t i o n ) ) )
( i f ( nu ll o b j e c t s ) a c t i o n
(mapcar # ’ ( lambda ( o b j ) ( l i s t a c t i o n o b j ) ) o b j e c t s ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : act−object−&−r u l e
18
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun act−object−&−r u l e ( noun )
” Finds a c t i o n s p e r f o r m e d by a l l ’ noun ’ s and t h e o b j e c t s t h a t t h o s e
a c t i o n s a r e p e r f o r m e d on ”
( let ( actions )
( setf actions
# 3 ! ( ( find ( compose action− act− ! cq− ! & ant ! c l a s s l e x ) ˜ noun
( compose action− act− ! a g e n t member− ! c l a s s l e x ) ˜ noun ) ) )
(mapcar # ’ ( lambda ( a c t ) ( obj−act−&−r u l e noun a c t ) ) a c t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : obj−act−&−r u l e
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun obj−act−&−r u l e ( noun a c t i o n )
” Finds t h e o b j e c t s t h a t ’ noun ’ p e r f o r m s ’ a c t i o n ’ on . ”
( let ( objects )
( setf objects
# 3 ! ( ( find ( compose o b j e c t − act− ! cq− ! & ant ! c l a s s l e x ) ˜ noun
( compose o b j e c t − a c t i o n ) ˜ a c t i o n ) ) )
( i f ( nu ll o b j e c t s ) a c t i o n
(mapcar # ’ ( lambda ( o b j ) ( l i s t a c t i o n o b j ) ) o b j e c t s ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : act−object−presum−rule
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun act−object−presum−rule ( noun )
” Finds a c t i o n s t h a t a r e presumed t o be p er f or m ed by a l l ’ noun ’ s and t h e
o b j e c t s t h a t t h o s e a c t i o n s a r e presumed t o be p e r f o r me d on . ”
( let ( actions )
( setf actions
# 3 ! ( ( find ( compose action− act− o b j e ct − mode l e x ) ” presumably ”
( compose action− act− ob j e c t − cq− ! ant c l a s s l e x ) ˜ noun
( compose action− act− a g e n t member− c l a s s l e x ) ˜ noun ) ) )
(mapcar # ’ ( lambda ( a c t ) ( obj−act−presum−rule noun a c t ) ) a c t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : obj−act−presum−rule
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun obj−act−presum−rule ( noun a c t i o n )
” Finds t h e o b j e c t s t h a t ’ noun ’ presumably p e r f o r m s ’ a c t i o n ’ on . ”
( let ( objects )
( setf objects
# 3 ! ( ( find ( compose o b j e c t − act− ob j e ct − cq− ! ant c l a s s l e x ) ˜ noun
( compose o b j e c t − a c t i o n ) ˜ a c t i o n ) ) )
( i f ( nu ll o b j e c t s ) a c t i o n
(mapcar # ’ ( lambda ( o b j ) ( l i s t a c t i o n o b j ) ) o b j e c t s ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : act−object−presum−&−r u l e
;;;
created : stn 2002
19
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun act−object−presum−&−r u l e ( noun )
” Finds a c t i o n s t h a t a r e presumed t o be p er f or med by a l l ’ noun ’ s and
t h e o b j e c t s t h a t t h o s e a c t i o n s a r e presumed t o be pe rf or me d on . ”
( let ( actions )
( setf actions
# 3 ! ( ( find ( compose action− act− o b j e c t − mode l e x ) ” presumably ”
( compose action− act− o b j e c t − cq− ! & ant c l a s s l e x ) ˜ noun
( compose action− act− a g e n t member− c l a s s l e x ) ˜ noun ) ) )
(mapcar # ’ ( lambda ( a c t ) ( obj−act−presume−&−r u l e noun a c t ) ) a c t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : obj−act−presum−&−r u l e
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun obj−act−presume−&−r u l e ( noun a c t i o n )
” Finds t h e o b j e c t s t h a t ’ noun ’ presumably p e r f o r m s ’ a c t i o n ’ on . ”
( let ( objects )
( setf objects
# 3 ! ( ( find ( compose o b j e c t − act− ob j e ct − cq− ! & ant c l a s s l e x ) ˜ noun
( compose o b j e c t − a c t i o n ) ˜ a c t i o n ) ) )
( i f ( nu ll o b j e c t s ) a c t i o n
(mapcar # ’ ( lambda ( o b j ) ( l i s t a c t i o n o b j ) ) o b j e c t s ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : act−object−noun
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun act−object−noun ( noun )
” Finds a c t i o n s p e r f o r m e d by a t l e a s t one member o f t h e c a t e g o r y ’ noun ’ and
t h e o b j e c t s t h a t t h o s e a c t i o n s a r e p er f or med on . ”
( let ( actions )
( setf actions
# 3 ! ( ( find ( compose action− act− ! a g e n t member− ! c l a s s l e x ) ˜ noun ) ) )
(mapcar # ’ ( lambda ( a c t ) ( o bj−act−indiv noun a c t ) ) a c t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : ob j−ac t−in div
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun ob j−ac t−in div ( noun a c t i o n )
” Finds t h e o b j e c t s t h a t ’ noun ’ p e r f o r m s ’ a c t i o n ’ on . ”
( let ( objects )
( setf objects
# 3 ! ( ( find ( compose ob j e ct − act− ! a g e n t member− ! c l a s s l e x ) ˜ noun
( compose o b j e ct − a c t i o n ) ˜ a c t i o n ) ) )
( i f ( nu ll o b j e c t s ) a c t i o n
(mapcar # ’ ( lambda ( o b j ) ( l i s t a c t i o n o b j ) ) o b j e c t s ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findActions
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d A c t i o n s ( noun )
20
” Find a c t i o n s ( and t h e o b j e c t s t h a t t h o s e a c t i o n s a r e pe rf or me d on ,
i f any ) t h a t a r e p er f o r m e d by a l l ’ noun ’ s . ”
( l e t ( r e s u l t s indivNoun )
; ; g e t an i n d i v i d u a l noun s o t h a t we can u s e i t i n t h e deduce
( s e t f indivNoun ( f i r s t # 3 ! ( ( find ( compose member− ! c l a s s l e x ) ˜ noun ) ) ) )
; ; s e e i f we can i n f e r any a c t i o n s t h a t we don ’ t e x p l i c i t l y kow about y e t
( i f ( not ( nu ll indivNoun ) )
# 3 ! ( ( deduce a g e n t ˜ indivNoun a c t $someAct ) ) )
; ; now e x t r a c t any r e l e v a n t i n f o
( cond
; ; d e f i n i t e rule , or−entail
( ( and ( s e t f r e s u l t s ( append r e s u l t s ( a c t − o b j e c t − r u l e noun ) ) ) ∗ dmode ∗ )
results )
; ; d e f i n i t e r u l e , &− e n t a i l
( ( and ( s e t f r e s u l t s ( append r e s u l t s ( act−object−&−r u l e noun ) ) ) ∗ dmode ∗ )
results )
; ; I f we a r e i n t e a c h i n g mode , r e t u r n a l l t h e i n f o we have accumulated .
; ; I f we a r e i n d e f i n i t i o n mode r e s u l t s = n i l s o r e t u r n n i l .
(t results ))))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findProbableActions
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d P r o b a b l e A c t i o n s ( noun )
” Find a c t i o n s ( and t h e o b j e c t s t h a t t h o s e a c t i o n s a r e pe rf or me d on ,
i f any ) t h a t can be presumed t o be p e rf or m e d by a l l ’ noun ’ s . ”
( let ( r e s u l t s )
( cond
; ; ” presumably ” r u l e , o r − e n t a i l , t r a n s i t i v e
( ( and ( s e t f r e s u l t s ( append r e s u l t s ( act−object−presum−rule noun ) ) )
∗dmode ∗ )
results )
; ; ” presumably ” r u l e , &− e n t a i l , t r a n s i t i v e
( ( and ( s e t f r e s u l t s ( append r e s u l t s ( act−object−presum−&−r u l e noun ) ) )
∗dmode ∗ )
results )
; ; I f we a r e i n t e a c h i n g mode , r e t u r n a l l t h e i n f o we have accumulated .
; ; I f we a r e i n d e f i n i t i o n mode r e s u l t s = n i l s o r e t u r n n i l .
(t results ))))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findPossibleActions
;;;
i n p u t : a noun t o be d e f i n e d
;;;
output : a l i s t o f a c t i o n s a t t r i b u t e d t o any o b j e c t o f type <noun>
;;;
m o d i f i e d : mkb 2 0 0 2
;;;
modified : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d P o s s i b l e A c t i o n s ( noun )
” Find a c t i o n s ( and t h e o b j e c t s t h a t t h o s e a c t i o n s a r e pe rf or me d on ,
i f any ) t h a t a r e p e r f o r m e d by a t l e a s t one ’ noun ’ . ”
( act−object−noun noun ) )
; ; ; THE FOLLOWING IN UNNECESSARILY COMPLICATED BECAUSE WE ONLY HAVE ONE
21
;;;
;;;
;;;
;;;
;;;
;;;
;;;
;;;
;;;
;;;
;;;
;;;
;;;
;;;
;;;
CHECK TO DO IF MORE CHECKS ARE ADDED IN THE FUTURE THIS VERSION OF
FINDPOSSIBLEACTIONS SHOULD BE UNCOMMENTED AND USED. −− IF WE BECOME
REASONABLY SURE THAT NO MORE CHECKS WILL BE ADDED THEN WE SHOULD JUST
RENAME ACT−OBJECT−NOUN TO FINDPOSSIBLEACTIONS
( let ( results )
( cond
; ; f i n d a c t i o n s p e r f o r m e d by a t l e a s t one member o f t h e c l a s s ’ noun ’
( ( and ( s e t f r e s u l t s ( append r e s u l t s ( act−object−noun noun ) ) )
∗dmode ∗ )
results )
;;
;;
;;
(t
i f we a r e i n t e a c h i n g mode , r e t u r n a l l t h e i n f o r m a t i o n t h a t we
accumulated above ,
otherwise , return r e s u l t s (= n i l ) .
results ))))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : a c t f i l t e r
;;;
i n p u t : a l i s t o f a c t i o n s a s output by ” a c t s ” , an empty l i s t , and t h e
;;;
noun t o be d e f i n e d .
;;;
output : a l i s t o f a c t i o n s not redundant with t h e r e s t o f t h e d e f i n i t i o n
;;;
c a l l s : non redundant act , a c t f i l t e r r e c u r s i v e l y
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun a c t f i l t e r ( a c t − l i s t noun & o p t i o n a l f i l t e r e d )
( cond
; ; i f we a r e done f i l t e r i n g , r e t u r n t h e f i l t e r e d l i s t
( ( null a c t − l i s t ) f i l t e r e d )
; ; i f the f i r s t element i s a l i s t , f i l t e r r e c u r s i v e l y
(( listp ( first act−list ))
( append f i l t e r e d
( l i s t ( a c t f i l t e r ( f i r s t a c t − l i s t ) noun f i l t e r e d ) )
( a c t f i l t e r ( r e s t a c t − l i s t ) noun f i l t e r e d ) ) )
; ; i f f i r s t e l e m e n t i s not redundant add i t t o f i l t e r e d and f i l t e r r e s t
( ( n o n r e d u n d a n t a c t ( f i r s t a c t − l i s t ) noun )
( append f i l t e r e d ( l i s t ( f i r s t a c t − l i s t ) )
( a c t f i l t e r ( r e s t a c t − l i s t ) noun f i l t e r e d ) ) )
; ; i f f i r s t e l e m e n t i s redundant , j u s t f i l t e r r e s t o f l i s t
( t ( a c t f i l t e r ( r e s t a c t − l i s t ) noun f i l t e r e d ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : non redundant act ( a predicate )
;;;
i n p u t : a noun t o be d e f i n e d and an a c t a t t r i b u t e d t o <noun>
;;;
r e t u r n s n i l i f t h e a c t can be deduced from o t h e r e l e m e n t s o f t h e
;;;
d e f i n i t i o n , t otherwise .
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun n o n r e d u n d a n t a c t ( a c t noun )
( cond
; ; d e f i n i t e case
( # 3 ! ( ( find ( compose s u p e r c l a s s − ! s u b c l a s s l e x ) ˜ noun
( compose c l a s s − ant− ! cq a c t a c t i o n ) ˜ a c t ) ) n i l )
; ; presumably
( # 3 ! ( ( find ( compose s u p e r c l a s s − ! s u b c l a s s l e x ) ˜ noun
( compose c l a s s − ant− ! cq o b j e c t a c t a c t i o n ) ˜ a c t ) ) n i l )
( t t )))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
22
;;;
STRUCTURE SECTION
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findStructure
;;;
;;;
Used f o r f i n d i n g s t r u c t u r e o f a noun .
;;;
m o d i f i e d : mkb 2 0 0 2
;;;
modified : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d S t r u c t u r e ( noun )
” Attempts t o f i n d s t r u c t u r a l f e a t u r e s common t o a l l members o f t h e
c l a s s noun . ”
( s t r u c t − r u l e noun ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findProbableStructure
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d P r o b a b l e S t r u c t u r e ( noun )
” Attempts t o f i n d s t r u c t u r a l f e a t u r e s t h a t a r e presumably p a r t o f a l l
’ noun ’ s . ”
( struct−presume noun ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findPossibleStructure
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d P o s s i b l e S t r u c t u r e ( noun s u p e r c l a s s e s )
” Find t h i n g s t h a t a r e p a r t o f some ( but not n e c e s s a r i l y a l l ) members o f
t h e c l a s s ’ noun ’ , and a r e a l s o not p a r t o f a l l members o f a s u p e r c l a s s
o f ’ noun ’ . For example : i f t h e knowledge b a s e s a y s ’ Dogs a r e Mammals .
Rover i s a Dog . Rover has n o s e . A l l Mammals have f u r . ’ Then ’ n o s e ’
would be r e t u r n e d but ’ f u r ’ would not be r e t u r n e d . ”
( s e t − d i f f e r e n c e ( i n d i v s t r u c t noun ) ( s t r u c t u r e O f A l l s u p e r c l a s s e s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : struct
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun s t r u c t − r u l e ( noun )
” Find any t h i n g s t h a t a r e a p a r t o f a l l members o f t h e c a t e g o r y ’ noun ’ . ”
# 3 ! ( ( find ( compose part− whole member− c l a s s l e x ) ˜ noun
( compose part− cq− ! ant c l a s s l e x ) ˜ noun
( compose part− whole f o r a l l − ! ant c l a s s l e x )
˜noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : struct−presume
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun struct−presume ( noun )
” Find any t h i n g s t h a t a r e presumably a p a r t o f a l l members o f t h e
23
c a t e g o r y ’ noun ’ . ”
# 3 ! ( ( find ( compose part− whole member− c l a s s l e x ) ˜ noun
( compose part− o b j e c t − mode l e x ) ” presumably ”
( compose part− whole f o r a l l − ! ant c l a s s l e x )
˜noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : struct−indiv
;;;
created : stn 20
02
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun s t r u c t − i n d i v ( noun )
” Find any t h i n g s t h a t a r e p a r t o f some i n d i v i d u a l who i s a member o f t h e
c a t e g o r y ’ noun ’ . ”
# 3 ! ( ( find ( compose part− ! whole member− ! c l a s s l e x ) ˜ noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : indiv struct
;;;
input :
a noun t o be d e f i n e d and a l i s t o f i t s s u p e r c l a s s e s .
;;;
output : a l i s t o f p o s s e s s i o n s a t t r i b u t e d t o i n d i v i d u a l s
;;;
o f c l a s s <noun > . ( See n o t e on ” s t r u c t ” )
;;;
m o d i f i e d : mkb 2 0 0 2
;;;
modified : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun i n d i v s t r u c t ( noun )
” Find t h i n g s t h a t a r e p a r t o f some ( but not n e c e s s a r i l y a l l ) members
o f t h e c l a s s ’ noun ’ . ”
( let ( parts )
( cond ( ( and ( s e t f p a r t s ( append p a r t s ( s t r u c t − i n d i v noun ) ) ) ∗ dmode ∗ )
parts )
; ; i f we have g o t t e n t o t h i s p o i n t t h e r e a r e 2 p o s s i b l e s c e n a r i o s :
;;
1 ) we have found no p a r t s −− s o ’ p a r t s ’ = n i l
;;
2 ) we a r e i n t e a c h i n g mode ( ∗ dmode ∗ = n i l ) and we want t o
;;
r e t u r n a l l t h e i n f o t h a t we accumulated i n t h e s t e p s above .
( t parts ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : structureOfAll
;;;
modified : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun s t r u c t u r e O f A l l ( c l a s s e s )
” Find t h e s t r u c t u r e o f a l l t h e c l a s s e s l i s t e d a s p a r a m e t e r s . ”
( i f ( not ( nu ll c l a s s e s ) )
( append ( f i n d S t r u c t u r e ( f i r s t c l a s s e s ) ) ( s t r u c t u r e O f A l l ( r e s t c l a s s e s ) ) )
nil ))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
PROPERTIES SECTION
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : prop−rule
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
24
( defun prop−rule ( noun )
” Finds p r o p e r t i e s b e l o n g t o a l l members o f t h e c l a s s ’ noun ’ , where ’ noun ’
i s a category . ”
# 3 ! ( ( find ( compose property− ! o b j e c t member− ! c l a s s l e x ) ˜ noun
( compose property− ! cq− ! ant ! c l a s s l e x ) ˜ noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : prop−relation−1
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun p r o p − r e l a t i o n − 1 ( noun )
” Finds r e l a t i o n s h i p s t h a t a l l members o f t h e c a t e g o r y ’ noun ’ a r e i n v o l v e d
i n and t h e o t h e r o b j e c t s t h a t a r e a l s o i n t h e r e l a t i o n . ”
( let ( r e l a t i o n s )
( setf r e l a t i o n s
# 3 ! ( ( find ( compose r e l − ! o b j e c t 1 member− ! c l a s s l e x ) ˜ noun
( compose r e l − ! cq− ! ant ! c l a s s l e x ) ˜ noun ) ) )
; ; f i n d t h e o b j e c t s a s s o c i a t e d with each o f t h e r e l a t i o n s
(mapcar # ’ ( lambda ( r e l ) ( obj−rel−1 noun r e l ) ) r e l a t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : obj−rel−1
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun obj−rel−1 ( noun r e l a t i o n )
” Finds t h e o b j e c t s t h a t a r e i n v o l v e d i n t h e s p e c i f i e d r e l a t i o n with
’ noun ’ and r e t u r n s a l i s t c o n s i s t i n g o f t h e r e l a t i o n f o l l o w e d by
the o b j e c t s . ”
( let ( objects )
( setf objects
# 3 ! ( ( find ( compose o b j e c t 2 − ! o b j e c t 1 member− ! c l a s s l e x ) ˜ noun
( compose o b j e c t 2 − ! cq− ! ant ! c l a s s l e x ) ˜ noun
( compose ob j e c t 2 − ! r e l ) ˜ r e l a t i o n ) ) )
(mapcar # ’ ( lambda ( o b j ) ( l i s t r e l a t i o n o b j ) ) o b j e c t s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : prop−&
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun prop− & ( noun )
” Finds p r o p e r t i e s b e l o n g t o a l l members o f t h e c l a s s ’ noun ’ . ”
# 3 ! ( ( find ( compose property− ! o b j e c t member− ! c l a s s l e x ) ˜ noun
( compose property− ! cq− ! & ant ! c l a s s l e x ) ˜ noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : prop−&−r e l a t i o n − 1
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun prop−&−r e l a t i o n − 1 ( noun )
” Finds r e l a t i o n s h i p s t h a t a l l members o f t h e c a t e g o r y ’ noun ’ a r e i n v o l v e d
i n and t h e o t h e r o b j e c t s t h a t a r e a l s o i n t h e r e l a t i o n . ”
( let ( r e l a t i o n s )
( setf r e l a t i o n s
# 3 ! ( ( find ( compose r e l − ! o b j e c t 1 member− ! c l a s s l e x ) ˜ noun
25
( compose r e l − ! cq− ! & ant ! c l a s s l e x ) ˜ noun ) ) )
; ; f i n d t h e o b j e c t s a s s o c i a t e d with each o f t h e r e l a t i o n s
(mapcar # ’ ( lambda ( r e l ) ( obj−&−r e l − 1 noun r e l ) ) r e l a t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : obj−&−r e l − 1
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun obj−&−r e l − 1 ( noun r e l a t i o n )
” Finds t h e o b j e c t s t h a t a r e i n v o l v e d i n t h e s p e c i f i e d r e l a t i o n with ’ noun ’
and r e t u r n s a l i s t c o n s i s t i n g o f t h e r e l a t i o n f o l l o w e d by t h e o b j e c t s . ”
( let ( objects )
( setf objects
# 3 ! ( ( find ( compose o b j e c t 2 − ! o b j e c t 1 member− ! c l a s s l e x ) ˜ noun
( compose o b j e c t 2 − ! cq− ! & ant ! c l a s s l e x ) ˜ noun
( compose o b j e c t 2 − ! r e l ) ˜ r e l a t i o n ) ) )
(mapcar # ’ ( lambda ( o b j ) ( l i s t r e l a t i o n o b j ) ) o b j e c t s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : prop−relation−2
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun p r o p − r e l a t i o n − 2 ( noun )
” Finds r e l a t i o n s h i p s t h a t ’ noun ’ s a r e i n v o l v e d i n ( where t h e noun i s
t h e o b j e c t 2 ) and t h e o t h e r o b j e c t s t h a t a r e a l s o i n t h e r e l a t i o n . ”
( let ( r e l a t i o n s )
( setf r e l a t i o n s
# 3 ! ( ( find ( compose r e l − ! o b j e c t 2 l e x ) ˜ noun
( compose r e l − ! o b j e c t 1 f o r a l l − ! cq ! o b j e c t 2 l e x ) ˜ noun ) ) )
; ; f i n d t h e o b j e c t s a s s o c i a t e d with each o f t h e r e l a t i o n s
(mapcar # ’ ( lambda ( r e l ) ( obj−rel−2 noun r e l ) ) r e l a t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : obj−rel−2
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun obj−rel−2 ( noun r e l a t i o n )
” Finds t h e o b j e c t s t h a t a r e i n v o l v e d i n t h e s p e c i f i e d r e l a t i o n with
’ noun ’ and r e t u r n s a l i s t c o n s i s t i n g o f t h e r e l a t i o n f o l l o w e d by t h e
objects . ”
( let ( objects )
( setf objects
# 3 ! ( ( find ( compose c l a s s − ! member o b j e ct 1 − ! o b j e c t 2 l e x ) ˜ noun
( compose c l a s s − ! ant− ! cq ! o b j e c t 2 l e x ) ˜ noun
( compose c l a s s − ! member o b j e c t 1 − ! r e l ) ˜ r e l a t i o n ) ) )
(mapcar # ’ ( lambda ( o b j ) ( l i s t o b j r e l a t i o n ) ) o b j e c t s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : prop−&−r e l a t i o n − 2
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun prop−&−r e l a t i o n − 2 ( noun )
” Finds r e l a t i o n s h i p s t h a t ’ noun ’ s a r e i n v o l v e d i n ( where t h e noun i s
t h e o b j e c t 2 ) and t h e o t h e r o b j e c t s t h a t a r e a l s o i n t h e r e l a t i o n . ”
26
( let ( r e l a t i o n s )
( setf r e l a t i o n s
# 3 ! ( ( find ( compose r e l − ! o b j e c t 2 l e x ) ˜ noun
( compose r e l − ! o b j e c t 1 f o r a l l − ! cq ! o b j e c t 2 l e x ) ˜ noun ) ) )
; ; f i n d t h e o b j e c t s a s s o c i a t e d with each o f t h e r e l a t i o n s
(mapcar # ’ ( lambda ( r e l ) ( obj−&−r e l − 2 noun r e l ) ) r e l a t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : obj−&−r e l − 2
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun obj−&−r e l − 2 ( noun r e l a t i o n )
” Finds t h e o b j e c t s t h a t a r e i n v o l v e d i n t h e s p e c i f i e d r e l a t i o n with
’ noun ’ and r e t u r n s a l i s t c o n s i s t i n g o f t h e r e l a t i o n f o l l o w e d by
the o b j e c t s . ”
( let ( objects )
( setf objects
# 3 ! ( ( find ( compose c l a s s − ! member o b je ct 1 − ! o b j e c t 2 l e x ) ˜ noun
( compose c l a s s − ! & ant− ! cq ! o b j e c t 2 l e x ) ˜ noun
( compose c l a s s − ! member o b j e ct 1 − ! r e l ) ˜ r e l a t i o n ) ) )
(mapcar # ’ ( lambda ( o b j ) ( l i s t o b j r e l a t i o n ) ) o b j e c t s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : prop−relation−1−presume
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun prop−relation−1−presume ( noun )
” Finds r e l a t i o n s h i p s t h a t a l l members o f t h e c a t e g o r y ’ noun ’ a r e presumably
i n v o l v e d i n and t h e o t h e r o b j e c t s t h a t a r e a l s o i n t h e r e l a t i o n . ”
( let ( r e l a t i o n s )
( setf r e l a t i o n s
# 3 ! ( ( find ( compose r e l − ! o b j e c t 1 member− ! c l a s s l e x ) ˜ noun
( compose r e l − ! o bj e c t − cq− ! ant ! c l a s s l e x ) ˜ noun
( compose r e l − ! o bj e ct − mode l e x ) ” presumably ” ) ) )
; ; f i n d t h e o b j e c t s a s s o c i a t e d with each o f t h e r e l a t i o n s
(mapcar # ’ ( lambda ( r e l ) ( obj−rel−1−oresume noun r e l ) ) r e l a t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : obj−rel−1−presume
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun obj−rel−1−presume ( noun r e l a t i o n )
” Finds t h e o b j e c t s t h a t a r e i n v o l v e d i n t h e s p e c i f i e d r e l a t i o n with
’ noun ’ and r e t u r n s a l i s t c o n s i s t i n g o f t h e r e l a t i o n f o l l o w e d by
the o b j e c t s . ”
( let ( objects )
( setf objects
# 3 ! ( ( find ( compose o b j e c t 2 − ! o b j e c t 1 member− ! c l a s s l e x ) ˜ noun
( compose o b j e c t 2 − ! o b j e c t − cq− ! ant ! c l a s s l e x ) ˜ noun
( compose o b j e c t 2 − ! o bj e ct − mode l e x ) ” presumably ”
( compose o b j e c t 2 − ! r e l ) ˜ r e l a t i o n ) ) )
(mapcar # ’ ( lambda ( o b j ) ( l i s t r e l a t i o n o b j ) ) o b j e c t s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
27
;;;
f u n c t i o n : prop−presume
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun prop−presume ( noun )
” Finds p r o p e r t i e s t h a t presumably b e l o n g t o a l l members o f t h e c l a s s ’ noun ’ . ”
# 3 ! ( ( find ( compose property− o b j e c t member− ! c l a s s l e x ) ˜ noun
( compose property− o b j e c t − mode l e x ) ” presumably ”
( compose property− o b j e c t − cq− ! ant c l a s s l e x ) ˜ noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : prop−&−relation−1−presume
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun prop−&−relation−1−presume ( noun )
” Finds r e l a t i o n s h i p s t h a t a l l members o f t h e c a t e g o r y ’ noun ’ a r e presumably
i n v o l v e d i n and t h e o t h e r o b j e c t s t h a t a r e a l s o i n t h e r e l a t i o n . ”
( let ( r e l a t i o n s )
( setf r e l a t i o n s
# 3 ! ( ( find ( compose r e l − ! o b j e c t 1 member− ! c l a s s l e x ) ˜ noun
( compose r e l − ! o bj e ct − cq− ! & ant ! c l a s s l e x ) ˜ noun
( compose r e l − ! o bj e ct − mode l e x ) ” presumably ” ) ) )
; ; f i n d t h e o b j e c t s a s s o c i a t e d with each o f t h e r e l a t i o n s
(mapcar # ’ ( lambda ( r e l ) ( obj−&−rel−1−presume noun r e l ) ) r e l a t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : obj−&−rel−1−presume
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun obj−&−rel−1−presume ( noun r e l a t i o n )
” Finds t h e o b j e c t s t h a t a r e i n v o l v e d i n t h e s p e c i f i e d r e l a t i o n with
’ noun ’ and r e t u r n s a l i s t c o n s i s t i n g o f t h e r e l a t i o n f o l l o w e d by
the o b j e c t s . ”
( let ( objects )
( setf objects
# 3 ! ( ( find ( compose o b j e c t 2 − ! o b j e c t 1 member− ! c l a s s l e x ) ˜ noun
( compose o b j e c t 2 − ! o bj e ct − cq− ! & ant ! c l a s s l e x ) ˜ noun
( compose o b j e c t 2 − ! o bj e ct − mode l e x ) ” presumably ”
( compose o b j e c t 2 − ! r e l ) ˜ r e l a t i o n ) ) )
(mapcar # ’ ( lambda ( o b j ) ( l i s t r e l a t i o n o b j ) ) o b j e c t s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : prop−&−presume
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun prop−&−presume ( noun )
” Finds p r o p e r t i e s t h a t presumably b e l o n g t o a l l members o f t h e c l a s s ’ noun ’ . ”
# 3 ! ( ( find ( compose property− ! o b j e c t member− ! c l a s s l e x ) ˜ noun
( compose property− ! o bj e ct − mode l e x ) ” presumably ”
( compose property− ! o bj e ct − cq− ! & ant ! c l a s s l e x ) ˜ noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : prop−relation−2−presume
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
28
( defun prop−relation−2−presume ( noun )
” Finds r e l a t i o n s h i p s t h a t ’ noun ’ s a r e i n v o l v e d i n ( where t h e noun
i s t h e o b j e c t 2 ) and t h e o t h e r o b j e c t s t h a t a r e a l s o i n t h e r e l a t i o n . ”
( let ( r e l a t i o n s )
( setf r e l a t i o n s
# 3 ! ( ( find ( compose r e l − ! o b j e c t 2 l e x ) ˜ noun
( compose r e l − ! o b j e c t 1 f o r a l l − ! cq o b j e c t ! o b j e c t 2 l e x ) ˜ nou
n
( compose r e l − ! o b j e c t 1 f o r a l l − ! cq mode l e x ) ” presumably ” ) ) )
; ; f i n d t h e o b j e c t s a s s o c i a t e d with each o f t h e r e l a t i o n s
(mapcar # ’ ( lambda ( r e l ) ( obj−rel−2−presume noun r e l ) ) r e l a t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : obj−rel−2−presume
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun obj−rel−2−presume ( noun r e l a t i o n )
” Finds t h e o b j e c t s t h a t a r e i n v o l v e d i n t h e s p e c i f i e d r e l a t i o n with ’ noun ’
and r e t u r n s a l i s t c o n s i s t i n g o f t h e r e l a t i o n f o l l o w e d by t h e o b j e c t s . ”
( let ( objects )
( setf objects
# 3 ! ( ( find ( compose c l a s s − ! member o b j e ct 1 − ! o b j e c t 2 l e x ) ˜ noun
( compose c l a s s − ! ant− ! cq o b j e c t ! o b j e c t 2 l e x ) ˜ noun
( compose c l a s s − ! ant− ! cq mode l e x ) ” presumably ”
( compose c l a s s − ! member o b j e ct 1 − ! r e l ) ˜ r e l a t i o n ) ) )
(mapcar # ’ ( lambda ( o b j ) ( l i s t o b j r e l a t i o n ) ) o b j e c t s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : prop−&−relation−2−presume
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun prop−&−relation−2−presume ( noun )
” Finds r e l a t i o n s h i p s t h a t ’ noun ’ s a r e i n v o l v e d i n ( where t h e noun i s t h e
o b j e c t 2 ) and t h e o t h e r o b j e c t s t h a t a r e a l s o i n t h e r e l a t i o n . ”
( let ( r e l a t i o n s )
( setf r e l a t i o n s
# 3 ! ( ( find ( compose r e l − ! o b j e c t 2 l e x ) ˜ noun
( compose r e l − ! o b j e c t 1 f o r a l l − ! cq o b j e c t ! o b j e c t 2 l e x ) ˜ nou
n
( compose r e l − ! o b j e c t 1 f o r a l l − ! cq mode ) ” presumably ” ) ) )
; ; f i n d t h e o b j e c t s a s s o c i a t e d with each o f t h e r e l a t i o n s
(mapcar # ’ ( lambda ( r e l ) ( obj−&−rel−2−presume noun r e l ) ) r e l a t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : obj−&−rel−2−presume
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun obj−&−rel−2−presume ( noun r e l a t i o n )
” Finds t h e o b j e c t s t h a t a r e i n v o l v e d i n t h e s p e c i f i e d r e l a t i o n with ’ noun ’
and r e t u r n s a l i s t c o n s i s t i n g o f t h e r e l a t i o n f o l l o w e d by t h e o b j e c t s . ”
( let ( objects )
( setf objects
# 3 ! ( ( find ( compose c l a s s − ! member o b j e ct 1 − ! o b j e c t 2 l e x ) ˜ noun
( compose c l a s s − ! & ant− ! cq o b j e c t ! o b j e c t 2 l e x ) ˜ noun
( compose c l a s s − ! & ant− ! cq mode l e x ) ” presumably ”
29
( compose c l a s s − ! member o b j e ct 1 − ! r e l ) ˜ r e l a t i o n ) ) )
(mapcar # ’ ( lambda ( o b j ) ( l i s t o b j r e l a t i o n ) ) o b j e c t s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : prop−indiv
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun prop−indiv ( noun )
” Finds p r o p e r t i e s t h a t presumably b e l o n g t o a l l members o f t h e c l a s s ’ noun ’ . ”
# 3 ! ( ( find ( compose property− ! o b j e c t member− ! c l a s s l e x ) ˜ noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : prop−relation−1−indiv
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun p r o p − r e l a t i o n − 1 − i n d i v ( noun )
” Finds r e l a t i o n s h i p s t h a t one o r more members o f t h e c a t e g o r y ’ noun ’ a r e
i n v o l v e d i n and t h e o t h e r o b j e c t s t h a t a r e a l s o i n t h e r e l a t i o n . ”
( let ( r e l a t i o n s )
( setf r e l a t i o n s
# 3 ! ( ( find ( compose r e l − ! o b j e c t 1 member− ! c l a s s l e x ) ˜ noun ) ) )
; ; f i n d t h e o b j e c t s a s s o c i a t e d with each o f t h e r e l a t i o n s
(mapcar # ’ ( lambda ( r e l ) ( obj−rel−1−indiv noun r e l ) ) r e l a t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : obj−rel−1−indiv
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun obj−rel−1−indiv ( noun r e l a t i o n )
” Finds t h e o b j e c t s t h a t a r e i n v o l v e d i n t h e s p e c i f i e d r e l a t i o n with ’ noun ’
and r e t u r n s a l i s t c o n s i s t i n g o f t h e r e l a t i o n f o l l o w e d by t h e o b j e c t s . ”
( let ( objects )
( s e t f o b j e c t s # 3 ! ( ( find ( compose o bj e c t2 − ! r e l l e x lex− r e l − ! o b j e c t 1
member− ! c l a s s l e x ) ˜ noun
( compose o b j e c t2 − ! r e l ) ˜ r e l a t i o n ) ) )
(mapcar # ’ ( lambda ( o b j ) ( l i s t r e l a t i o n o b j ) ) o b j e c t s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : prop−relation−2−indiv
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun p r o p − r e l a t i o n − 2 − i n d i v ( noun )
” Finds r e l a t i o n s h i p s t h a t some ’ noun ’ s a r e i n v o l v e d i n ( where t h e noun
i s t h e o b j e c t 2 ) and t h e o t h e r o b j e c t s t h a t a r e a l s o i n t h e r e l a t i o n . ”
( let ( r e l a t i o n s )
( s e t f r e l a t i o n s # 3 ! ( ( find ( compose r e l − ! o b j e c t 2 l e x ) ˜ noun ) ) )
; ; f i n d t h e o b j e c t s a s s o c i a t e d with each o f t h e r e l a t i o n s
(mapcar # ’ ( lambda ( r e l ) ( obj−rel−2−indiv noun r e l ) ) r e l a t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : obj−rel−2−indiv
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
30
( defun obj−rel−2−indiv ( noun r e l a t i o n )
” Finds t h e o b j e c t s t h a t a r e i n v o l v e d i n t h e s p e c i f i e d r e l a t i o n with ’ noun ’
and r e t u r n s a l i s t c o n s i s t i n g o f t h e r e l a t i o n f o l l o w e d by t h e o b j e c t s . ”
( let ( objects )
( setf objects
# 3 ! ( ( find ( compose c l a s s − ! member o b j e ct 1 − ! r e l l e x lex− r e l − !
o b j e c t 2 l e x ) ˜ noun
( compose c l a s s − ! member o b j e ct 1 − ! r e l ) ˜ r e l a t i o n ) ) )
(mapcar # ’ ( lambda ( o b j ) ( l i s t o b j r e l a t i o n ) ) o b j e c t s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findProperties
;;;
i n p u t : a noun t o be d e f i n e d
;;;
output : a l i s t c o n t a i n i n g any g e n e r a l p r o p e r t i e s t h a t a r e known t o
;;;
p e r t a i n t o <noun>s a s a c l a s s .
;;;
m o d i f i e d : mkb 2 0 0 2
;;;
modified : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d P r o p e r t i e s ( noun )
” Finds p r o p e r t i e s t h a t a r e known t o b e l o n g t o a l l t h i n g s which a r e
members o f t h e c l a s s ’ noun ’ . ”
( let ( properties )
( cond
; ; property of a ctgy .
( ( and ( s e t f p r o p e r t i e s ( append p r o p e r t i e s ( prop−rule noun ) ) ) ∗ dmode ∗ )
properties )
; ; p r o p e r t y o f a c t g y , &− r u l e .
( ( and ( s e t f p r o p e r t i e s ( append p r o p e r t i e s ( prop−& noun ) ) ) ∗ dmode ∗ )
properties )
; ; r e l a t i o n with ’ noun ’ a s o b j e c t 1
( ( and ( s e t f p r o p e r t i e s ( append p r o p e r t i e s ( p r o p − r e l a t i o n − 1 noun ) ) )
∗dmode ∗ )
properties )
;;
r e l a t i o n with ’ noun ’ a s o b j e c t 1 , &− r u l e
( ( and ( s e t f p r o p e r t i e s ( append p r o p e r t i e s ( prop−&−r e l a t i o n − 1 noun ) ) )
∗dmode ∗ )
properties )
; ; r e l a t i o n with noun a s o b j e c t 2
( ( and ( s e t f p r o p e r t i e s ( append p r o p e r t i e s ( p r o p − r e l a t i o n − 2 noun ) ) )
∗dmode ∗ )
properties )
; ; r e l a t i o n with noun a s o b j e c t 2 , &− r u l e
( ( and ( s e t f p r o p e r t i e s ( append p r o p e r t i e s ( prop−&−r e l a t i o n − 2 noun ) ) )
∗dmode ∗ )
properties )
; ; i f we a r e i n t e a c h i n g mode r e t u r n t h e i n f o we have accumulated ,
;;
i f we a r e i n d e f i n i t i o n mode r e t u r n n i l
( t properties ))))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findProbableProperties
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d P r o b a b l e P r o p e r t i e s ( noun )
” Finds p r o p e r t i e s t h a t a r e presumed t o b e l o n g t o a l l t h i n g s which a r e
31
members o f t h e c l a s s ’ noun ’ . ”
( let ( properties )
( cond
; ; presumable p r o p e r t y
( ( and ( s e t f p r o p e r t i e s ( append p r o p e r t i e s
properties )
; ; presumable p r o p e r t y &− r u l e
( ( and ( s e t f p r o p e r t i e s ( append p r o p e r t i e s
properties )
; ; presumable r e l a t i o n , o b j e c t 2 i s not i n
( ( and ( s e t f p r o p e r t i e s ( append p r o p e r t i e s
∗dmode ∗ )
properties )
; ; presumable r e l a t i o n , o b j e c t 2 i s not i n
( ( and ( s e t f p r o p e r t i e s ( append p r o p e r t i e s
( prop−presume noun ) ) ) ∗ dmode ∗ )
( prop−&−presume noun ) ) ) ∗ dmode ∗ )
any c a t e g o r y
( prop−relation−1−presume noun ) ) )
any c a t e g o r y , &− r u l e
( prop−&−relation−1−presume noun ) )
)
∗dmode ∗ )
properties )
; ; presumable r e l a t i o n
( ( and ( s e t f p r o p e r t i e s
∗dmode ∗ )
properties )
; ; presumable r e l a t i o n
( ( and ( s e t f p r o p e r t i e s
with noun a s o b j e c t 2
( append p r o p e r t i e s ( prop−relation−2−presume
noun ) ) )
with noun a s o b j e c t 2
( append p r o p e r t i e s ( prop−&−relation−2−presume noun ) )
)
∗dmode ∗ )
properties )
; ; i f we a r e i n t e a c h i n g mode r e t u r n t h e i n f o we have accumulated ,
; ; i f we a r e i n d e f i n i t i o n mode r e t u r n n i l
( t properties ))))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findPossibleProperties
;;;
i n p u t : a noun t o be d e f i n e d
;;;
output : a l i s t o f p r o p e r t i e s a t t r i b u t e d t o any o b j e c t o f type <noun>
;;;
m o d i f i e d : mkb 2 0 0 2
;;;
modified : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d P o s s i b l e P r o p e r t i e s ( noun )
” Finds p r o p e r t i e s t h a t b e l o n g t o a t l e a s t one t h i n g which i s a member
o f t h e c l a s s ’ noun ’ . ”
( append
; ; p r o p e r t y b e l o n g i n g t o a ’ noun ’
( prop−indiv noun )
; ; r e l a t i o n with ’ noun ’ a s o b j e c t 1
( p r o p − r e l a t i o n − 1 − i n d i v noun )
; ; r e l a t i o n with noun a s o b j e c t 2
( p r o p − r e l a t i o n − 2 − i n d i v noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
SPATIAL INFORMATION SECTION
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findSpatial
;;;
created : stn 2002
32
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d S p a t i a l ( noun )
” I f ’ noun ’ i s a l o c a t i o n , f i n d t h i n g s t h a t can o c c u r i n t h e l o c a t i o n
or t h a t a r e t r u e i n t h e l o c a t i o n ”
( append ( l o c − c l s noun )
( l o c − c l s − c a t noun )
( l o c − s t r noun )
( l o c − s t r − c a t noun )
( loc−act−obj noun )
( loc−act−obj−cat noun )
( loc−prop noun )
( loc−prop−cat noun )
( l o c − r e l noun )
( l o c − r e l − c a t noun )
( loc−own noun )
( loc−own−cat noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : loc−cls
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun l o c − c l s ( noun )
” Find t h i n g s t h a t a r e members o f a c l a s s i n t h e l o c a t i o n ’ noun ’ ”
( l e t (mem c l s )
( s e t f mem # 3 ! ( ( find ( compose member− ! o b je ct − ! l o c a t i o n l e x ) ˜ noun ) ) )
( s e t f c l s # 3 ! ( ( find ( compose c l a s s − ! o b j e ct − ! l o c a t i o n l e x ) ˜ noun ) ) )
( i f ( and mem c l s )
( l i s t ( append mem c l s ) )
nil )))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : loc−cls
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun l o c − c l s − c a t ( noun )
” Find t h i n g s t h a t a r e members o f a c l a s s i n t h e c a t e g o r y o f l o c a t i o n s ’ noun ’ ”
( l e t (mem c l s )
( s e t f mem
# 3 ! ( ( find ( compose member− ! o b j e ct − ! l o c a t i o n member− ! c l a s s l e x )
˜noun ) ) )
( setf c l s
# 3 ! ( ( find ( compose c l a s s − ! o bj e ct − ! l o c a t i o n member− ! c l a s s l e x )
˜noun ) ) )
( i f ( and mem c l s )
( l i s t ( append mem c l s ) )
nil )))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : loc−str
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun l o c − s t r ( noun )
” Find t h i n g s t h a t a r e p a r t s o f a whole i n t h e l o c a t i o n ’ noun ’ ”
( l e t ( p r t whl )
( s e t f p r t # 3 ! ( ( find ( compose part− ! o bj e ct − ! l o c a t i o n l e x ) ˜ noun ) ) )
33
( s e t f whl # 3 ! ( ( find ( compose whole− ! o b j e ct − ! l o c a t i o n l e x ) ˜ noun ) ) )
( i f ( and whl p r t )
( l i s t ( append whl p r t ) )
nil )))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : loc−str−cat
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun l o c − s t r − c a t ( noun )
” Find t h i n g s t h a t a r e p a r t s o f a whole i n t h e c a t e g o r y o f l o c a t i o n s ’ noun ’ ”
( l e t ( p r t whl )
( setf prt
# 3 ! ( ( find ( compose part− ! o bj e c t − ! l o c a t i o n member− ! c l a s s l e x )
˜noun ) ) )
( s e t f whl
# 3 ! ( ( find ( compose whole− ! o bj e c t − ! l o c a t i o n member− ! c l a s s l e x )
˜noun ) ) )
( i f ( and whl p r t )
( l i s t ( append whl p r t ) )
nil )))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : loc−act−obj
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun loc−act−obj ( noun )
” Find a g e n t s , t h e a c t i o n s t h a t they p er fo r m i n t h e l o c a t i o n ’ noun ’ , and t h e
o b j e c t s of the a c t i o n s . ”
( l e t ( ag a c t o b j )
( s e t f ag # 3 ! ( ( find ( compose agent− o b j e c t − ! l o c a t i o n l e x ) ˜ noun ) ) )
( s e t f a c t # 3 ! ( ( find ( compose action− act− o b j e ct − ! l o c a t i o n l e x ) ˜ noun ) ) )
( s e t f o b j # 3 ! ( ( find ( compose o b j e c t − act− ob j e ct − ! l o c a t i o n l e x ) ˜ noun ) ) )
( i f ( and ag a c t o b j )
( l i s t ( append ag a c t o b j ) )
nil )))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : loc−act−obj−cat
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun loc−act−obj−cat ( noun )
” Find a g e n t s , t h e a c t i o n s t h a t th ey pe rf orm i n t h e c a t e g o r y o f l o c a t i o n s
’ noun ’ , and t h e o b j e c t s o f t h e a c t i o n s . ”
( l e t ( ag a c t o b j )
( s e t f ag
# 3 ! ( ( find ( compose agent− o bj e c t − ! l o c a t i o n member− ! c l a s s l e x ) ˜ noun ) )
)
( s e t f a c t # 3 ! ( ( find ( compose action− act− o b j e ct − ! l o c a t i o n
member− ! c l a s s l e x ) ˜ noun ) ) )
( s e t f o b j # 3 ! ( ( find ( compose o b j e c t − act− ob j e ct − ! l o c a t i o n
member− ! c l a s s l e x ) ˜ noun ) ) )
( i f ( and ag a c t o b j )
( l i s t ( append ag a c t o b j ) )
nil )))
34
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : loc−prop
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun loc−prop ( noun )
” Find o b j e c t s and t h e i r p r o p e r t i e s which o c c u r i n t h e l o c a t i o n ’ noun ’ . ”
( l e t ( o b j prop )
( s e t f o b j # 3 ! ( ( find ( compose ob j e ct − ! o b je ct − ! l o c a t i o n l e x ) ˜ noun ) ) )
( s e t f prop # 3 ! ( ( find ( compose property− ! o b je ct − ! l o c a t i o n l e x ) ˜ noun ) ) )
( i f ( and o b j prop )
( l i s t ( append o b j prop ) )
nil )))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : loc−prop−cat
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun loc−prop−cat ( noun )
” Find o b j e c t s and t h e i r p r o p e r t i e s which o c c u r i n t h e c a t e g o r y
o f l o c a t i o n s ’ noun ’ . ”
( l e t ( o b j prop )
( s e t f o b j # 3 ! ( ( find ( compose ob j e ct − ! o b je ct − ! l o c a t i o n
member− ! c l a s s l e x ) ˜ noun ) ) )
( s e t f prop # 3 ! ( ( find ( compose property− ! o b je ct − ! l o c a t i o n
member− ! c l a s s l e x ) ˜ noun ) ) )
( i f ( and o b j prop )
( l i s t ( append o b j prop ) )
nil )))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : loc−rel
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun l o c − r e l ( noun )
” Find o b j e c t s t h a t have some r e l a t i o n s h i p i n t h e l o c a t i o n ’ noun ’ . ”
( let ( obj1 r e l a t i o n obj2 )
( s e t f o b j 1 # 3 ! ( ( find ( compose o bj e c t1 − o bj e ct − ! l o c a t i o n l e x ) ˜ noun ) ) )
( s e t f o b j 2 # 3 ! ( ( find ( compose o bj e c t2 − o bj e ct − ! l o c a t i o n l e x ) ˜ noun ) ) )
( s e t f r e l a t i o n # 3 ! ( ( find ( compose r e l − o bj e ct − ! l o c a t i o n l e x ) ˜ noun ) ) )
( i f ( and o b j 1 r e l a t i o n o b j 2 )
( l i s t ( append o b j 1 r e l a t i o n o b j 2 ) )
nil )))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : loc−rel−cat
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun l o c − r e l − c a t ( noun )
” Find o b j e c t s t h a t have some r e l a t i o n s h i p i n t h e c a t e g o r y o f l o c a t i o n s
’ noun ’ . ”
( let ( obj1 r e l a t i o n obj2 )
( s e t f o b j 1 # 3 ! ( ( find ( compose o bj e c t1 − ob j e ct − ! l o c a t i o n
member− ! c l a s s l e x ) ˜ noun ) ) )
35
( s e t f o b j 2 # 3 ! ( ( find ( compose o bj e c t 2 − o bj e c t − ! l o c a t i o n
member− ! c l a s s l e x ) ˜ noun ) ) )
( s e t f r e l a t i o n # 3 ! ( ( find ( compose r e l − o b j e c t − ! l o c a t i o n
member− ! c l a s s l e x ) ˜ noun ) ) )
( i f ( and o b j 1 r e l a t i o n o b j 2 )
( l i s t ( append o b j 1 r e l a t i o n o b j 2 ) )
nil )))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : loc−own
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun loc−own ( noun )
” Find owners and t h e t h i n g s th ey own i n t h e l o c a t i o n ’ noun ’ . ”
( l e t ( owner prp ty )
( s e t f owner
# 3 ! ( ( find ( compose p o s s e s s o r − ! o b je c t − ! l o c a t i o n l e x ) ˜ noun ) ) )
; ; I assume t h a t t h e n a t u r e o f t h e p r o p e r t y owned by a p o s s e s o r i s
;;
b e s t d e s c r i b e d by t h e ’ r e l ’ a r c i n t h e o b j e c t − r e l − p o s s e s s o r
;;
c a s e frame ( e . g . g i v e n o b j e c t − p y e w a c k e t − r e l − c a t − p o s s e s s o r − p e r s o n
;;
i t i s b e t t e r t o say ” a p e r s o n owns a c a t ” than ” a p e r s o n owns
;;
pyewacket ”
( s e t f p rp ty # 3 ! ( ( find ( compose r e l − ! o b j e ct − ! l o c a t i o n l e x ) ˜ noun ) ) )
( i f ( and owner prpty )
( l i s t ( append owner pr pty ) )
nil )))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : loc−own−cat
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun loc−own−cat ( noun )
” Find owners and t h e t h i n g s th ey own i n t h e c a t e g o r y o f l o c a t i o n s ’ noun ’ . ”
( l e t ( owner p rp ty )
( s e t f owner # 3 ! ( ( find ( compose p o s s e s s o r − ! o b j e ct − ! l o c a t i o n
member− ! c l a s s l e x ) ˜ noun ) ) )
( s e t f p rp ty # 3 ! ( ( find ( compose r e l − ! o b j e ct − ! l o c a t i o n
member− ! c l a s s l e x ) ˜ noun ) ) )
( i f ( and owner pr pty )
( l i s t ( append owner pr pty ) )
nil )))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
OWNERSHIP SECTION
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : owner−rel
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun owner−rel ( noun )
” Finds t h i n g s which own a ’ noun ’ , where t h e noun i s s p e c i f i e d
by a ’ r e l ’ a r c . ”
# 3 ! ( ( find ( compose c l a s s − ! member p o s s e s s o r − ! r e l l e x ) ˜ noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
36
;;;
;;;
f u n c t i o n : owner−poss
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun owner−poss ( noun )
” Finds t h i n g s which own a ’ noun ’ , where some member o f t h e c l a s s
’ noun ’ i s t h e o b j e c t and t h e r e l a t i o n between t h e owner and ’ noun ’ . ”
( l e t ( owners r e l )
( s e t f owners
# 3 ! ( ( find ( compose c l a s s − ! member
p o s s e s s o r − ! o b j e c t member− ! c l a s s l e x ) ˜ noun ) ) )
; ; f i n d r e l a t i o n s a s s o c i a t e d with each o f t h e owners
(mapcar # ’ ( lambda ( own ) ( rel−for−owner noun own ) ) owners ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : rel−for−owner
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun rel−for−owner ( noun owner )
” Finds r e l a t i o n s where ’ owner ’ i s a p o s s e s s o r o f a ’ noun ’ . ”
( let ( r e l )
; ; find relations
( setf r e l
# 3 ! ( ( find ( compose r e l − ! o b j e c t member− ! c l a s s l e x ) ˜ noun
( compose r e l − ! p o s s e s s o r member− ! c l a s s ) ˜ owner ) ) )
; ; e l i m i n a t e t h e noun i t s e l f from t h e l i s t o f r e l a t i o n s
( s e t f r e l ( s e t − d i f f e r e n c e r e l # 3 ! ( ( find l e x ˜ noun ) ) ) )
; ; i f t h e r e were any r e l a t i o n s o t h e r than t h e noun i t s e l f , j o i n them
;;
with t h e owner and r e t u r n t h a t l i s t , o t h e r w i s e r e t u r n n i l
( i f ( not ( nu ll r e l ) )
( cons owner r e l )
nil )))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : findOwners
;;;
i n p u t : a noun t o be d e f i n e d
;;;
output : a l i s t o f t h o s e t h i n g s which p o s s e s s any o b j e c t o f
;;;
typ e <noun>
;;;
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun findOwners ( noun )
” Find t h i n g s t h a t can own a ’ noun ’ . ”
; ; f i n d owners & g e t r i d o f any s t r a y ’ n i l ’ s t h a t may have c r e p t
;;
i n t o the l i s t
( s e t − d i f f e r e n c e ( append ( owner−rel noun ) ( owner−poss noun ) ) ’ ( n i l ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
INDIVIDUALS SECTION
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findNamedIndividuals
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d N a m e d I n d i v i d u a l s ( noun )
37
” Find t h e p r o p e r names o f i n d i v i d u a l s who a r e members o f t h e c l a s s noun . ”
; ; find individuals
( named−indiv noun ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : named−indiv
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun named−indiv ( noun )
” Finds i n d i v i d u a l s with p r o p e r names who a r e members o f t h e b a s i c
l e v e l c l a s s noun . ”
# 3 ! ( ( find ( compose proper−name− ! o b j e c t member− ! c l a s s l e x ) ˜ noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
AGENTS WHO ACT ON ’NOUN’ S SECTION
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : agent−object
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun a g e n t − o b j e c t ( noun )
” Find a g e n t s who p e r f o rm a c t i o n s on ’ noun ’ s and t h e a c t i o n s t h a t they
p erf or m . ”
( let ( agents )
( s e t f a g e n t s # 3 ! ( ( find ( compose agent− ! a c t o b j e c t
member− ! c l a s s l e x ) ˜ noun ) ) )
; ; now f i n d t h e a c t i o n s t h a t each a g e n t p e r f o r m s on ’ noun ’ s .
(mapcar # ’ ( lambda ( ag ) ( a c t i o n − o b j e c t noun ag ) ) a g e n t s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : action−object
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun a c t i o n − o b j e c t ( noun ag )
” Find a c t i o n s p e r f o r m e d on ’ noun ’ s by ’ ag ’ . ”
; ; The act− ! a c t g o e s up and down t h e same a r c , we need t o do t h i s
;;
b e c a u s e we o n l y want t o f i n d a c t i o n s t h a t C a s s i e b e l i e v e s .
( let ( actions )
( s e t f a c t i o n s # 3 ! ( ( find ( compose action− act− ! a c t o b j e c t
member− ! c l a s s l e x ) ˜ noun
( compose action− act− ! a g e n t ) ˜ ag ) ) )
; ; make a l i s t o f l i s t s −− t h e i n n e r l i s t s a r e p a i r s o f a g e n t s and a c t i o n s
; ; t h a t they p e rf o r m −− t h e o u t e r l i s t c o n s i s t o f f a l l p a i r s i n v o l v i n g t h e
; ; same a g e n t
(mapcar # ’ ( lambda ( a c t ) ( l i s t ag a c t ) ) a c t i o n s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : findAgents
;;;
i n p u t : a noun t o be d e f i n e d
;;;
r e t u r n s : a l i s t o f t h e a g e n t ( s ) and a c t ( s ) f o r which <noun>
;;;
s e r v e s a s o b j e c t i n an a g e n t − a c t − o b j e c t c a s e frame .
;;;
;;;
m o d i f i e d : mkb 0 4 / 2 0 0 2
38
;;;
modified : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun f i n d A g e n t s ( noun )
” Find a g e n t s who p e r f o r m a c t i o n s on ’ noun ’ s and t h e a c t i o n s t h a t
they p er f or m . ”
( let ( agents )
( cond
( ( and ( s e t f a g e n t s ( append a g e n t s ( a g e n t − o b j e c t noun ) ) ) ∗ dmode ∗ )
agents )
; ; i f we a r e i n t e a c h i n g mode r e t u r n t h e i n f o we have accumulated ,
;;
e l s e return n i l
( t agents )
)))
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
SYNONYMS SECTION
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : syn−syn
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun syn−syn ( noun )
” Finds t h i n g s which a r e e x p l i c i t l y marked a s synonyms o f ’ noun ’ . ”
# 3 ! ( ( find ( compose synonym− ! synonym l e x ) ˜ noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : syn−sub−sup
;;;
created : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun syn−sub−sup ( s u p e r c l a s s e s )
” Finds s u b c l a s s e s o f t h e g i v e n l i s t o f s u p e r c l a s s e s . ”
# 3 ! ( ( find ( compose lex− s u b c l a s s − ! s u p e r c l a s s ) ˜ s u p e r c l a s s e s ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : findSynonyms
;;;
i n p u t : a noun t o be d e f i n e d
;;;
output : a l i s t o f synonyms and p o s s i b l e synonyms o f <noun>
;;;
;;;
w r i t t e n : kae ? ? / ? ? / 9 2
;;;
m o d i f i e d : kae 0 5 / 1 2 / 9 4
;;;
modified : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun findSynonyms ( noun )
” Find words t h a t a r e s p e c i f i c a l l y marked a s synonyms o f ’ noun ’ . ”
; ; f i n d t h i n g s t h a t a r e e x p l i c i t l y l a b e l e d a s synonyms o f ’ noun ’ .
( removeElement noun ( syn−syn noun ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
function :
eliminateClassInclusions
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun e l i m i n a t e C l a s s I n c l u s i o n s ( p o s s i b l e S y n o n y m s s u p e r c l a s s e s )
”Remove a n y t h i n g i n t h e l i s t s u p e r c l a s s e s from t h e l i s t p o s s i b l e S y n o n y m s ”
( s e t − d i f f e r e n c e possibleSynonyms ( r ep ort s u p e r c l a s s e s )
39
: t e s t #’ compareAsString ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
f u n c t i o n : compareAsString
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun compareAsString ( a b )
”Compare a and b a s s t r i n g s . This i s f o r u s e s p e c i f i c a l l y with t h e f u n c t i o n
eliminateClassInclusions . ”
( string = ( getNodeString a ) ( string b ) ) )
( defun f i n d P o s s i b l e S y n o n y m s ( noun s t r u c t u r a l E l e m e n t s s u p e r c l a s s e s
owners synonyms )
” Find words t h a t have d e f i n i t i o n s which a r e s i m i l a r t o t h e d e f i n i t i o n
o f ’ noun ’ . ”
( let ( possibleSynonyms )
; ; f i n d t h i n g s t h a t a r e s u b c l a s s e s o f t h e same s u p e r c l a s s e s a s ’ noun ’ ,
;;
e . g . i f we a r e t r y i n g t o d e f i n e ’ c a t ’ , and we know t h a t c a t s and
;;
dogs a r e both s u b c l a s s e s o f mammal , then t h i s w i l l f i n d ’ dog ’ .
( s e t f p o s s i b l e S y n o n y m s ( syn−sub−sup s u p e r c l a s s e s ) )
; ; s i n c e ’ noun ’ i s i t s e l f a s u b c l a s s o f i t s s u p e r c l a s s , remove
;;
’ noun ’ from t h e l i s t
( s e t f p o s s i b l e S y n o n y m s ( removeElement noun p o s s i b l e S y n o n y m s ) )
; ; s u p e r c l a s s e s a r e not synonyms , they a r e c l a s s i n c l u s i o n s , s o i f
; ; any snuck i n t o t h e l i s t o f p o s s i b l e synonyms , g e t r i d o f them .
( setf possibleSynonyms
( e l i m i n a t e C l a s s I n c l u s i o n s possibleSynonyms s u p e r c l a s s e s ) )
; ; e x p l i c i t synonyms a r e o b v i o u s l y not p o s s i b l e synonyms −−
;;
they a r e d e f i n i t e synonyms , s o we need t o g e t r i d o f them
( s e t f p o s s i b l e S y n o n y m s ( s e t − d i f f e r e n c e p o s s i b l e S y n o n y m s synonyms ) )
; ; THE NEXT TWO FUNCTIONS REALLY IMPLEMENT KE’ S THEORY OF WHAT IS
; ; A POSSIBLY SIMILAR ITEM AND WHAT IS NOT.
; ; g e t r i d o f any p o s s i b l e synonyms whose s u p e r c l a s s e s a r e not
;;
s u f f i c i e n t l y s i m i l a r t o t h e s u p e r c l a s s e s o f ’ noun ’
( setf possibleSynonyms
( e l i m i n a t e D i s s i m i l a r C l a s s e s s u p e r c l a s s e s possibleSynonyms ) )
; ; g e t r i d o f any p o s s i b l e synonyms whose s t r u c t u r a l f e a t u r e s a r e not
;;
s u f f i c i e n t l y s i m i l a r t o t h e s t r u c t u r a l f e a t u r e s o f ’ noun ’
( setf possibleSynonyms
( e l i m i n a t e D i s s i m i l a r S t r u c t u r e structuralElements possibleSynonyms ) )
; ; g e t r i d o f any p o s s i b l e synonyms whose o w n e r s h i p r e l a t i o n s a r e not
;;
s u f f i c i e n t l y s i m i l a r t o t h e o w n e r s h i p r e l a t i o n s o f ’ noun ’
; ; ( s e t f possibleSynonyms
; ; ( e l i m i n a t e D i s s i m i l a r O w n e r s owners p o s s i b l e S y n o n y m s n i l ) )
; ; r e t u r n t h e r e m a i n i n g synonmys
possibleSynonyms ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
function : eliminateDissimilarClasses
;;;
input :
s u p e r s , a l i s t o f t h e s u p e r c l a s s e s o f t h e t a r g e t noun ;
;;;
p o s s i b l e S y n o n y m s , a l i s t o f p o s s i b l e synonyms f o r t h e
;;;
t a r g e t noun
;;;
v e r i f i e d S y n o n y m s , a l i s t o f t h o s e p o s s i b l e synonmys
;;;
t h a t s u r v i v e comparison o f s u p e r c l a s s e s ( i n i t i a l l y n i l )
;;;
returns : verifiedSynonyms
;;;
w r i t t e n : kae ? ? / ? ? / 9 2
40
;;;
m o d i f i e d : kae 0 5 / 1 2 / 9 4
;;;
modified : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun e l i m i n a t e D i s s i m i l a r C l a s s e s ( s u p e r s p o s s i b l e S y n o n y m s
&o p t i o n a l v e r i f i e d S y n o n y m s )
”Examine each o f t h e e l e m e n t s o f ’ p o s s i b l e S y n o n y m s ’ and e l i m i n a t e
any synonyms whose c l a s s i n c l u s i o n s a r e not s u f f i c i e n t l y s i m i l a r
t o t h e c l a s s i n c l u s i o n s o f ’ noun ’ . ”
( cond
; ; i f t h e r e a r e no more p o s s i b e synonyms , r e t u r n t h e l i s t o f
;;
v e r i f i e d synonyms
( ( null p o s s i b l e S y n o n y m s ) v e r i f i e d S y n o n y m s )
; ; i f t h e s u p e r c l a s s e s o f ’ noun ’ a r e s u f f i c i e n t l y s i m i l a r t o t h e
;;
s u p e r c l a s s e s o f t h e f i r s t p o s s i b l e synonym on t h e l i s t
;;
’ p o s s i b l e S y n o n y m s ’ then add t h e p o s s i b l e synonym
;;
t o t h e l i s t ’ v e r i f i e d S y n o n y m s ’ and che ck t h e r e s t o f ’ p o s s i b l e S y n o n y m s ’
(( similarSuperclassesp
s u p e r s ( union
( f i n d C l a s s I n c l u s i o n s ( f i r s t possibleSynonyms ) )
( f i n d P r o b a b l e C l a s s I n c l u s i o n s ( f i r s t possibleSynonyms ) ) ) )
( e l i m i n a t e D i s s i m i l a r C l a s s e s supers ( rest possibleSynonyms )
( cons ( f i r s t p o s s i b l e S y n o n y m s ) v e r i f i e d S y n o n y m s ) ) )
; ; i n t h i s c a s e , t h e s e t s o f s u p e r c l a s s e s examined above
;;
were not s u f f i c i e n t l y s i m i l a r , s o do not add t h e f i r s t e l e m e n t o f
;;
the l i s t ’ possibleSynonyms ’ to ’ verifiedSynoynms ’
;;
( t h e r e b y removing i t ) and c he ck t h e r e s t o f ’ p o s s i b l e S y n o n y m s ’
( t ( e l i m i n a t e D i s s i m i l a r C l a s s e s supers ( rest possibleSynonyms )
verifiedSynonyms ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : similarSuperclassesp (a predicate )
;;;
i n p u t : two l i s t s o f s u p e r c l a s s e s , s u p e r c l a s s e s O f N o u n i s t h e
;;;
s u p e r c l a s s e s o f t h e t a r g e t noun ; s u p e r c l a s s e s O f S y n o n y m
;;;
i s t h e s u p e r c l a s s e s o f a p o s s i b l e synonym .
;;;
r e t u r n s t i f t a r g e t and p o s s i b l e synonym b e l o n g t o s i m i l a r l i s t s o f
;;;
superclasses , n i l otherwise .
;;;
modified : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun s i m i l a r S u p e r c l a s s e s p ( s u p e r c l a s s e s O f N o u n s u p e r c l a s s e s O f S y n o n y m )
” Return t i f t h e two l i s t s o f s u p e r c l a s s e s a r e s u f f i c i e n t l y s i m i l a r . ”
; ; return true i f :
(and
; ; t h e two s e t s o f s u p e r c l a s s have a t l e a s t a s many e l e m e n t s i n common
;;
a s the y have e l e m e n t s which a r e d i f f e r e n t
(>= ( length ( i n t e r s e c t i o n s u p e r c l a s s e s O f N o u n s u p e r c l a s s e s O f S y n o n y m ) )
( length ( union ( s e t − d i f f e r e n c e s u p e r c l a s s e s O f N o u n s u p e r c l a s s e s O f S y n o n y m )
( s e t − d i f f e r e n c e superclassesOfSynonym superclassesOfNoun ) )
))
; ; the y s h a r e a t l e a s t two s u p e r c l a s s e s
(>= ( length ( i n t e r s e c t i o n s u p e r c l a s s e s O f N o u n s u p e r c l a s s e s O f S y n o n y m ) ) 2 )
; ; none o f t h e i r s u p e r c l a s s e s a r e l a b e l e d a s antonyms
( noAntonymsp s u p e r c l a s s e s O f N o u n s u p e r c l a s s e s O f S y n o n y m ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : noAntonymsp ( a p r e d i c a t e )
;;;
i n p u t : two l i s t s o f s u p e r c l a s s e s , s u p e r c l a s s e s O f N o u n i s t h e
41
;;;
s u p e r c l a s s e s o f t h e t a r g e t noun ; s u p e r c l a s s e s O f S y n o n y m
;;;
i s t h e s u p e r c l a s s e s o f a p o s s i b l e synonym .
;;;
r e t u r n s n i l i f an an e l e m e n t o f one l i s t has an antonym i n t h e o t h e r ,
;;;
t otherwise .
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun noAntonymsp ( s u p e r c l a s s e s O f N o u n s u p e r c l a s s e s O f S y n o n y m )
” Return t i f t h e r e a r e no members o f ’ s u p e r c l a s s e s O f N o u n ’ which a r e
e x p l i c i t l y l a b e l e d a s an antonym o f any member o f ’ s u p e r c l a s s e s O f S y n o n y m ’ ,
n i l otherwise . ”
( cond ( ( nu ll s u p e r c l a s s e s O f N o u n ) t )
( t ( i f ( nu ll ( antonymp ( f i r s t s u p e r c l a s s e s O f N o u n )
superclassesOfSynonym ) )
( noAntonymsp ( r e s t s u p e r c l a s s e s O f N o u n )
superclassesOfSynonym ) ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : antonymp ( a p r e d i c a t e )
;;;
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun antonymp ( c l a s s s u p e r c l a s s e s O f S y n o n y m )
” Return t i f t h e r e i s a t l e a s t one e x p l i c i t l y l a b e l e d antonym o f ’ c l a s s ’
among t h e l i s t o f c l a s s e s ’ s u p e r c l a s s e s O f S y n o n y m ’ , n i l o t h e r w i s e . ”
( i n t e r s e c t i o n # 3 ! ( ( find ( compose antonym− ! antonym ) ˜ c l a s s ) )
( removeElement ( getNodeName c l a s s ) s u p e r c l a s s e s O f S y n o n y m ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
function : eliminateDissimilarStructure
;;;
input :
structuralElements , a l i s t of s t r u c t u r a l elements
;;;
o f t h e t a r g e t noun p o s s i b l e S y n o n y m s , a l i s t o f p o s s i b l e
;;;
synonyms f o r t h e t a r g e t noun v e r i f i e d S y n o n y m s , a l i s t o f
;;;
t h o s e p o s s i b l e synonmys t h a t s u r v i v e
;;;
comparison o f s t r u c t u r e ( i n i t i a l l y n i l ) .
;;;
returns : verifiedSynonyms
;;;
w r i t t e n : kae ? ? / ? ? / 9 2
;;;
m o d i f i e d : kae 0 5 / 1 2 / 9 4
;;;
modified : stn 2002
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun e l i m i n a t e D i s s i m i l a r S t r u c t u r e ( s t r u c t u r a l E l e m e n t s p o s s i b l e S y n o n y m s
&o p t i o n a l v e r i f i e d S y n o n y m s )
”Examine each e l e m e n t o f ’ p o s s i b l e S y n o n y m s ’ and remove i t from t h e l i s t
i f i t s s t r u c t u r a l e l e m e n t s a r e not s u f f i c i e n t l y s i m i l a r t o
’ structuralElements ’ . ”
( cond
; ; i f t h e r e a r e no more p o s s i b l e synonyms t o examine , r e t u r n t h e l i s t
;;
o f v e r i f i e d synonyms
( ( null p o s s i b l e S y n o n y m s ) v e r i f i e d S y n o n y m s )
; ; i f t h e f i r s t e l e m e n t o f ’ p o s s i b l e S y n o n y m s ’ has a l i s t o f s t r u c t u r a l
;;
elements that i s s u f f i c i e n t l y s i m i l a r to the s t r u c t u r a l elements of
;;
’ noun ’ then add i t t o t h e l i s t o f v e r i f i e d synonyms and ch eck t h e
;;
r e s t of the l i s t .
(( similarStructurep structuralElements
( append ( f i n d S t r u c t u r e ( f i r s t p o s s i b l e S y n o n y m s ) )
( findProbableStructure ( f i r s t possibleSynonyms ) ) ) )
( e l i m i n a t e D i s s i m i l a r S t r u c t u r e s t r u c t u r a l E l e m e n t s ( rest possibleSynonyms )
( cons ( f i r s t p o s s i b l e S y n o n y m s ) v e r i f i e d S y n o n y m s ) ) )
; ; don ’ t put t h e f i r s t e l e m e n t o f ’ p o s s i b l e S y n o n y m s ’ i n t o t h e
;;
l i s t o f v e r i f i e d synonyms and keep c h e c k i n g t h e r e s t o f t h e l i s t
42
( t ( e l i m i n a t e D i s s i m i l a r S t r u c t u r e s t r u c t u r a l E l e m e n t s ( rest possibleSynonyms )
verifiedSynonyms ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : similarStructurep ( a predicate )
;;;
i n p u t : two l i s t s o f s t r u c t u r a l e l e m e n t s s , s t r u c t u r e O f N o u n i s t h e
;;;
s t r u c t u r e o f t h e t a r g e t noun ; structureOfSynonym i s
;;;
t h e s t r u c t u r e o f a p o s s i b l e synonym .
;;;
r e t u r n s t i f t a r g e t and p o s s i b l e synonym have s i m i l a r l i s t s o f
;;;
s t r u c t u r a l elements , n i l otherwise .
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun s i m i l a r S t r u c t u r e p ( s t r u c t u r e O f N o u n structureOfSynonym )
” Return t i f t h e r e a r e more e l e m e n t s s h a r e d by t h e two s e t s o f i n p u t
l i s t s than e l e m e n t s t h a t s e p a r a t e them . ”
(>= ( length ( i n t e r s e c t i o n s t r u c t u r e O f N o u n structureOfSynonym ) )
( length ( union ( s e t − d i f f e r e n c e s t r u c t u r e O f N o u n structureOfSynonym )
( s e t − d i f f e r e n c e structureOfSynonym s t r u c t u r e O f N o u n ) ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
function : eliminateDissimilarOwners
;;;
input :
noun , t h e t a r g e t b e i n g d e f i n e d
;;;
p o s s i b l e S y n o n y m s , a l i s t o f p o s s i b l e synonyms f o r t h e
;;;
t a r g e t noun v e r i f i e d S y n o n y m s , a l i s t o f t h o s e p o s s i b l e
;;;
synonmys t h a t s u r v i v e comparison o f o w n e r s h i p o r
;;;
p a r t / whole r e l a t i o n ( i n i t i a l l y n i l ) .
;;;
returns : verifiedSynonyms
;;;
w r i t t e n : kae ? ? / ? ? / 9 2
;;;
m o d i f i e d : kae 0 5 / 1 2 / 9 4
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun e l i m i n a t e D i s s i m i l a r O w n e r s ( owners p o s s i b l e S y n o n y m s v e r i f i e d S y n o n y m s )
”Examine each e l e m e n t o f ’ p o s s i b l e S y n o n y m s ’ and remove i t from t h e l i s t
i f i t s owners a r e not s u f f i c i e n t l y s i m i l a r t o t h e owners o f ’ noun ’ . ”
( cond
; ; i f t h e r e a r e no more p o s s i b l e synonyms t o examine , r e t u r n t h e
;;
l i s t o f v e r i f i e d synonyms
( ( nu ll p o s s i b l e S y n o n y m s ) v e r i f i e d S y n o n y m s )
; ; i f t h e f i r s t e l e m e n t o f ’ p o s s i b l e S y n o n y m s ’ has a l i s t o f owners t h a t i s
;;
s u f f i c i e n t l y s i m i l a r t o t h e owners o f ’ noun ’ then add i t t o t h e l i s t o f
;;
v e r i f i e d synonyms and ch e c k t h e r e s t o f t h e l i s t .
( ( s i m i l a r O w n e r s p owners ( findOwners ( f i r s t p o s s i b l e S y n o n y m s ) ) )
( e l i m i n a t e D i s s i m i l a r O w n e r s owners ( r e s t p o s s i b l e S y n o n y m s )
( append ( l i s t ( f i r s t p o s s i b l e S y n o n y m s ) ) v e r i f i e d S y n o n y m s ) ) )
; ; don ’ t put t h e f i r s t e l e m e n t o f ’ p o s s i b l e S y n o n y m s ’ i n t o t h e l i s t
;;
o f v e r i f i e d synonyms and keep c h e c k i n g t h e r e s t o f t h e l i s t
( t ( e l i m i n a t e D i s s i m i l a r O w n e r s owners ( r e s t p o s s i b l e S y n o n y m s )
verifiedSynonyms ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
function : similarOwnersp ( a p r e d i c a t e )
;;;
i n p u t : two l i s t s o f r e l a t i o n s , ownersOfNoun i s t h e r e l a t i o n s o f t h e
;;;
t a r g e t noun ; ownersOfSynonym i s t h e r e l a t i o n s o f a
;;;
p o s s i b l e synonym .
;;;
r e t u r n s t i f t a r g e t and p o s s i b l e synonym have s i m i l a r r e l a t i o n s ,
;;;
n i l otherwise .
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun s i m i l a r O w n e r s p ( ownersOfNoun ownersOfSynonym )
43
” Return t i f t h e i n p u t l i s t s have more e l e m e n t s i n common than e l e m e n t s t h a t
s e p a r a t e them . ”
(>= ( length ( i n t e r s e c t i o n ownersOfNoun ownersOfSynonym ) )
( length ( union ( s e t − d i f f e r e n c e ownersOfNoun ownersOfSynonym )
( s e t − d i f f e r e n c e ownersOfSynonym ownersOfNoun ) ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
;;;
f u n c t i o n : removeElement
;;;
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun removeElement ( removeMe n o d e L i s t & o p t i o n a l weeded )
”Remove an e l e m e n t whose name i s e q u a l t o t h e name o f ’ removeMe ’ from
’ nodeList ’ . ”
( cond
; ; i f a l l t h e e l e m e n t s have been c he c k e d , r e t u r n t h e l i s t o f e l e m e n t s
;;
that passed the check
( ( null n o d e L i s t ) weeded )
; ; i f t h e name o f t h e node ’ removeMe ’ i s t h e same a s t h e name o f t h e
;;
f i r s t node i n ’ n o d e L i s t ’ then do not add t h e f i r s t e l e m e n t t o t h e
;;
l i s t o f v e r i f i e d e l e m e n t s ( weeded ) and check t h e r e s t o f t h e n o d e L i s t
( ( s t r i n g − e q u a l ( s t r i n g removeMe ) ( g e t N o d e S t r i n g ( f i r s t n o d e L i s t ) ) )
( removeElement removeMe ( r e s t n o d e L i s t ) weeded ) )
; ; i f t h e name o f t h e node t h a t has a l e x p o i n t i n g t o ’ removeMe ’ i s t h e
; ; same a s t h e f i r s t node i n ’ n o d e L i s t ’ then do not add t h e f i r s t e l e m e n t
;;
t o t h e l i s t o f v e r i f i e d e l e m e n t n s and che ck t h e r e s t o f n o d e L i s t
( ( s t r i n g − e q u a l ( g e t N o d e S t r i n g ( f i r s t # 3 ! ( ( find l e x ˜ removeMe ) ) ) )
( getNodeString ( f i r s t nodeList ) ) )
( removeElement removeMe ( r e s t n o d e L i s t ) weeded ) )
; ; t h e name o f t h e node ’ removeMe ’ i s not t h e same a s t h e name o f t h e
;;
f i r s t node i n ’ n o d e L i s t ’ , s o add t h e f i r s t node i n ’ n o d e L i s t ’ t o
;;
’ weeded ’ .
( t ( removeElement removeMe ( r e s t n o d e L i s t )
( cons ( f i r s t n o d e L i s t ) weeded ) ) ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
f u n c t i o n : getNodeName
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun getNodeName ( node )
(and ( s n e p s : node−p node )
( s n e p s : node−na node ) ) )
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
;;;
function : getNodeString
;;;−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
( defun g e t N o d e S t r i n g ( node )
( s t r i n g ( getNodeName node ) ) )
B
B.1
Demos
Brachet
==============================================================
S t a r t i n g image ‘ / u t i l / a c l 6 2 / composer ’
with no arguments
i n directory ‘ / p r o j e c t s / s t n 2 /CVA/demos / ’
on machine ‘ l o c a l h o s t ’ .
44
I n t e r n a t i o n a l A l l e g r o CL E n t e r p r i s e E d i t i o n
6 . 2 [ S o l a r i s ] ( Aug 1 5 , 2 0 0 2 1 4 : 2 4 )
C o p y r ig h t ( C) 1 9 8 5 − 2 0 0 2 , Franz I n c . , B e r k e l e y , CA , USA .
A l l R i g h t s Reserved .
This development copy o f A l l e g r o CL i s l i c e n s e d t o :
[ 4 5 4 9 ] SUNY/ B u f f a l o , N . Campus
; ; O p t i m i z a t i o n s e t t i n g s : s a f e t y 1 , s p a c e 1 , s p e e d 1 , debug 2 .
; ; For a c o m p l e t e d e s c r i p t i o n o f a l l c o m p i l e r s w i t c h e s g i v e n t h e c u r r e n t
; ; optimization s e t t i n g s evaluate ( explain−compiler−settings ) .
;;−−−
; ; Current r e a d e r c a s e mode : : c a s e − s e n s i t i v e − l o w e r
c l − u s e r ( 1 ) : : cd . .
/ p r o j e c t s / s t n 2 /CVA/
cl−user ( 2 ) : : ld defun nounc .
E r r o r : ” d e f u n n o u n c . ” d o e s not e x i s t , cannot load
[ c o n d i t i o n type : f i l e − d o e s − n o t − e x i s t − e r r o r ]
R e s t a r t a c t i o n s ( s e l e c t u s i n g : continue ) :
0 : r e t r y t h e load o f d e f u n n o u n c .
1 : skip loading defun nounc .
2 : Abort e n t i r e l y from t h i s p r o c e s s .
[ 1 ] c l − u s e r ( 3 ) : : pop
cl−user ( 4 ) : : ld / p r o j e c t s / snwiz / bin / sneps
; Loading / p r o j e c t s / s n w i z / b i n / s n e p s . l i s p
Loading system SNePS...10% 20% 30% 40% 50% 60% 70% 80% 90% 100%
SNePS−2 . 6 [ PL : 0 a 2 0 0 2 / 0 9 / 3 0 2 2 : 3 7 : 4 6 ] l o a d e d .
Type ‘ ( s n e p s ) ’ or ‘ ( s n e p s l o g ) ’ t o get s t a r t e d .
c l − u s e r ( 5 ) : : l d defun noun . c l
; Loading / p r o j e c t s / s t n 2 /CVA/ defun noun . c l
c l − u s e r ( 6 ) : ( demo ”demos/ b r a c h e t . demo” )
E r r o r : attempt t o c a l l ‘ demo ’ which i s an u n d e f i n e d f u n c t i o n .
[ c o n d i t i o n ty pe : u n d e f i n e d − f u n c t i o n ]
R e s t a r t a c t i o n s ( s e l e c t u s i n g : continue ) :
0 : Try c a l l i n g demo a g a i n .
1 : Try c a l l i n g s n e p s : demo i n s t e a d .
2 : Return a v a l u e i n s t e a d o f c a l l i n g demo .
3 : Try c a l l i n g a f u n c t i o n o t h e r than demo .
4 : S e t f t h e s ymb ol−f un ction o f demo and c a l l i t a g a i n .
5 : Return t o Top L e v e l ( an ” a b o r t ” r e s t a r t ) .
6 : Abort e n t i r e l y from t h i s p r o c e s s .
[ 1 ] c l − u s e r ( 7 ) : : pop
cl−user ( 8 ) : ( sneps )
Welcome t o SNePS−2 . 6 [ PL : 0 a 2 0 0 2 / 0 9 / 3 0 2 2 : 3 7 : 4 6 ]
C o p y r i g h t ( C) 1984−−2002 by R e s e a r c h Foundation o f
S t a t e U n i v e r s i t y o f New York . SNePS comes with ABSOLUTELY NO WARRANTY!
Type ‘ ( c o p y r i g h t ) ’ f o r d e t a i l e d c o p y r i g h t i n f o r m a t i o n .
Type ‘ ( demo ) ’ f o r a l i s t o f example a p p l i c a t i o n s .
2/21/2003 13:53:21
∗ ( demo ”demos/ b r a c h e t . demo” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ b r a c h e t . demo i s now t h e s o u r c e o f i n p u t .
45
CPU time : 0 . 0 2
∗ ; ; Brachet demo − c r e a t e d by K . E h r l i c h
;;
− m o d i f i e d by A . Hunt & J . Koplas
;;
− m o d i f i e d by M. B r o k l a w s k i
;;
− m o d i f i e d by S . N a p i e r a l s k i
; ; c l e a r a l l i n f o r m a t i o n out o f t h e network
( resetnet t )
Net r e s e t
CPU time : 0 . 0 2
∗
; ; t u r n o f f s i n g u l a r path i n f e r e n c e
ˆ(
−−> in−package s n i p )
#<The s n i p package>
CPU time : 0 . 0 0
∗
; ; ; r e d e f i n e function to return n i l
; ; ; s o t h a t f o r w a r d i n f e r e n c e w i l l not be l i m i t e d
ˆ(
−−> defun b ro a d ca s t− o n e− r e p o r t ( r e p )
( let ( anysent )
( do . c h s e t ( ch ∗OUTGOING−CHANNELS∗ a n y s e n t )
(when ( i s o p e n . ch ch )
( s e t q a n y s e n t ( or ( try−to−send−report r e p ch ) a n y s e n t ) ) ) ) )
nil )
b ro ad cas t− o n e − r e p o rt
CPU time : 0 . 0 0
∗
; ; ; r e t u r n t o s n e p s package
ˆ(
−−> in−package s n e p s )
#<The s n e p s package>
CPU time : 0 . 0 0
∗
ˆ
−−> ( s e t f s n e p s u l : : ∗ i n f e r t r a c e ∗ n i l )
nil
CPU time : 0 . 0 0
∗
; ; ; l o a d background knowledge
( i n t e x t ”/ p r o j e c t s / s t n 2 /CVA/demos/ r e l s ” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ r e l s i s now t h e s o u r c e o f i n p u t .
CPU time : 0 . 0 1
∗
46
( a1 a2 a3 a4 a f t e r a g e n t antonym a s s o c i a t e d b e f o r e c a u s e c l a s s d i r e c t i o n
e q u i v e t i m e from i n i n d o b j i n s t r i n t o l e x l o c a t i o n manner member mode o b j e c t
on onto p a r t p l a c e p o s s e s s o r proper−name p r o p e r t y r e l s k f s p − r e l s t i m e
s u b c l a s s s u p e r c l a s s synonym time t o whole k n c a t )
CPU time : 0 . 2 5
∗
End o f f i l e / p r o j e c t s / s t n 2 /CVA/demos/ r e l s
CPU time : 0 . 2 6
∗ ( demo ”/ p r o j e c t s / s t n 2 /CVA/demos/ p a t h s ” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ p a t h s i s now t h e s o u r c e o f i n p u t .
CPU time : 0 . 0 1
∗ ; ; ; Composition o f c e r t a i n p a t h s
; ; ; Make B e f o r e T r a n s i t i v e
( d e f i n e − p a t h b e f o r e ( compose b e f o r e ( k s t a r ( compose a f t e r − ! b e f o r e ) ) ) )
b e f o r e i m p l i e d by t h e path ( compose b e f o r e ( k s t a r ( compose a f t e r − ! b e f o r e ) ) )
b e f or e − i m p l i e d by t h e path ( compose ( k s t a r ( compose be f o re − ! a f t e r ) )
b e f o re − )
CPU time : 0 . 0 0
∗
; ; ; Make A f t e r T r a n s i t i v e
( d e f i n e − p a t h a f t e r ( compose a f t e r ( k s t a r ( compose b ef o re − ! a f t e r ) ) ) )
a f t e r i m p l i e d by t h e path ( compose a f t e r ( k s t a r ( compose be f o re − ! a f t e r ) ) )
a f t e r − i m p l i e d by t h e path ( compose ( k s t a r ( compose a f t e r − ! b e f o r e ) ) a f t e r − )
CPU time : 0 . 0 0
∗
; ; I f X i s a member o f t h e c l a s s Y and Y i s a s u b c l a s s o f Z then
;;
X i s a member o f t h e c l a s s Z .
; ; Example :
I f Fido i s a b r a c h e t and a l l b r a c h e t s a r e hounds then
;;;
Fido i s a hound .
( d e f i n e − p a t h c l a s s ( compose c l a s s ( k s t a r ( compose s u b c l a s s − ! s u p e r c l a s s ) ) ) )
c l a s s i m p l i e d by t h e path ( compose c l a s s
( k s t a r ( compose s u b c l a s s − ! s u p e r c l a s s ) ) )
c l a s s − i m p l i e d by t h e path ( compose ( k s t a r ( compose s u p e r c l a s s − ! s u b c l a s s ) )
class− )
CPU time : 0 . 0 0
∗
; ; Make s u b c l a s s t r a n s i t i v e
( d e f i n e − p a t h s u b c l a s s ( compose s u b c l a s s ( k s t a r ( compose s u p e r c l a s s − ! s u b c l a s s ) ) ) )
s u b c l a s s i m p l i e d by t h e path ( compose s u b c l a s s
( k s t a r ( compose s u p e r c l a s s − ! s u b c l a s s ) ) )
s u b c l a s s − i m p l i e d by t h e path ( compose
( k s t a r ( compose s u b c l a s s − ! s u p e r c l a s s ) )
47
subclass− )
CPU time : 0 . 0 0
∗
End o f / p r o j e c t s / s t n 2 /CVA/demos/ p a t h s d e m o n s t r a t i o n .
CPU time : 0 . 0 1
∗ ( demo ”/ p r o j e c t s / s t n 2 /CVA/demos/ b r a c h e t . b a s e ” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ b r a c h e t . b a s e i s now t h e s o u r c e o f i n p u t .
CPU time : 0 . 0 0
∗ ; ; ; This i s t h e s e t o f a s s e r t i o n s which b u i l d t h e b a s e network which
; ; ; c o r r e s p o n d s t o Karen E h r l i c h ’ s v o c a b u l a r y a c q u i s i t i o n p r o j e c t .
; ; ; Commented and made a c c e s s i b l e by Alan Hunt and G e o f f r e y Koplas , ’ 9 7
; ; ; The f o l l o w i n g i s t h e i n f o r m a t i o n t h a t n e e d s t o g e t f e d i n t o t h e network
; ; ; f o r t h e N a r r a t i v e A c q u i s i t i o n demos ; namely t h e background knowledge
; ; ; on t h e words o t h e r than t h e one b e i n g a c q u i r e d .
; Animals a r e p h y s i c a l o b j e c t s
( describe
( a s s e r t s u b c l a s s ( b u i l d l e x ” animal ” ) s u p e r c l a s s ( b u i l d l e x ” phys o b j ” )
kn cat ” l i f e ” ))
(m3 ! ( k n c a t l i f e ) ( s u b c l a s s ( m1 ( l e x animal ) ) )
( s u p e r c l a s s ( m2 ( l e x phys o b j ) ) ) )
(m3 ! )
CPU time : 0 . 0 1
∗
; Quadrupeds a r e v e r t e b r a t e s
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” quadruped ” ) s u p e r c l a s s ( b u i l d l e x ” v e r t e b r a t e ” )
kn cat ” l i f e ” ))
(m6 ! ( k n c a t l i f e ) ( s u b c l a s s ( m4 ( l e x quadruped ) ) )
( s u p e r c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) )
(m6 ! )
CPU time : 0 . 0 1
∗
; Ungulates are h e r b i v o r e s
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” u n g u l a t e ” ) s u p e r c l a s s ( b u i l d l e x ” h e r b i v o r e ” )
kn cat ” l i f e ” ))
(m9 ! ( k n c a t l i f e ) ( s u b c l a s s ( m7 ( l e x u n g u l a t e ) ) )
( s u p e r c l a s s ( m8 ( l e x h e r b i v o r e ) ) ) )
(m9 ! )
48
CPU time : 0 . 0 2
∗
; Mammals a r e a n i m a l s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ”mammal” ) s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
(m11 ! ( k n c a t l i f e ) ( s u b c l a s s ( m10 ( l e x mammal ) ) )
( s u p e r c l a s s ( m1 ( l e x animal ) ) ) )
( m11 ! )
CPU time : 0 . 0 0
∗
; Mammals a r e v e r t e b r a t e s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ”mammal” ) s u p e r c l a s s ( b u i l d l e x ” v e r t e b r a t e ” )
kn cat ” l i f e ” ))
(m12 ! ( k n c a t l i f e ) ( s u b c l a s s ( m10 ( l e x mammal ) ) )
( s u p e r c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) )
( m12 ! )
CPU time : 0 . 0 2
∗
; Deer a r e mammals
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” d e e r ” ) s u p e r c l a s s ( b u i l d l e x ”mammal” )
kn cat ” l i f e ” ))
(m14 ! ( k n c a t l i f e ) ( s u b c l a s s ( m13 ( l e x d e e r ) ) )
( s u p e r c l a s s ( m10 ( l e x mammal ) ) ) )
( m14 ! )
CPU time : 0 . 0 1
∗
; Deer a r e quadrupeds
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” d e e r ” ) s u p e r c l a s s ( b u i l d l e x ” quadruped ” )
kn cat ” l i f e ” ))
(m15 ! ( k n c a t l i f e ) ( s u b c l a s s ( m13 ( l e x d e e r ) ) )
( s u p e r c l a s s ( m4 ( l e x quadruped ) ) ) )
( m15 ! )
CPU time : 0 . 0 0
∗
; Deer a r e h e r b i v o r e s
( describe
49
( a sse r t s u b c l a s s ( b u i l d l e x ” d e e r ” ) s u p e r c l a s s ( b u i l d l e x ” h e r b i v o r e ” )
kn cat ” l i f e ” ))
(m16 ! ( k n c a t l i f e ) ( s u b c l a s s ( m13 ( l e x d e e r ) ) )
( s u p e r c l a s s ( m8 ( l e x h e r b i v o r e ) ) ) )
( m16 ! )
CPU time : 0 . 0 1
∗
; Deer a r e a n i m a l s
( describe ( as s er t s u b c l a s s ( b u i l d l e x ” d e e r ” ) s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
( m17 ! ( k n c a t l i f e ) ( s u b c l a s s ( m13 ( l e x d e e r ) ) )
( s u p e r c l a s s ( m1 ( l e x animal ) ) ) )
( m17 ! )
CPU time : 0 . 0 2
∗
; Deer i s a b a s i c l e v e l c a t e g o r y
( describe
( as s ert member ( b u i l d l e x ” d e e r ” )
kn cat ” l i f e ” ))
c l a s s ( build lex ” basic ctgy ” )
(m19 ! ( c l a s s ( m18 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m13 ( l e x d e e r ) ) ) )
( m19 ! )
CPU time : 0 . 0 2
∗
; ” Harts a r e d e e r ”
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” h a r t ” ) s u p e r c l a s s ( b u i l d l e x ” d e e r ” )
kn cat ” l i f e ” ))
(m21 ! ( k n c a t l i f e ) ( s u b c l a s s ( m20 ( l e x h a r t ) ) ) ( s u p e r c l a s s ( m13 ( l e x d e e r ) ) ) )
( m21 ! )
CPU time : 0 . 0 0
∗
; H o r s e s a r e quadrupeds
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” h o r s e ” ) s u p e r c l a s s ( b u i l d l e x ” quadruped ” )
kn cat ” l i f e ” ))
(m23 ! ( k n c a t l i f e ) ( s u b c l a s s ( m22 ( l e x h o r s e ) ) )
( s u p e r c l a s s ( m4 ( l e x quadruped ) ) ) )
( m23 ! )
50
CPU time : 0 . 0 1
∗
; Horses are h e r b i v o r e s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” h o r s e ” ) s u p e r c l a s s ( b u i l d l e x ” h e r b i v o r e ” )
kn cat ” l i f e ” ))
(m24 ! ( k n c a t l i f e ) ( s u b c l a s s ( m22 ( l e x h o r s e ) ) )
( s u p e r c l a s s ( m8 ( l e x h e r b i v o r e ) ) ) )
( m24 ! )
CPU time : 0 . 0 1
∗
; Horses are animals
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” h o r s e ” ) s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
(m25 ! ( k n c a t l i f e ) ( s u b c l a s s ( m22 ( l e x h o r s e ) ) )
( s u p e r c l a s s ( m1 ( l e x animal ) ) ) )
( m25 ! )
CPU time : 0 . 0 0
∗
; Horse i s a b a s i c l e v e l c a t e g o r y
( describe
( as se r t member ( b u i l d l e x ” h o r s e ” )
kn cat ” l i f e ” ))
c l a s s ( build lex ” basic ctgy ” )
(m26 ! ( c l a s s ( m18 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m22 ( l e x h o r s e ) ) ) )
( m26 ! )
CPU time : 0 . 0 0
∗
; Ponies are animals
( describe ( a s s e r t s u b c l a s s ( b u i l d l e x ” pony ” ) s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
( m28 ! ( k n c a t l i f e ) ( s u b c l a s s ( m27 ( l e x pony ) ) )
( s u p e r c l a s s ( m1 ( l e x animal ) ) ) )
( m28 ! )
CPU time : 0 . 0 1
∗
; ” Dogs a r e mammals”
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” dog ” ) s u p e r c l a s s ( b u i l d l e x ”mammal” )
kn cat ” l i f e ” ))
51
( m30 ! ( k n c a t l i f e ) ( s u b c l a s s ( m29 ( l e x dog ) ) )
( s u p e r c l a s s ( m10 ( l e x mammal ) ) ) )
( m30 ! )
CPU time : 0 . 0 1
∗
; ” Dogs a r e quadrupeds ”
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” dog ” ) s u p e r c l a s s ( b u i l d l e x ” quadruped ” )
kn cat ” l i f e ” ))
(m31 ! ( k n c a t l i f e ) ( s u b c l a s s ( m29 ( l e x dog ) ) )
( s u p e r c l a s s ( m4 ( l e x quadruped ) ) ) )
( m31 ! )
CPU time : 0 . 0 0
∗
; ” Dogs a r e a n i m a l s ”
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” dog ” ) s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
(m32 ! ( k n c a t l i f e ) ( s u b c l a s s ( m29 ( l e x dog ) ) ) ( s u p e r c l a s s ( m1 ( l e x animal ) ) ) )
( m32 ! )
CPU time : 0 . 0 1
∗
; Dog i s a b a s i c l e v e l c a t e g o r y
( describe
( as se r t member ( b u i l d l e x ” dog ” )
kn cat ” l i f e ” ))
c l a s s ( build lex ” basic ctgy ” )
(m33 ! ( c l a s s ( m18 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m29 ( l e x dog ) ) ) )
( m33 ! )
CPU time : 0 . 0 0
∗
; ”Hounds a r e dogs ”
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ”hound” ) s u p e r c l a s s ( b u i l d l e x ” dog ” )
kn cat ” l i f e ” ))
(m35 ! ( k n c a t l i f e ) ( s u b c l a s s ( m34 ( l e x hound ) ) ) ( s u p e r c l a s s ( m29 ( l e x dog ) ) ) )
( m35 ! )
CPU time : 0 . 0 1
∗
; ” Something i s a member o f t h e c l a s s dog ”
52
( describe
( a sse r t member # r e x c l a s s ( b u i l d l e x ” dog ” ) ) )
( m36 ! ( c l a s s ( m29 ( l e x dog ) ) ) ( member b1 ) )
( m36 ! )
CPU time : 0 . 0 2
∗
; ”The dog i s p o s s e s e d by something ”
( describe
( a sse r t o b j e c t ∗ r e x r e l ( b u i l d l e x ” dog ” ) p o s s e s s o r # r e x b o s s ) )
( m37 ! ( o b j e c t b1 ) ( p o s s e s s o r b2 ) ( r e l ( m29 ( l e x dog ) ) ) )
( m37 ! )
CPU time : 0 . 0 0
∗
; ”The t h i n g t h a t owns t h e dog i s a p e r s o n ”
( describe
( a sse r t member ∗ r e x b o s s c l a s s ( b u i l d l e x ” p e r s o n ” ) ) )
( m39 ! ( c l a s s ( m38 ( l e x p e r s o n ) ) ) ( member b2 ) )
( m39 ! )
CPU time : 0 . 0 1
∗
; Kings a r e p e r s o n s
( describe
( add s u b c l a s s ( b u i l d l e x ” k i n g ” ) s u p e r c l a s s ( b u i l d l e x ” p e r s o n ” )
kn cat ” l i f e ” ))
(m41 ! ( k n c a t l i f e ) ( s u b c l a s s ( m40 ( l e x k i n g ) ) )
( s u p e r c l a s s ( m38 ( l e x p e r s o n ) ) ) )
( m41 ! )
CPU time : 0 . 0 0
∗
; Wizards a r e p e r s o n s .
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” w i z a r d ” ) s u p e r c l a s s ( b u i l d l e x ” p e r s o n ” )
kn cat ” l i f e ” ))
(m43 ! ( k n c a t l i f e ) ( s u b c l a s s ( m42 ( l e x w i z a r d ) ) )
( s u p e r c l a s s ( m38 ( l e x p e r s o n ) ) ) )
( m43 ! )
CPU time : 0 . 0 1
∗
53
; Knights a r e p e r s o n s .
( describe
( ass er t s u b c l a s s ( b u i l d l e x ” k n i g h t ” ) s u p e r c l a s s ( b u i l d l e x ” p e r s o n ” )
kn cat ” l i f e ” ))
(m45 ! ( k n c a t l i f e ) ( s u b c l a s s ( m44 ( l e x k n i g h t ) ) )
( s u p e r c l a s s ( m38 ( l e x p e r s o n ) ) ) )
( m45 ! )
CPU time : 0 . 0 0
∗
; Person i s a b a s i c l e v e l c a t e g o r y
( describe
( as se r t member ( b u i l d l e x ” p e r s o n ” )
kn cat ” l i f e ” ))
c l a s s ( build lex ” basic ctgy ” )
(m46 ! ( c l a s s ( m18 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e )
(member ( m38 ( l e x p e r s o n ) ) ) )
( m46 ! )
CPU time : 0 . 0 0
∗
; Something i s named ’ King Arthur ’
( describe
( a sse r t o b j e c t #KA proper−name ( b u i l d l e x ” King Arthur ” )
kn cat ” l i f e ” ))
( m48 ! ( k n c a t l i f e ) ( o b j e c t b3 ) ( proper−name ( m47 ( l e x King Arthur ) ) ) )
( m48 ! )
CPU time : 0 . 0 1
∗
; King Arthur i s a k i n g
( describe
( a sse r t member ∗KA c l a s s ( b u i l d l e x ” k i n g ” )
kn cat ” l i f e ” ))
(m49 ! ( c l a s s ( m40 ( l e x k i n g ) ) ) ( k n c a t l i f e ) ( member b3 ) )
( m49 ! )
CPU time : 0 . 0 0
∗
; The Round Table i s a t a b l e
( describe
( a sse r t member ( b u i l d l e x ”Round Table ” ) c l a s s ( b u i l d l e x ” t a b l e ” )
kn cat ” l i f e ” ))
(m52 ! ( c l a s s ( m51 ( l e x t a b l e ) ) ) ( k n c a t l i f e )
(member ( m50 ( l e x Round Table ) ) ) )
54
( m52 ! )
CPU time : 0 . 0 1
∗
; King Arthur owns t h e Round Table
( describe
( a sse r t p o s s e s s o r ∗KA o b j e c t ( b u i l d l e x ”Round Table ” ) r e l ( b u i l d l e x ” t a b l e ” )
kn cat ” l i f e ” ))
(m53 ! ( k n c a t l i f e ) ( o b j e c t ( m50 ( l e x Round Table ) ) ) ( p o s s e s s o r b3 )
( r e l ( m51 ( l e x t a b l e ) ) ) )
( m53 ! )
CPU time : 0 . 0 1
∗
; There i s something named ’ E x c a l i b u r ’
( describe
( as s ert o b j e c t # E x c a l i b u r proper−name ( b u i l d l e x ” E x c a l i b u r ” )
kn cat ” l i f e ” ))
(m55 ! ( k n c a t l i f e ) ( o b j e c t b4 ) ( proper−name ( m54 ( l e x E x c a l i b u r ) ) ) )
( m55 ! )
CPU time : 0 . 0 0
∗
; E x c a l i b u r i s a sword
( describe
( as s ert member ∗ E x c a l i b u r c l a s s ( b u i l d l e x ” sword ” )
kn cat ” l i f e ” ))
(m57 ! ( c l a s s ( m56 ( l e x sword ) ) ) ( k n c a t l i f e ) ( member b4 ) )
( m57 ! )
CPU time : 0 . 0 1
∗
; King Arthur owns E x c a l i b u r
( describe
( a sse r t o b j e c t ∗ E x c a l i b u r r e l ( b u i l d l e x ” sword ” ) p o s s e s s o r ∗KA
kn cat ” l i f e ” ))
(m58 ! ( k n c a t l i f e ) ( o b j e c t b4 ) ( p o s s e s s o r b3 ) ( r e l ( m56 ( l e x sword ) ) ) )
( m58 ! )
CPU time : 0 . 0 1
∗
; Something i s named ’ M e r l i n ’
( describe
( as s ert o b j e c t #Mer proper−name ( b u i l d l e x ” M e r l i n ” )
kn cat ” l i f e ” ))
55
( m60 ! ( k n c a t l i f e ) ( o b j e c t b5 ) ( proper−name ( m59 ( l e x M e r l i n ) ) ) )
( m60 ! )
CPU time : 0 . 0 2
∗
; Merlin i s a wizard .
( describe
( as se r t member ∗ Mer c l a s s ( b u i l d l e x ” w i z a r d ” )
kn cat ” l i f e ” ))
(m61 ! ( c l a s s ( m42 ( l e x w i z a r d ) ) ) ( k n c a t l i f e ) ( member b5 ) )
( m61 ! )
CPU time : 0 . 0 0
∗
; Something i s named ’ S i r Galahad ’
( describe
( a sse r t o b j e c t #Galahad proper−name ( b u i l d l e x ” S i r Galahad ” )
kn cat ” l i f e ” ))
( m63 ! ( k n c a t l i f e ) ( o b j e c t b6 ) ( proper−name ( m62 ( l e x S i r Galahad ) ) ) )
( m63 ! )
CPU time : 0 . 0 1
∗
; S i r Galahad i s a k n i g h t
( describe
( as s ert member ∗ Galahad c l a s s ( b u i l d l e x ” k n i g h t ” )
kn cat ” l i f e ” ))
(m64 ! ( c l a s s ( m44 ( l e x k n i g h t ) ) ) ( k n c a t l i f e ) ( member b6 ) )
( m64 ! )
CPU time : 0 . 0 0
∗
; Something i s named ’ S i r T r i s t r a m ’
( describe
( a sse r t o b j e c t # T r i s proper−name ( b u i l d l e x ” S i r T r i s t r a m ” )
kn cat ” l i f e ” ))
(m66 ! ( k n c a t l i f e ) ( o b j e c t b7 ) ( proper−name ( m65 ( l e x S i r T r i s t r a m ) ) ) )
( m66 ! )
CPU time : 0 . 0 1
∗
; S i r Tristram i s a knight
( describe
56
( a sse r t member ∗ T r i s
c l a s s ( build lex ” knight ” )
kn cat ” l i f e ” ))
(m67 ! ( c l a s s ( m44 ( l e x k n i g h t ) ) ) ( k n c a t l i f e ) ( member b7 ) )
( m67 ! )
CPU time : 0 . 0 1
∗
; Something i s named ’ S i r Gawain ’
( describe
( a sse r t o b j e c t #SG proper−name ( b u i l d l e x ” S i r Gawain” )
kn cat ” l i f e ” ))
(m69 ! ( k n c a t l i f e ) ( o b j e c t b8 ) ( proper−name ( m68 ( l e x S i r Gawain ) ) ) )
( m69 ! )
CPU time : 0 . 0 1
∗
; S i r Gawain i s a k n i g h t
( describe
( as s ert member ∗SG c l a s s ( b u i l d l e x ” k n i g h t ” )
kn cat ” l i f e ” ))
(m70 ! ( c l a s s ( m44 ( l e x k n i g h t ) ) ) ( k n c a t l i f e ) ( member b8 ) )
( m70 ! )
CPU time : 0 . 0 1
∗
; Something i s named ’ King Ban ’
( describe
( a sse r t o b j e c t #Ban proper−name ( b u i l d l e x ” King Ban” )
kn cat ” l i f e ” ))
(m72 ! ( k n c a t l i f e ) ( o b j e c t b9 ) ( proper−name ( m71 ( l e x King Ban ) ) ) )
( m72 ! )
CPU time : 0 . 0 1
∗
; King Ban i s a k i n g
( describe
( as s ert member ∗ Ban c l a s s ( b u i l d l e x ” k i n g ” )
kn cat ” l i f e ” ))
(m73 ! ( c l a s s ( m40 ( l e x k i n g ) ) ) ( k n c a t l i f e ) ( member b9 ) )
( m73 ! )
CPU time : 0 . 0 1
∗
57
; Something i s named ’ King Bors ’
( describe
( ass er t o b j e c t #Bors proper−name ( b u i l d l e x ” King Bors ” )
kn cat ” l i f e ” ))
(m75 ! ( k n c a t l i f e ) ( o b j e c t b10 ) ( proper−name ( m74 ( l e x King Bors ) ) ) )
( m75 ! )
CPU time : 0 . 0 1
∗
; King Bors i s a k i n g
( describe
( as se r t member ∗ Bors c l a s s ( b u i l d l e x ” k i n g ” )
kn cat ” l i f e ” ))
(m76 ! ( c l a s s ( m40 ( l e x k i n g ) ) ) ( k n c a t l i f e ) ( member b10 ) )
( m76 ! )
CPU time : 0 . 0 1
∗
; Something i s named ’ King Lot ’
( describe
( a sse r t o b j e c t #Lot proper−name ( b u i l d l e x ” King Lot ” )
kn cat ” l i f e ” ))
(m78 ! ( k n c a t l i f e ) ( o b j e c t b11 ) ( proper−name ( m77 ( l e x King Lot ) ) ) )
( m78 ! )
CPU time : 0 . 0 1
∗
; King Lot i s a k i n g
( describe
( as se r t member ∗ Lot c l a s s ( b u i l d l e x ” k i n g ” )
kn cat ” l i f e ” ))
(m79 ! ( c l a s s ( m40 ( l e x k i n g ) ) ) ( k n c a t l i f e ) ( member b11 ) )
( m79 ! )
CPU time : 0 . 0 0
∗
; Sideboards are f u r n i t u r e
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” s i d e b o a r d ” ) s u p e r c l a s s ( b u i l d l e x ” f u r n i t u r e ” )
kn cat ” l i f e ” ))
(m82 ! ( k n c a t l i f e ) ( s u b c l a s s ( m80 ( l e x s i d e b o a r d ) ) )
( s u p e r c l a s s ( m81 ( l e x f u r n i t u r e ) ) ) )
( m82 ! )
58
CPU time : 0 . 0 1
∗
; Tables are f u r n i t u r e
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” t a b l e ” ) s u p e r c l a s s ( b u i l d l e x ” f u r n i t u r e ” )
kn cat ” l i f e ” ))
(m83 ! ( k n c a t l i f e ) ( s u b c l a s s ( m51 ( l e x t a b l e ) ) )
( s u p e r c l a s s ( m81 ( l e x f u r n i t u r e ) ) ) )
( m83 ! )
CPU time : 0 . 0 0
∗
; Chairs are f u r n i t u r e
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” c h a i r ” ) s u p e r c l a s s ( b u i l d l e x ” f u r n i t u r e ” )
kn cat ” l i f e ” ))
(m85 ! ( k n c a t l i f e ) ( s u b c l a s s ( m84 ( l e x c h a i r ) ) )
( s u p e r c l a s s ( m81 ( l e x f u r n i t u r e ) ) ) )
( m85 ! )
CPU time : 0 . 0 1
∗
; Chair i s a b a s i c l e v e l c a t e g o r y
( describe
( as se r t member ( b u i l d l e x ” c h a i r ” )
kn cat ” l i f e ” ))
c l a s s ( build lex ” basic ctgy ” )
(m86 ! ( c l a s s ( m18 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m84 ( l e x c h a i r ) ) ) )
( m86 ! )
CPU time : 0 . 0 1
∗
; Table i s a b a s i c l e v e l c a t e g o r y
( describe
( a sse r t member ( b u i l d l e x ” t a b l e ” )
kn cat ” l i f e ” ))
c l a s s ( build lex ” basic ctgy ” )
(m87 ! ( c l a s s ( m18 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m51 ( l e x t a b l e ) ) ) )
( m87 ! )
CPU time : 0 . 0 0
∗
; White i s a c o l o r
( describe
( a sse r t member ( b u i l d l e x ” w h i t e ” ) c l a s s ( b u i l d l e x ” c o l o r ” )
kn cat ” l i f e ” ))
59
( m90 ! ( c l a s s ( m89 ( l e x c o l o r ) ) ) ( k n c a t l i f e ) ( member ( m88 ( l e x w h i t e ) ) ) )
( m90 ! )
CPU time : 0 . 0 1
∗
; Black i s a c o l o r
( describe
( a sse r t member ( b u i l d l e x ” b l a c k ” ) c l a s s ( b u i l d l e x ” c o l o r ” )
kn cat ” l i f e ” ))
(m92 ! ( c l a s s ( m89 ( l e x c o l o r ) ) ) ( k n c a t l i f e ) ( member ( m91 ( l e x b l a c k ) ) ) )
( m92 ! )
CPU time : 0 . 0 1
∗
; Small i s a s i z e
( describe
( a sse r t member ( b u i l d l e x ” s m a l l ” ) c l a s s ( b u i l d l e x ” s i z e ” )
kn cat ” l i f e ” ))
(m95 ! ( c l a s s ( m94 ( l e x s i z e ) ) ) ( k n c a t l i f e ) ( member ( m93 ( l e x s m a l l ) ) ) )
( m95 ! )
CPU time : 0 . 0 2
∗
; ” Small ” and ” l i t t l e ” a r e synonyms
( describe
( a sse r t synonym ( b u i l d l e x ” s m a l l ” ) synonym ( b u i l d l e x ” l i t t l e ” )
kn cat ” l i f e ” ))
(m97 ! ( k n c a t l i f e ) ( synonym ( m96 ( l e x l i t t l e ) ) ( m93 ( l e x s m a l l ) ) ) )
( m97 ! )
CPU time : 0 . 0 1
∗
; Large i s a s i z e
( describe
( as s ert member ( b u i l d l e x ” l a r g e ” ) c l a s s ( b u i l d l e x ” s i z e ” )
kn cat ” l i f e ” ))
(m99 ! ( c l a s s ( m94 ( l e x s i z e ) ) ) ( k n c a t l i f e ) ( member ( m98 ( l e x l a r g e ) ) ) )
( m99 ! )
CPU time : 0 . 0 1
∗
; ” Large ” and ” b i g ” a r e synonyms
( describe
( a sse r t synonym ( b u i l d l e x ” l a r g e ” ) synonym ( b u i l d l e x ” b i g ” )
60
kn cat ” l i f e ” ))
( m101 ! ( k n c a t l i f e ) ( synonym ( m100 ( l e x b i g ) ) ( m98 ( l e x l a r g e ) ) ) )
( m101 ! )
CPU time : 0 . 0 0
∗
; S p e a r s a r e weapons
( describe
( add s u b c l a s s ( b u i l d l e x ” s p e a r ” ) s u p e r c l a s s ( b u i l d l e x ”weapon” )
kn cat ” l i f e ” ))
( m104 ! ( k n c a t l i f e ) ( s u b c l a s s ( m102 ( l e x s p e a r ) ) )
( s u p e r c l a s s ( m103 ( l e x weapon ) ) ) )
( m104 ! )
CPU time : 0 . 0 1
∗
; ” K i l l ” and ” S l a y ” a r e synonyms
( describe
( as s ert synonym ( b u i l d l e x ” k i l l ” ) synonym ( b u i l d l e x ” s l a y ” ) k n c a t ” l i f e ” ) )
( m107 ! ( k n c a t l i f e ) ( synonym ( m106 ( l e x s l a y ) ) ( m105 ( l e x k i l l ) ) ) )
( m107 ! )
CPU time : 0 . 0 2
∗
;;######################
;;
RULES
;;######################
; I f something i s a hound then t h a t t h i n g hunts .
( describe
( add f o r a l l $hound1
ant ( b u i l d member ∗ hound1 c l a s s ( b u i l d l e x ”hound” ) )
cq ( b u i l d a g e n t ∗ hound1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” hunt ” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m110 ! ( f o r a l l v1 ) ( ant ( p1 ( c l a s s ( m34 ( l e x hound ) ) ) ( member v1 ) ) )
( cq ( p2 ( a c t ( m109 ( a c t i o n ( m108 ( l e x hunt ) ) ) ) ) ( a g e n t v1 ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m110 ! )
CPU time : 0 . 0 6
∗
; ; I f something bays and i t i s a member o f some c l a s s then
;;
t h a t c l a s s i s a s u b c l a s s o f hound
( describe
( add f o r a l l ( $ ba y e r $ c a t e g )
&ant ( ( b u i l d a g e n t ∗ ba yer a c t ( b u i l d a c t i o n ( b u i l d l e x ” bay ” ) ) )
61
( b u i l d member ∗ ba yer c l a s s ∗ c a t e g ) )
cq ( b u i l d s u b c l a s s ∗ c a t e g s u p e r c l a s s ( b u i l d l e x ”hound” ) ) ) )
( m147 ! ( c l a s s ( m18 ( l e x b a s i c c t g y ) ) ) ( member ( m13 ( l e x d e e r ) ) ) )
( m146 ! ( c l a s s ( m18 ) ) ( member ( m22 ( l e x h o r s e ) ) ) )
( m145 ! ( c l a s s ( m18 ) ) ( member ( m29 ( l e x dog ) ) ) )
( m144 ! ( c l a s s ( m10 ( l e x mammal ) ) ) ( member b1 ) )
( m143 ! ( c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) ( member b1 ) )
( m142 ! ( c l a s s ( m4 ( l e x quadruped ) ) ) ( member b1 ) )
( m141 ! ( c l a s s ( m2 ( l e x phys o b j ) ) ) ( member b1 ) )
( m140 ! ( c l a s s ( m1 ( l e x animal ) ) ) ( member b1 ) )
( m139 ! ( c l a s s ( m18 ) ) ( member ( m38 ( l e x p e r s o n ) ) ) )
( m138 ! ( c l a s s ( m40 ( l e x k i n g ) ) ) ( member b3 ) )
( m137 ! ( c l a s s ( m38 ) ) ( member b3 ) )
( m136 ! ( c l a s s ( m81 ( l e x f u r n i t u r e ) ) ) ( member ( m50 ( l e x Round Table ) ) ) )
( m135 ! ( c l a s s ( m51 ( l e x t a b l e ) ) ) ( member ( m50 ) ) )
( m134 ! ( c l a s s ( m56 ( l e x sword ) ) ) ( member b4 ) )
( m133 ! ( c l a s s ( m42 ( l e x w i z a r d ) ) ) ( member b5 ) )
( m132 ! ( c l a s s ( m38 ) ) ( member b5 ) )
( m131 ! ( c l a s s ( m44 ( l e x k n i g h t ) ) ) ( member b6 ) )
( m130 ! ( c l a s s ( m38 ) ) ( member b6 ) )
( m129 ! ( c l a s s ( m44 ) ) ( member b7 ) )
( m128 ! ( c l a s s ( m38 ) ) ( member b7 ) )
( m127 ! ( c l a s s ( m44 ) ) ( member b8 ) )
( m126 ! ( c l a s s ( m38 ) ) ( member b8 ) )
( m125 ! ( c l a s s ( m40 ) ) ( member b9 ) )
( m124 ! ( c l a s s ( m38 ) ) ( member b9 ) )
( m123 ! ( c l a s s ( m40 ) ) ( member b10 ) )
( m122 ! ( c l a s s ( m38 ) ) ( member b10 ) )
( m121 ! ( c l a s s ( m40 ) ) ( member b11 ) )
( m120 ! ( c l a s s ( m38 ) ) ( member b11 ) )
( m119 ! ( c l a s s ( m18 ) ) ( member ( m84 ( l e x c h a i r ) ) ) )
( m118 ! ( c l a s s ( m18 ) ) ( member ( m51 ) ) )
( m117 ! ( c l a s s ( m89 ( l e x c o l o r ) ) ) ( member ( m88 ( l e x w h i t e ) ) ) )
( m116 ! ( c l a s s ( m89 ) ) ( member ( m91 ( l e x b l a c k ) ) ) )
( m115 ! ( c l a s s ( m94 ( l e x s i z e ) ) ) ( member ( m93 ( l e x s m a l l ) ) ) )
( m114 ! ( c l a s s ( m94 ) ) ( member ( m98 ( l e x l a r g e ) ) ) )
( m113 ! ( f o r a l l v3 v2 )
(& ant ( p4 ( c l a s s v3 ) ( member v2 ) )
( p3 ( a c t ( m112 ( a c t i o n ( m111 ( l e x bay ) ) ) ) ) ( a g e n t v2 ) ) )
( cq ( p5 ( s u b c l a s s v3 ) ( s u p e r c l a s s ( m34 ( l e x hound ) ) ) ) ) )
(m39 ! ( c l a s s ( m38 ) ) ( member b2 ) )
(m36 ! ( c l a s s ( m29 ) ) ( member b1 ) )
( m147 ! m146 ! m145 ! m144 ! m143 ! m142 ! m141 ! m140 ! m139 ! m138 ! m137 ! m136 !
m135 ! m134 ! m133 ! m132 ! m131 ! m130 ! m129 ! m128 ! m127 ! m126 ! m125 ! m124 !
m123 ! m122 ! m121 ! m120 ! m119 ! m118 ! m117 ! m116 ! m115 ! m114 ! m113 ! m39 ! m36 ! )
CPU time : 0 . 2 5
∗
;;
;;
;;
;;
;;
;;
;;
Newly i n f e r r e d i n f o r m a t i o n :
” Deer ” i s a b a s i c c a t e g o r y
” Horse ” i s a b a s i c c a t e g o r y
”Dog ” i s a b a s i c c a t e g o r y
The dog ( b1 ) i s a quadruped
The dog ( b1 ) i s a mammal
62
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
The dog ( b1 ) i s a v e r t e b r a t e
The dog ( b1 ) i s a p h y s i c a l o b j e c t
The dog ( b1 ) i s a animal
” Person ” i s a b a s i c c a t e g o r y
King Arthur i s a k i n g
King Arthur i s a p e r s o n
The Round Table i s a p i e c e o f f u r n i t u r e
The Round Table i s a t a b l e
E x c a l i b u r i s a sword
Merlin i s a wizard
Merlin i s a person
S i r Galahad i s a k n i g h t
S i r Galahad i s a p e r s o n
S i r Tristram i s a knight
S i r Tristram i s a person
S i r Gawain i s a k n i g h t
S i r Gawain i s a p e r s o n
King Ban i s a k i n g
King Ban i s a p e r s o n
King Bors i s a k i n g
King Bors i s a p e r s o n
King Lot i s a k i n g
King Lot i s a p e r s o n
” Chair ” i s a b a s i c c a t e g o r y
” Table ” i s a b a s i c c a t e g o r y
White i s a c o l o r
Black i s a c o l o r
Small i s a s i z e
Large i s a s i z e
; ; I f one t h i n g b i t e s a n o t h e r and t h e b i t e r i s a member o f some
;;
c l a s s then t h a t c l a s s i s a s u b c l a s s o f animal
( describe
( add f o r a l l ( $animal1 $ b i t t e n ∗ c a t e g )
&ant ( ( b u i l d a g e n t ∗ animal1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” b i t e ” )
object ∗ bitten ))
( b u i l d member ∗ animal1 c l a s s ∗ c a t e g ) )
cq ( b u i l d s u b c l a s s ∗ c a t e g s u p e r c l a s s ( b u i l d l e x ” animal ” ) )
kn cat ” l i f e − r u l e .1” ))
( m149 ! ( f o r a l l v5 v4 v3 )
(& ant ( p8 ( c l a s s v3 ) ( member v4 ) )
( p7 ( a c t ( p6 ( a c t i o n ( m148 ( l e x b i t e ) ) ) ( o b j e c t v5 ) ) ) ( a g e n t v4 ) ) )
( cq ( p9 ( s u b c l a s s v3 ) ( s u p e r c l a s s ( m1 ( l e x animal ) ) ) ) ) ( k n c a t l i f e − r u l e . 1 ) )
( m147 ! ( c l a s s ( m18 ( l e x b a s i c c t g y ) ) ) ( member ( m13 ( l e x d e e r ) ) ) )
( m146 ! ( c l a s s ( m18 ) ) ( member ( m22 ( l e x h o r s e ) ) ) )
( m145 ! ( c l a s s ( m18 ) ) ( member ( m29 ( l e x dog ) ) ) )
( m144 ! ( c l a s s ( m10 ( l e x mammal ) ) ) ( member b1 ) )
( m143 ! ( c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) ( member b1 ) )
( m142 ! ( c l a s s ( m4 ( l e x quadruped ) ) ) ( member b1 ) )
( m141 ! ( c l a s s ( m2 ( l e x phys o b j ) ) ) ( member b1 ) )
( m140 ! ( c l a s s ( m1 ) ) ( member b1 ) )
( m139 ! ( c l a s s ( m18 ) ) ( member ( m38 ( l e x p e r s o n ) ) ) )
( m138 ! ( c l a s s ( m40 ( l e x k i n g ) ) ) ( member b3 ) )
( m137 ! ( c l a s s ( m38 ) ) ( member b3 ) )
( m136 ! ( c l a s s ( m81 ( l e x f u r n i t u r e ) ) ) ( member ( m50 ( l e x Round Table ) ) ) )
( m135 ! ( c l a s s ( m51 ( l e x t a b l e ) ) ) ( member ( m50 ) ) )
( m134 ! ( c l a s s ( m56 ( l e x sword ) ) ) ( member b4 ) )
63
( m133 ! ( c l a s s ( m42 ( l e x w i z a r d ) ) ) ( member b5 ) )
( m132 ! ( c l a s s ( m38 ) ) ( member b5 ) )
( m131 ! ( c l a s s ( m44 ( l e x k n i g h t ) ) ) ( member b6 ) )
( m130 ! ( c l a s s ( m38 ) ) ( member b6 ) )
( m129 ! ( c l a s s ( m44 ) ) ( member b7 ) )
( m128 ! ( c l a s s ( m38 ) ) ( member b7 ) )
( m127 ! ( c l a s s ( m44 ) ) ( member b8 ) )
( m126 ! ( c l a s s ( m38 ) ) ( member b8 ) )
( m125 ! ( c l a s s ( m40 ) ) ( member b9 ) )
( m124 ! ( c l a s s ( m38 ) ) ( member b9 ) )
( m123 ! ( c l a s s ( m40 ) ) ( member b10 ) )
( m122 ! ( c l a s s ( m38 ) ) ( member b10 ) )
( m121 ! ( c l a s s ( m40 ) ) ( member b11 ) )
( m120 ! ( c l a s s ( m38 ) ) ( member b11 ) )
( m119 ! ( c l a s s ( m18 ) ) ( member ( m84 ( l e x c h a i r ) ) ) )
( m118 ! ( c l a s s ( m18 ) ) ( member ( m51 ) ) )
( m117 ! ( c l a s s ( m89 ( l e x c o l o r ) ) ) ( member ( m88 ( l e x w h i t e ) ) ) )
( m116 ! ( c l a s s ( m89 ) ) ( member ( m91 ( l e x b l a c k ) ) ) )
( m115 ! ( c l a s s ( m94 ( l e x s i z e ) ) ) ( member ( m93 ( l e x s m a l l ) ) ) )
( m114 ! ( c l a s s ( m94 ) ) ( member ( m98 ( l e x l a r g e ) ) ) )
( m39 ! ( c l a s s ( m38 ) ) ( member b2 ) )
( m36 ! ( c l a s s ( m29 ) ) ( member b1 ) )
( m149 ! m147 ! m146 ! m145 ! m144 ! m143 ! m142 ! m141 ! m140 ! m139 ! m138 ! m137 !
m136 ! m135 ! m134 ! m133 ! m132 ! m131 ! m130 ! m129 ! m128 ! m127 ! m126 ! m125 !
m124 ! m123 ! m122 ! m121 ! m120 ! m119 ! m118 ! m117 ! m116 ! m115 ! m114 ! m39 ! m36 ! )
CPU time : 0 . 4 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None
; ; I f something i s an animal and p a r t o f a n o t h e r c l a s s then
;;
presumably , t h a t c l a s s i s a s u b c l a s s o f animal
( describe
( add f o r a l l ( ∗ animal1 $ c l a s s 2 )
&ant ( ( b u i l d member ∗ animal1 c l a s s ( b u i l d l e x ” animal ” ) )
( b u i l d member ∗ animal1 c l a s s ∗ c l a s s 2 ) )
cq ( b u i l d mode
( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d s u b c l a s s ∗ c l a s s 2 s u p e r c l a s s ( b u i l d l e x ” animal ” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m173 ! ( mode ( m150 ( l e x presumably ) ) )
( object
( m172 ( s u b c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) ( s u p e r c l a s s ( m1 ( l e x animal ) ) ) ) ) )
( m171 ! ( mode ( m150 ) )
( o b j e c t ( m170 ( s u b c l a s s ( m4 ( l e x quadruped ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m167 ! ( mode ( m150 ) )
( o b j e c t ( m166 ( s u b c l a s s ( m10 ( l e x mammal ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m165 ! ( mode ( m150 ) )
( o b j e c t ( m164 ( s u b c l a s s ( m13 ( l e x d e e r ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m163 ! ( mode ( m150 ) )
( o b j e c t ( m162 ( s u b c l a s s ( m20 ( l e x h a r t ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m161 ! ( mode ( m150 ) )
( o b j e c t ( m160 ( s u b c l a s s ( m22 ( l e x h o r s e ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m157 ! ( mode ( m150 ) )
64
( o b j e c t ( m156 ( s u b c l a s s ( m29 ( l e x dog ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m155 ! ( mode ( m150 ) )
( o b j e c t ( m154 ( s u b c l a s s ( m34 ( l e x hound ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m153 ! ( mode ( m150 ) )
( o b j e c t ( m152 ( s u b c l a s s ( m2 ( l e x phys o b j ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m151 ! ( f o r a l l v6 v4 )
(& ant ( p11 ( c l a s s v6 ) ( member v4 ) ) ( p10 ( c l a s s ( m1 ) ) ( member v4 ) ) )
( cq ( p13 ( mode ( m150 ) ) ( o b j e c t ( p12 ( s u b c l a s s v6 ) ( s u p e r c l a s s ( m1 ) ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m147 ! ( c l a s s ( m18 ( l e x b a s i c c t g y ) ) ) ( member ( m13 ) ) )
( m146 ! ( c l a s s ( m18 ) ) ( member ( m22 ) ) )
( m145 ! ( c l a s s ( m18 ) ) ( member ( m29 ) ) )
( m144 ! ( c l a s s ( m10 ) ) ( member b1 ) )
( m143 ! ( c l a s s ( m5 ) ) ( member b1 ) )
( m142 ! ( c l a s s ( m4 ) ) ( member b1 ) )
( m141 ! ( c l a s s ( m2 ) ) ( member b1 ) )
( m140 ! ( c l a s s ( m1 ) ) ( member b1 ) )
( m139 ! ( c l a s s ( m18 ) ) ( member ( m38 ( l e x p e r s o n ) ) ) )
( m138 ! ( c l a s s ( m40 ( l e x k i n g ) ) ) ( member b3 ) )
( m137 ! ( c l a s s ( m38 ) ) ( member b3 ) )
( m136 ! ( c l a s s ( m81 ( l e x f u r n i t u r e ) ) ) ( member ( m50 ( l e x Round Table ) ) ) )
( m135 ! ( c l a s s ( m51 ( l e x t a b l e ) ) ) ( member ( m50 ) ) )
( m134 ! ( c l a s s ( m56 ( l e x sword ) ) ) ( member b4 ) )
( m133 ! ( c l a s s ( m42 ( l e x w i z a r d ) ) ) ( member b5 ) )
( m132 ! ( c l a s s ( m38 ) ) ( member b5 ) )
( m131 ! ( c l a s s ( m44 ( l e x k n i g h t ) ) ) ( member b6 ) )
( m130 ! ( c l a s s ( m38 ) ) ( member b6 ) )
( m129 ! ( c l a s s ( m44 ) ) ( member b7 ) )
( m128 ! ( c l a s s ( m38 ) ) ( member b7 ) )
( m127 ! ( c l a s s ( m44 ) ) ( member b8 ) )
( m126 ! ( c l a s s ( m38 ) ) ( member b8 ) )
( m125 ! ( c l a s s ( m40 ) ) ( member b9 ) )
( m124 ! ( c l a s s ( m38 ) ) ( member b9 ) )
( m123 ! ( c l a s s ( m40 ) ) ( member b10 ) )
( m122 ! ( c l a s s ( m38 ) ) ( member b10 ) )
( m121 ! ( c l a s s ( m40 ) ) ( member b11 ) )
( m120 ! ( c l a s s ( m38 ) ) ( member b11 ) )
( m119 ! ( c l a s s ( m18 ) ) ( member ( m84 ( l e x c h a i r ) ) ) )
( m118 ! ( c l a s s ( m18 ) ) ( member ( m51 ) ) )
( m117 ! ( c l a s s ( m89 ( l e x c o l o r ) ) ) ( member ( m88 ( l e x w h i t e ) ) ) )
( m116 ! ( c l a s s ( m89 ) ) ( member ( m91 ( l e x b l a c k ) ) ) )
( m115 ! ( c l a s s ( m94 ( l e x s i z e ) ) ) ( member ( m93 ( l e x s m a l l ) ) ) )
( m114 ! ( c l a s s ( m94 ) ) ( member ( m98 ( l e x l a r g e ) ) ) )
( m39 ! ( c l a s s ( m38 ) ) ( member b2 ) )
( m36 ! ( c l a s s ( m29 ) ) ( member b1 ) )
( m173 !
m145 !
m133 !
m121 !
m171 !
m144 !
m132 !
m120 !
m167 !
m143 !
m131 !
m119 !
m165 !
m142 !
m130 !
m118 !
m163 !
m141 !
m129 !
m117 !
m161 !
m140 !
m128 !
m116 !
m157 !
m139 !
m127 !
m115 !
m155 !
m138 !
m126 !
m114 !
CPU time : 0 . 8 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; Presumably , quadruped i s a s u b c l a s s o f animal
; ; Presumably , v e r t e b r a t e i s a s u b c l a s s o f animal
65
m153 ! m151 ! m147 ! m146 !
m137 ! m136 ! m135 ! m134 !
m125 ! m124 ! m123 ! m122 !
m39 ! m36 ! )
;;
;;
;;
;;
;;
;;
;;
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
mammal i s a s u b c l a s s o f animal
d e e r i s a s u b c l a s s o f animal
h a r t i s a s u b c l a s s o f animal
h o r s e i s a s u b c l a s s o f animal
dog i s a s u b c l a s s o f animal
hound i s a s u b c l a s s o f animal
p h y s i c a l o b j e c t i s a s u b c l a s s o f animal
; ; I f something i s presumably an animal and i s a member o f a n o t h e r c l a s s then
;;
presumably , t h a t c l a s s i s a s u b c l a s s o f animal
( describe
( add f o r a l l ( ∗ animal1 ∗ c l a s s 2 )
&ant ( ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d member ∗ animal1 c l a s s ( b u i l d l e x ” animal ” ) ) )
( b u i l d member ∗ animal1
class ∗ class2 ))
cq ( b u i l d mode ( b u i l d l e x ” presumably ” )
object ( build subclass ∗ class2
s u p e r c l a s s ( b u i l d l e x ” animal ” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m174 ! ( f o r a l l v6 v4 )
(& ant
( p15 ( mode ( m150 ( l e x presumably ) ) )
( o b j e c t ( p10 ( c l a s s ( m1 ( l e x animal ) ) ) ( member v4 ) ) ) )
( p11 ( c l a s s v6 ) ( member v4 ) ) )
( cq ( p13 ( mode ( m150 ) ) ( o b j e c t ( p12 ( s u b c l a s s v6 ) ( s u p e r c l a s s ( m1 ) ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m174 ! )
CPU time : 0 . 0 7
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None
; ; I f something i s a mammal and a member o f a n o t h e r c l a s s then
; ; presumably , t h a t c l a s s i s a s u b c l a s s o f mammal
( describe
( add f o r a l l ( ∗ animal1 ∗ c l a s s 2 )
&ant ( ( b u i l d member ∗ animal1
c l a s s ( b u i l d l e x ”mammal” ) )
( b u i l d member ∗ animal1
class ∗ class2 ))
cq ( b u i l d mode
( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d s u b c l a s s ∗ c l a s s 2 s u p e r c l a s s ( b u i l d l e x ”mammal” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m197 ! ( mode ( m150 ( l e x presumably ) ) )
( o b j e c t ( m196 ( s u b c l a s s ( m10 ( l e x mammal ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m195 ! ( mode ( m150 ) )
( o b j e c t ( m194 ( s u b c l a s s ( m13 ( l e x d e e r ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m193 ! ( mode ( m150 ) )
( o b j e c t ( m192 ( s u b c l a s s ( m20 ( l e x h a r t ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m191 ! ( mode ( m150 ) )
( o b j e c t ( m190 ( s u b c l a s s ( m22 ( l e x h o r s e ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m189 ! ( mode ( m150 ) )
( o b j e c t ( m188 ( s u b c l a s s ( m27 ( l e x pony ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m187 ! ( mode ( m150 ) )
66
( o b j e c t ( m186 ( s u b c l a s s ( m34 ( l e x hound ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m185 ! ( mode ( m150 ) )
( o b j e c t ( m184 ( s u b c l a s s ( m1 ( l e x animal ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m183 ! ( mode ( m150 ) )
( o b j e c t ( m182 ( s u b c l a s s ( m4 ( l e x quadruped ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m181 ! ( mode ( m150 ) )
( o b j e c t ( m180 ( s u b c l a s s ( m29 ( l e x dog ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m179 ! ( mode ( m150 ) )
( o b j e c t ( m178 ( s u b c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m177 ! ( mode ( m150 ) )
( o b j e c t ( m176 ( s u b c l a s s ( m2 ( l e x phys o b j ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m175 ! ( f o r a l l v6 v4 )
(& ant ( p16 ( c l a s s ( m10 ) ) ( member v4 ) ) ( p11 ( c l a s s v6 ) ( member v4 ) ) )
( cq ( p18 ( mode ( m150 ) ) ( o b j e c t ( p17 ( s u b c l a s s v6 ) ( s u p e r c l a s s ( m10 ) ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m144 ! ( c l a s s ( m10 ) ) ( member b1 ) )
( m197 ! m195 ! m193 ! m191 ! m189 ! m187 ! m185 ! m183 ! m181 ! m179 ! m177 ! m175 !
m144 ! )
CPU time : 0 . 5 8
∗
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
Newly i n f e r r e d i n f o r m a t i o n :
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
mammal i s a s u b c l a s s o f mammal
d e e r i s a s u b c l a s s o f mammal
h a r t i s a s u b c l a s s o f mammal
h o r s e i s a s u b c l a s s o f mammal
pony i s a s u b c l a s s o f mammal
hound i s a s u b c l a s s o f mammal
animal i s a s u b c l a s s o f mammal
v e r t e b r a t e i s a s u b c l a s s o f mammal
quadruped i s a s u b c l a s s o f mammal
dog i s a s u b c l a s s o f mammal
p h y s i c a l o b j e c t i s a s u b c l a s s o f mammal
; ; I f something i s a mammal , then i t presumably b e a r s l i v e young
( describe
( add f o r a l l ∗ animal1
ant ( b u i l d member ∗ animal1
c l a s s ( b u i l d l e x ”mammal” ) )
cq ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d a g e n t ∗ animal1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” b e a r ” )
o b j e c t ( b u i l d l e x ” l i v e young ” ) ) ) )
kn cat ” l i f e − r u l e .1” ))
( m203 ! ( mode ( m150 ( l e x presumably ) ) )
( object
( m202
( a c t ( m200 ( a c t i o n ( m198 ( l e x b e a r ) ) ) ( o b j e c t ( m199 ( l e x l i v e young ) ) ) ) )
( a g e n t b1 ) ) ) )
( m201 ! ( f o r a l l v4 ) ( ant ( p16 ( c l a s s ( m10 ( l e x mammal ) ) ) ( member v4 ) ) )
( cq ( p21 ( mode ( m150 ) ) ( o b j e c t ( p20 ( a c t ( m200 ) ) ( a g e n t v4 ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m203 ! m201 ! )
CPU time : 0 . 0 6
67
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; The dog ( b1 ) b e a r s l i v e young
; ” I f something b e a r s something e l s e , t h e b e a r e r i s an animal ”
( describe
( add f o r a l l ( ∗ animal1 $animal2 )
ant ( b u i l d a g e n t ∗ animal1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” b e a r ” )
o b j e c t ∗ animal2 ) )
cq ( b u i l d member ∗ animal1
c l a s s ( b u i l d l e x ”mammal” ) )
kn cat ” l i f e − r u l e .1” ))
( m204 ! ( f o r a l l v7 v4 )
( ant ( p23 ( a c t ( p22 ( a c t i o n ( m198 ( l e x b e a r ) ) ) ( o b j e c t v7 ) ) ) ( a g e n t v4 ) ) )
( cq ( p16 ( c l a s s ( m10 ( l e x mammal ) ) ) ( member v4 ) ) ) ( k n c a t l i f e − r u l e . 1 ) )
( m204 ! )
CPU time : 0 . 0 5
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None
; I f t h e r e i s a p e r s o n and t h a t p e r s o n can c a r r y something , then t h e
; t h i n g t h a t can be c a r r i e d has t h e p r o p e r t y ” s m a l l ” .
( describe
( add f o r a l l ( $ t h i n g y $ p e r s o n )
&ant ( ( b u i l d member ∗ p e r s o n c l a s s ( b u i l d l e x ” p e r s o n ” ) )
( build agent ∗ person act ( build a c t i o n ( build l e x ” carry ” ) o b j e c t ∗ thingy ) ) )
cq ( b u i l d o b j e c t ∗ t h i n g y p r o p e r t y ( b u i l d l e x ” s m a l l ” ) )
kn cat ” l i f e − r u l e .2” ))
( m206 ! ( f o r a l l v9 v8 )
(& ant ( p26 ( a c t ( p25 ( a c t i o n ( m205 ( l e x c a r r y ) ) ) ( o b j e c t v8 ) ) ) ( a g e n t v9 ) )
( p24 ( c l a s s ( m38 ( l e x p e r s o n ) ) ) ( member v9 ) ) )
( cq ( p27 ( o b j e c t v8 ) ( p r o p e r t y ( m93 ( l e x s m a l l ) ) ) ) ) ( k n c a t l i f e − r u l e . 2 ) )
( m137 ! ( c l a s s ( m38 ) ) ( member b3 ) )
( m132 ! ( c l a s s ( m38 ) ) ( member b5 ) )
( m130 ! ( c l a s s ( m38 ) ) ( member b6 ) )
( m128 ! ( c l a s s ( m38 ) ) ( member b7 ) )
( m126 ! ( c l a s s ( m38 ) ) ( member b8 ) )
( m124 ! ( c l a s s ( m38 ) ) ( member b9 ) )
( m122 ! ( c l a s s ( m38 ) ) ( member b10 ) )
( m120 ! ( c l a s s ( m38 ) ) ( member b11 ) )
( m39 ! ( c l a s s ( m38 ) ) ( member b2 ) )
( m206 ! m137 ! m132 ! m130 ! m128 ! m126 ! m124 ! m122 ! m120 ! m39 ! )
CPU time : 0 . 3 7
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None
68
; I f something wants something then t h e t h i n g t h a t i s wanted i s v a l u a b l e
( describe
( add f o r a l l ( ∗ t h i n g y ∗ p e r s o n )
ant ( b u i l d a g e n t ∗ p e r s o n a c t ( b u i l d a c t i o n ( b u i l d l e x ”want” ) o b j e c t ∗ t h i n g y ) )
cq ( b u i l d o b j e c t ∗ t h i n g y p r o p e r t y ( b u i l d l e x ” v a l u a b l e ” ) )
kn cat ” l i f e − r u l e .2” ))
( m209 ! ( f o r a l l v9 v8 )
( ant ( p31 ( a c t ( p30 ( a c t i o n ( m207 ( l e x want ) ) ) ( o b j e c t v8 ) ) ) ( a g e n t v9 ) ) )
( cq ( p32 ( o b j e c t v8 ) ( p r o p e r t y ( m208 ( l e x v a l u a b l e ) ) ) ) ) ( k n c a t l i f e − r u l e . 2 ) )
( m209 ! )
CPU time : 0 . 0 8
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None
; I f something s a y s t h a t i t wants a n o t h e r t h i n g , then i t a c t u a l l y
; d o e s want t h a t t h i n g
( describe
( add f o r a l l ( ∗ t h i n g y ∗ p e r s o n )
ant ( b u i l d a g e n t ∗ p e r s o n a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( build agent ∗ person
a c t ( b u i l d a c t i o n ( b u i l d l e x ”want” )
object ∗ thingy ) ) ) )
cq ( b u i l d a g e n t ∗ p e r s o n
a c t ( b u i l d a c t i o n ( b u i l d l e x ”want” )
object ∗ thingy ))
kn cat ” l i f e − r u l e .2” ))
( m211 ! ( f o r a l l v9 v8 )
( ant
( p34
( a c t ( p33 ( a c t i o n ( m210 ( l e x say t h a t ) ) )
( object
( p31 ( a c t ( p30 ( a c t i o n ( m207 ( l e x want ) ) ) ( o b j e c t v8 ) ) )
( a g e n t v9 ) ) ) ) )
( a g e n t v9 ) ) )
( cq ( p31 ) ) ( k n c a t l i f e − r u l e . 2 ) )
( m211 ! )
CPU time : 0 . 0 5
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
;
( describe
; I f a member o f some c l a s s has a p r o p e r t y t h a t i s a c o l o r ,
; then t h e c l a s s t h a t i t i s a member o f i s a s u b c l a s s o f ’ p h y s i c a l o b j e c t ’
( add f o r a l l ( $ t h i n g $prop $ f o o )
69
&ant ( ( b u i l d member ∗ f o o c l a s s ∗ t h i n g )
( b u i l d o b j e c t ∗ f o o p r o p e r t y ∗ prop )
( b u i l d member ∗ prop c l a s s ( b u i l d l e x ” c o l o r ” ) ) )
cq ( b u i l d s u b c l a s s ∗ t h i n g s u p e r c l a s s ( b u i l d l e x ” phys o b j ” ) )
kn cat ” i n t r i n s i c ” ))
( m212 ! ( f o r a l l v12 v11 v10 )
(& ant ( p37 ( c l a s s ( m89 ( l e x c o l o r ) ) ) ( member v11 ) )
( p36 ( o b j e c t v12 ) ( p r o p e r t y v11 ) ) ( p35 ( c l a s s v10 ) ( member v12 ) ) )
( cq ( p38 ( s u b c l a s s v10 ) ( s u p e r c l a s s ( m2 ( l e x phys o b j ) ) ) ) )
( kn cat i n t r i n s i c ))
( m147 ! ( c l a s s ( m18 ( l e x b a s i c c t g y ) ) ) ( member ( m13 ( l e x d e e r ) ) ) )
( m146 ! ( c l a s s ( m18 ) ) ( member ( m22 ( l e x h o r s e ) ) ) )
( m145 ! ( c l a s s ( m18 ) ) ( member ( m29 ( l e x dog ) ) ) )
( m144 ! ( c l a s s ( m10 ( l e x mammal ) ) ) ( member b1 ) )
( m143 ! ( c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) ( member b1 ) )
( m142 ! ( c l a s s ( m4 ( l e x quadruped ) ) ) ( member b1 ) )
( m141 ! ( c l a s s ( m2 ) ) ( member b1 ) )
( m140 ! ( c l a s s ( m1 ( l e x animal ) ) ) ( member b1 ) )
( m139 ! ( c l a s s ( m18 ) ) ( member ( m38 ( l e x p e r s o n ) ) ) )
( m138 ! ( c l a s s ( m40 ( l e x k i n g ) ) ) ( member b3 ) )
( m137 ! ( c l a s s ( m38 ) ) ( member b3 ) )
( m136 ! ( c l a s s ( m81 ( l e x f u r n i t u r e ) ) ) ( member ( m50 ( l e x Round Table ) ) ) )
( m135 ! ( c l a s s ( m51 ( l e x t a b l e ) ) ) ( member ( m50 ) ) )
( m134 ! ( c l a s s ( m56 ( l e x sword ) ) ) ( member b4 ) )
( m133 ! ( c l a s s ( m42 ( l e x w i z a r d ) ) ) ( member b5 ) )
( m132 ! ( c l a s s ( m38 ) ) ( member b5 ) )
( m131 ! ( c l a s s ( m44 ( l e x k n i g h t ) ) ) ( member b6 ) )
( m130 ! ( c l a s s ( m38 ) ) ( member b6 ) )
( m129 ! ( c l a s s ( m44 ) ) ( member b7 ) )
( m128 ! ( c l a s s ( m38 ) ) ( member b7 ) )
( m127 ! ( c l a s s ( m44 ) ) ( member b8 ) )
( m126 ! ( c l a s s ( m38 ) ) ( member b8 ) )
( m125 ! ( c l a s s ( m40 ) ) ( member b9 ) )
( m124 ! ( c l a s s ( m38 ) ) ( member b9 ) )
( m123 ! ( c l a s s ( m40 ) ) ( member b10 ) )
( m122 ! ( c l a s s ( m38 ) ) ( member b10 ) )
( m121 ! ( c l a s s ( m40 ) ) ( member b11 ) )
( m120 ! ( c l a s s ( m38 ) ) ( member b11 ) )
( m119 ! ( c l a s s ( m18 ) ) ( member ( m84 ( l e x c h a i r ) ) ) )
( m118 ! ( c l a s s ( m18 ) ) ( member ( m51 ) ) )
( m117 ! ( c l a s s ( m89 ) ) ( member ( m88 ( l e x w h i t e ) ) ) )
( m116 ! ( c l a s s ( m89 ) ) ( member ( m91 ( l e x b l a c k ) ) ) )
( m115 ! ( c l a s s ( m94 ( l e x s i z e ) ) ) ( member ( m93 ( l e x s m a l l ) ) ) )
( m114 ! ( c l a s s ( m94 ) ) ( member ( m98 ( l e x l a r g e ) ) ) )
( m39 ! ( c l a s s ( m38 ) ) ( member b2 ) )
( m36 ! ( c l a s s ( m29 ) ) ( member b1 ) )
( m212 ! m147 ! m146 ! m145 ! m144 ! m143 ! m142 ! m141 ! m140 ! m139 ! m138 ! m137 !
m136 ! m135 ! m134 ! m133 ! m132 ! m131 ! m130 ! m129 ! m128 ! m127 ! m126 ! m125 !
m124 ! m123 ! m122 ! m121 ! m120 ! m119 ! m118 ! m117 ! m116 ! m115 ! m114 ! m39 ! m36 ! )
CPU time : 0 . 7 7
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
70
; I f a member o f some c l a s s has a p r o p e r t y t h a t i s a s i z e ,
; then t h e c l a s s t h a t i t i s a member o f i s a s u b c l a s s o f ’ p h y s i c a l o b j e c t ’
( describe
( add f o r a l l ( ∗ t h i n g ∗ prop ∗ f o o )
&ant ( ( b u i l d member ∗ f o o c l a s s ∗ t h i n g )
( b u i l d o b j e c t ∗ f o o p r o p e r t y ∗ prop )
( b u i l d member ∗ prop c l a s s ( b u i l d l e x ” s i z e ” ) ) )
cq ( b u i l d s u b c l a s s ∗ t h i n g s u p e r c l a s s ( b u i l d l e x ” phys o b j ” ) )
kn cat ” i n t r i n s i c ” ))
( m213 ! ( f o r a l l v12 v11 v10 )
(& ant ( p42 ( c l a s s ( m94 ( l e x s i z e ) ) ) ( member v11 ) )
( p36 ( o b j e c t v12 ) ( p r o p e r t y v11 ) ) ( p35 ( c l a s s v10 ) ( member v12 ) ) )
( cq ( p38 ( s u b c l a s s v10 ) ( s u p e r c l a s s ( m2 ( l e x phys o b j ) ) ) ) )
( kn cat i n t r i n s i c ))
( m115 ! ( c l a s s ( m94 ) ) ( member ( m93 ( l e x s m a l l ) ) ) )
( m114 ! ( c l a s s ( m94 ) ) ( member ( m98 ( l e x l a r g e ) ) ) )
( m213 ! m115 ! m114 ! )
CPU time : 0 . 1 4
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; A weapon damages
( describe
( add f o r a l l $weapon1
ant ( b u i l d member ∗ weapon1 c l a s s ( b u i l d l e x ”weapon” ) )
cq ( b u i l d a g e n t ∗ weapon1 a c t ( b u i l d a c t i o n ( b u i l d l e x ”damage” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m216 ! ( f o r a l l v13 ) ( ant ( p46 ( c l a s s ( m103 ( l e x weapon ) ) ) ( member v13 ) ) )
( cq ( p47 ( a c t ( m215 ( a c t i o n ( m214 ( l e x damage ) ) ) ) ) ( a g e n t v13 ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m216 ! )
CPU time : 0 . 0 9
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; I f something i s an e l d e r then t h a t t h i n g i s o l d and i s presumably a p e r s o n
( describe
( add f o r a l l $ e l d 1
ant ( b u i l d member ∗ e l d 1
class ( build lex ” elder ” ))
cq ( ( b u i l d o b j e c t ∗ e l d 1 p r o p e r t y ( b u i l d l e x ” o l d ” ) )
( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d member ∗ e l d 1 c l a s s ( b u i l d l e x ” p e r s o n ” ) ) ) )
kn cat ” l i f e − r u l e .1” ))
( m219 ! ( f o r a l l v14 ) ( ant ( p51 ( c l a s s ( m217 ( l e x e l d e r ) ) ) ( member v14 ) ) )
71
( cq
( p54 ( mode ( m150 ( l e x presumably ) ) )
( o b j e c t ( p53 ( c l a s s ( m38 ( l e x p e r s o n ) ) ) ( member v14 ) ) ) )
( p52 ( o b j e c t v14 ) ( p r o p e r t y ( m218 ( l e x o l d ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m219 ! )
CPU time : 0 . 1 2
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; i f one t h i n g c h a s e s a n o t h e r , t h e f o r m e r r u n s behind t h e l a t t e r
( describe
( add f o r a l l ( $ c h a s e r $ c h a s e e )
ant ( b u i l d a g e n t ∗ c h a s e r a c t ( b u i l d a c t i o n ( b u i l d l e x ” c h a s e ” ) o b j e c t ∗ c h a s e e ) )
cq ( ( b u i l d a g e n t ∗ c h a s e r a c t ( b u i l d a c t i o n ( b u i l d l e x ” run ” ) ) )
( b u i l d o b j e c t 1 ∗ c h a s e r r e l ( b u i l d l e x ” behind ” ) o b j e c t 2 ∗ c h a s e e ) )
kn cat ” l i f e − r u l e .1” ))
( m224 ! ( f o r a l l v16 v15 )
( ant ( p59 ( a c t ( p58 ( a c t i o n ( m220 ( l e x c h a s e ) ) ) ( o b j e c t v16 ) ) ) ( a g e n t v15 ) ) )
( cq ( p61 ( o b j e c t 1 v15 ) ( o b j e c t 2 v16 ) ( r e l ( m223 ( l e x behind ) ) ) )
( p60 ( a c t ( m222 ( a c t i o n ( m221 ( l e x run ) ) ) ) ) ( a g e n t v15 ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m224 ! )
CPU time : 0 . 0 6
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
End o f / p r o j e c t s / s t n 2 /CVA/demos/ b r a c h e t . b a s e d e m o n s t r a t i o n .
CPU time : 4 . 8 6
∗
; ; ; This i s t h e c o n t e n t o f Karen ’ s o r i g i n a l ” br . t x t 1 ” f i l e
;;;
; Right s o a s they s a t , t h e r e came a w h i t e h a r t r u n n i n g i n t o t h e h a l l with
; a w h i t e b r a c h e t n ex t t o him , and t h i r t y c o u p l e s o f b l a c k hounds came
; r u n n i n g a f t e r them with a g r e a t c r y .
; ; In t h e s t o r y , t h e r e i s a h a r t
( describe
( add member # h a r t 1
c l a s s ( build lex ” hart ” )
kn cat ” story ” ))
( m239 ! ( mode ( m150 ( l e x presumably ) ) )
( object
( m238
( a c t ( m200 ( a c t i o n ( m198 ( l e x b e a r ) ) ) ( o b j e c t ( m199 ( l e x l i v e young ) ) ) ) )
72
( a g e n t b12 ) ) ) )
( m237 ! ( mode ( m150 ) )
( object
( m236 ( s u b c l a s s ( m8 ( l e x h e r b i v o r e ) ) ) ( s u p e r c l a s s ( m10 ( l e x mammal ) ) ) ) ) )
( m235 ! ( mode ( m150 ) )
( o b j e c t ( m234 ( s u b c l a s s ( m8 ) ) ( s u p e r c l a s s ( m1 ( l e x animal ) ) ) ) ) )
( m233 ! ( c l a s s ( m20 ( l e x h a r t ) ) ) ( member b12 ) )
( m232 ! ( c l a s s ( m13 ( l e x d e e r ) ) ) ( member b12 ) )
( m231 ! ( c l a s s ( m10 ) ) ( member b12 ) )
( m230 ! ( c l a s s ( m8 ) ) ( member b12 ) )
( m229 ! ( c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) ( member b12 ) )
( m228 ! ( c l a s s ( m4 ( l e x quadruped ) ) ) ( member b12 ) )
( m227 ! ( c l a s s ( m2 ( l e x phys o b j ) ) ) ( member b12 ) )
( m226 ! ( c l a s s ( m1 ) ) ( member b12 ) )
( m225 ! ( c l a s s ( m20 ) ) ( k n c a t s t o r y ) ( member b12 ) )
( m197 ! ( mode ( m150 ) ) ( o b j e c t ( m196 ( s u b c l a s s ( m10 ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m195 ! ( mode ( m150 ) ) ( o b j e c t ( m194 ( s u b c l a s s ( m13 ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m193 ! ( mode ( m150 ) ) ( o b j e c t ( m192 ( s u b c l a s s ( m20 ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m191 ! ( mode ( m150 ) )
( o b j e c t ( m190 ( s u b c l a s s ( m22 ( l e x h o r s e ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m189 ! ( mode ( m150 ) )
( o b j e c t ( m188 ( s u b c l a s s ( m27 ( l e x pony ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m187 ! ( mode ( m150 ) )
( o b j e c t ( m186 ( s u b c l a s s ( m34 ( l e x hound ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m185 ! ( mode ( m150 ) ) ( o b j e c t ( m184 ( s u b c l a s s ( m1 ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m183 ! ( mode ( m150 ) ) ( o b j e c t ( m182 ( s u b c l a s s ( m4 ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m181 ! ( mode ( m150 ) )
( o b j e c t ( m180 ( s u b c l a s s ( m29 ( l e x dog ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m179 ! ( mode ( m150 ) ) ( o b j e c t ( m178 ( s u b c l a s s ( m5 ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m177 ! ( mode ( m150 ) ) ( o b j e c t ( m176 ( s u b c l a s s ( m2 ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m173 ! ( mode ( m150 ) ) ( o b j e c t ( m172 ( s u b c l a s s ( m5 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m171 ! ( mode ( m150 ) ) ( o b j e c t ( m170 ( s u b c l a s s ( m4 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m167 ! ( mode ( m150 ) ) ( o b j e c t ( m166 ( s u b c l a s s ( m10 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m165 ! ( mode ( m150 ) ) ( o b j e c t ( m164 ( s u b c l a s s ( m13 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m163 ! ( mode ( m150 ) ) ( o b j e c t ( m162 ( s u b c l a s s ( m20 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m161 ! ( mode ( m150 ) ) ( o b j e c t ( m160 ( s u b c l a s s ( m22 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m157 ! ( mode ( m150 ) ) ( o b j e c t ( m156 ( s u b c l a s s ( m29 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m155 ! ( mode ( m150 ) ) ( o b j e c t ( m154 ( s u b c l a s s ( m34 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m153 ! ( mode ( m150 ) ) ( o b j e c t ( m152 ( s u b c l a s s ( m2 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m239 ! m237 ! m235 ! m233 ! m232 ! m231 ! m230 ! m229 ! m228 ! m227 ! m226 ! m225 !
m197 ! m195 ! m193 ! m191 ! m189 ! m187 ! m185 ! m183 ! m181 ! m179 ! m177 ! m173 !
m171 ! m167 ! m165 ! m163 ! m161 ! m157 ! m155 ! m153 ! )
CPU time : 0 . 9 5
∗
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
Newly i n f e r r e d i n f o r m a t i o n :
Presumably ,
Presumably ,
Presumably ,
The h a r t i s
The h a r t i s
The h a r t i s
The h a r t i s
The h a r t i s
The h a r t i s
t h e h a r t b e a r s l i v e young
t h e h e r b i v o r e s a r e mammals
herbiv ores are animals
a hart
a quadruped
a deer
a mammal
a herbivore
a vertebrate
73
; ; The h a r t i s a p h y s i c a l o b j e c t
; ; The h a r t i s a animal
; ; In t h e s t o r y , t h e h a r t r u n s i n t o something
( describe
( add a g e n t ∗ h a r t 1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” run ” ) ) i n t o # h a l l 1 k n c a t ” s t o r y ” ) )
( m245 ! ( a c t ( m222 ( a c t i o n ( m221 ( l e x run ) ) ) ) ) ( a g e n t b12 ) )
( m244 ! ( a c t ( m222 ) ) ( a g e n t b12 ) ( i n t o b13 ) ( k n c a t s t o r y ) )
( m245 ! m244 ! )
CPU time : 0 . 0 4
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e t h i n g t h a t t h e h a r t r u n s i n t o i s a h a l l
( describe
( add member ∗ h a l l 1 c l a s s ( b u i l d l e x ” h a l l ” ) k n c a t ” s t o r y ” ) )
( m248 ! ( c l a s s ( m246 ( l e x h a l l ) ) ) ( member b13 ) )
( m247 ! ( c l a s s ( m246 ) ) ( k n c a t s t o r y ) ( member b13 ) )
( m248 ! m247 ! )
CPU time : 0 . 0 5
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e h a l l i s King Arthur ’ s h a l l (KA from background )
( describe
( add o b j e c t ∗ h a l l 1 r e l ( b u i l d l e x ” h a l l ” ) p o s s e s s o r ∗KA k n c a t ” story−comp ” ) )
( m249 ! ( k n c a t story−comp ) ( o b j e c t b13 ) ( p o s s e s s o r b3 )
( r e l ( m246 ( l e x h a l l ) ) ) )
( m249 ! )
CPU time : 0 . 0 5
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e r e i s a b r a c h e t
( describe
( add member # b r a c h e t 1
c l a s s ( build lex ” brachet ” )
kn cat ” story ” ))
( m252 ! ( c l a s s ( m250 ( l e x b r a c h e t ) ) ) ( member b14 ) )
( m251 ! ( c l a s s ( m250 ) ) ( k n c a t s t o r y ) ( member b14 ) )
74
( m252 ! m251 ! )
CPU time : 0 . 0 5
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e b r a c h e t i s n ext t o a h a r t
( describe
( add o b j e c t ∗ b r a c h e t 1 l o c a t i o n
( b u i l d s p − r e l ( b u i l d l e x ” nex t t o ” ) o b j e c t ( b u i l d l e x ” h a r t ” ) )
kn cat ” story ” ))
( m255 ! ( k n c a t s t o r y )
( l o c a t i o n ( m254 ( o b j e c t ( m20 ( l e x h a r t ) ) ) ( s p − r e l ( m253 ( l e x next t o ) ) ) ) )
( o b j e c t b14 ) )
( m255 ! )
CPU time : 0 . 0 4
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e b r a c h e t i s w h i t e
( describe
( add o b j e c t ∗ b r a c h e t 1 p r o p e r t y ( b u i l d l e x ” w h i t e ” ) k n c a t ” s t o r y ” ) )
( m258 ! ( s u b c l a s s ( m250 ( l e x b r a c h e t ) ) ) ( s u p e r c l a s s ( m2 ( l e x phys o b j ) ) ) )
( m257 ! ( o b j e c t b14 ) ( p r o p e r t y ( m88 ( l e x w h i t e ) ) ) )
( m256 ! ( k n c a t s t o r y ) ( o b j e c t b14 ) ( p r o p e r t y ( m88 ) ) )
( m258 ! m257 ! m256 ! )
CPU time : 0 . 0 7
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; Brachet i s a s u b c l a s s o f p h y s i c a l o b j e c t .
; ; What d o e s b r a c h e t mean?
ˆ
−−> (defineNoun ” b r a c h e t ” )
D e f in i t i o n of brachet :
C l a s s I n c l u s i o n s : phys o b j ,
P o s s i b l e P r o p e r t i e s : white ,
P o s s i b l y S i m i l a r Items : animal , mammal , d e e r , h o r s e , pony , dog ,
nil
CPU time : 8 . 2 1
∗
; ; In t h e s t o r y , t h e r e i s a hound
75
( describe
( add member #hounds1
c l a s s ( b u i l d l e x ”hound” ) k n c a t ” s t o r y ” ) )
( m305 ! ( mode ( m150 ( l e x presumably ) ) )
( object
( m304
( a c t ( m200 ( a c t i o n ( m198 ( l e x b e a r ) ) ) ( o b j e c t ( m199 ( l e x l i v e young ) ) ) ) )
( a g e n t b15 ) ) ) )
( m303 ! ( a c t ( m109 ( a c t i o n ( m108 ( l e x hunt ) ) ) ) ) ( a g e n t b15 ) )
( m302 ! ( c l a s s ( m34 ( l e x hound ) ) ) ( member b15 ) )
( m301 ! ( c l a s s ( m29 ( l e x dog ) ) ) ( member b15 ) )
( m300 ! ( c l a s s ( m10 ( l e x mammal ) ) ) ( member b15 ) )
( m299 ! ( c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) ( member b15 ) )
( m298 ! ( c l a s s ( m4 ( l e x quadruped ) ) ) ( member b15 ) )
( m297 ! ( c l a s s ( m2 ( l e x phys o b j ) ) ) ( member b15 ) )
( m296 ! ( c l a s s ( m1 ( l e x animal ) ) ) ( member b15 ) )
( m295 ! ( c l a s s ( m34 ) ) ( k n c a t s t o r y ) ( member b15 ) )
( m264 ! ( mode ( m150 ) )
( o b j e c t ( m261 ( s u b c l a s s ( m250 ( l e x b r a c h e t ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m263 ! ( mode ( m150 ) ) ( o b j e c t ( m260 ( s u b c l a s s ( m250 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m197 ! ( mode ( m150 ) ) ( o b j e c t ( m196 ( s u b c l a s s ( m10 ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m195 ! ( mode ( m150 ) )
( o b j e c t ( m194 ! ( s u b c l a s s ( m13 ( l e x d e e r ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m193 ! ( mode ( m150 ) )
( o b j e c t ( m192 ( s u b c l a s s ( m20 ( l e x h a r t ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m191 ! ( mode ( m150 ) )
( o b j e c t ( m190 ( s u b c l a s s ( m22 ( l e x h o r s e ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m189 ! ( mode ( m150 ) )
( o b j e c t ( m188 ( s u b c l a s s ( m27 ( l e x pony ) ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m187 ! ( mode ( m150 ) ) ( o b j e c t ( m186 ( s u b c l a s s ( m34 ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m185 ! ( mode ( m150 ) ) ( o b j e c t ( m184 ( s u b c l a s s ( m1 ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m183 ! ( mode ( m150 ) ) ( o b j e c t ( m182 ( s u b c l a s s ( m4 ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m181 ! ( mode ( m150 ) ) ( o b j e c t ( m180 ! ( s u b c l a s s ( m29 ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m179 ! ( mode ( m150 ) ) ( o b j e c t ( m178 ( s u b c l a s s ( m5 ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m177 ! ( mode ( m150 ) ) ( o b j e c t ( m176 ( s u b c l a s s ( m2 ) ) ( s u p e r c l a s s ( m10 ) ) ) ) )
( m173 ! ( mode ( m150 ) ) ( o b j e c t ( m172 ( s u b c l a s s ( m5 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m171 ! ( mode ( m150 ) ) ( o b j e c t ( m170 ( s u b c l a s s ( m4 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m169 ! ( mode ( m150 ) ) ( o b j e c t ( m168 ( s u b c l a s s ( m1 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m167 ! ( mode ( m150 ) ) ( o b j e c t ( m166 ! ( s u b c l a s s ( m10 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m165 ! ( mode ( m150 ) ) ( o b j e c t ( m164 ! ( s u b c l a s s ( m13 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m163 ! ( mode ( m150 ) ) ( o b j e c t ( m162 ( s u b c l a s s ( m20 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m161 ! ( mode ( m150 ) ) ( o b j e c t ( m160 ! ( s u b c l a s s ( m22 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m159 ! ( mode ( m150 ) ) ( o b j e c t ( m158 ! ( s u b c l a s s ( m27 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m157 ! ( mode ( m150 ) ) ( o b j e c t ( m156 ! ( s u b c l a s s ( m29 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m155 ! ( mode ( m150 ) ) ( o b j e c t ( m154 ( s u b c l a s s ( m34 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m153 ! ( mode ( m150 ) ) ( o b j e c t ( m152 ( s u b c l a s s ( m2 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m305 ! m303 ! m302 ! m301 ! m300 ! m299 ! m298 ! m297 ! m296 ! m295 ! m264 ! m263 !
m197 ! m195 ! m193 ! m191 ! m189 ! m187 ! m185 ! m183 ! m181 ! m179 ! m177 ! m173 !
m171 ! m169 ! m167 ! m165 ! m163 ! m161 ! m159 ! m157 ! m155 ! m153 ! )
CPU time : 1 . 8 4
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; Presumably , t h e hound b e a r s l i v e young
; ; The hound hunts .
76
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
The hound i s a hound .
The hound i s a dog .
The hound i s a quadruped .
The hound i s a mammal .
The hound i s a v e r t e b r a t e .
The hound i s a p h y s i c a l o b j e c t .
The hound i s an animal .
In t h e s t o r y , t h e hound i s a hound .
Presumably , b r a c h e t i s a s u b c l a s s o f mammal .
Presumably , b r a c h e t i s a s u b c l a s s o f animal
; ; In t h e s t o r y , t h e hound i s b l a c k
( describe
( add o b j e c t ∗ hounds1 p r o p e r t y ( b u i l d l e x ” b l a c k ” ) k n c a t ” s t o r y ” ) )
( m312 !
( m311 !
( m310 !
( m309 !
( m308 !
( m307 !
( m306 !
( m285 !
( m283 !
( m278 !
( m273 !
( m270 !
( m268 !
( m258 !
(
(
(
(
(
(
(
(
(
(
(
(
(
(
s u b c l a s s ( m20 ( l e x h a r t ) ) ) ( s u p e r c l a s s ( m2 ( l e x phys o b j ) ) ) )
s u b c l a s s ( m34 ( l e x hound ) ) ) ( s u p e r c l a s s ( m2 ) ) )
s u b c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) ( s u p e r c l a s s ( m2 ) ) )
s u b c l a s s ( m4 ( l e x quadruped ) ) ) ( s u p e r c l a s s ( m2 ) ) )
s u b c l a s s ( m2 ) ) ( s u p e r c l a s s ( m2 ) ) )
o b j e c t b15 ) ( p r o p e r t y ( m91 ( l e x b l a c k ) ) ) )
k n c a t s t o r y ) ( o b j e c t b15 ) ( p r o p e r t y ( m91 ) ) )
s u b c l a s s ( m29 ( l e x dog ) ) ) ( s u p e r c l a s s ( m2 ) ) )
s u b c l a s s ( m27 ( l e x pony ) ) ) ( s u p e r c l a s s ( m2 ) ) )
s u b c l a s s ( m22 ( l e x h o r s e ) ) ) ( s u p e r c l a s s ( m2 ) ) )
s u b c l a s s ( m13 ( l e x d e e r ) ) ) ( s u p e r c l a s s ( m2 ) ) )
s u b c l a s s ( m10 ( l e x mammal ) ) ) ( s u p e r c l a s s ( m2 ) ) )
s u b c l a s s ( m1 ( l e x animal ) ) ) ( s u p e r c l a s s ( m2 ) ) )
s u b c l a s s ( m250 ( l e x b r a c h e t ) ) ) ( s u p e r c l a s s ( m2 ) ) )
( m312 ! m311 ! m310 ! m309 ! m308 ! m307 ! m306 ! m285 ! m283 ! m278 ! m273 ! m270 !
m268 ! m258 ! )
CPU time : 2 . 0 9
∗
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
Newly i n f e r r e d i n f o r m a t i o n :
Hart i s a s u b c l a s s o f p h y s i c a l o b j e c t
Hound i s a s u b c l a s s o f p h y s i c a l o b j e c t
Vertebrate i s a subclass of physical object
Quadruped i s a s u b c l a s s o f p h y s i c a l o b j e c t
Physical object i s a subclass of physical object
Dog i s a s u b c l a s s o f p h y s i c a l o b j e c t
Pony i s a s u b c l a s s o f p h y s i c a l o b j e c t
Horse i s a s u b c l a s s o f p h y s i c a l o b j e c t
Deer i s a s u b c l a s s o f p h y s i c a l o b j e c t
Mammal i s a s u b c l a s s o f p h y s i c a l o b j e c t
Animal i s a s u b c l a s s o f p h y s i c a l o b j e c t
; ; In t h e s t o r y , t h e hound i s r u n n i n g
( describe
( add a g e n t ∗ hounds1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” run ” ) ) k n c a t ” s t o r y ” ) )
( m314 ! ( a c t ( m222 ( a c t i o n ( m221 ( l e x run ) ) ) ) ) ( a g e n t b15 ) )
( m313 ! ( a c t ( m222 ) ) ( a g e n t b15 ) ( k n c a t s t o r y ) )
( m314 ! m313 ! )
77
CPU time : 0 . 0 5
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e hound i s behind t h e h a r t
( describe
( add o b j e c t ∗ hounds1
l o c a t i o n ( b u i l d s p − r e l ( b u i l d l e x ” behind ” )
object ∗ hart1 )
kn cat ” story ” ))
( m316 ! ( k n c a t s t o r y )
( l o c a t i o n ( m315 ( o b j e c t b12 ) ( s p − r e l ( m223 ( l e x behind ) ) ) ) ) ( o b j e c t b15 ) )
( m316 ! )
CPU time : 0 . 0 5
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; Then t h e h a r t went r u n n i n g about t h e Round Table ; a s he went by t h e s i d e b o a r d ,
; t h e w h i t e b r a c h e t b i t him i n t h e b u t t o c k [ . . . ]
; ; In t h e s t o r y , t h e h a r t i s ne xt t o t h e Round Table .
( describe
( add o b j e c t ∗ h a r t 1
l o c a t i o n ( b u i l d s p − r e l ( b u i l d l e x ” ne xt t o ” )
o b j e c t ( b u i l d l e x ”Round Table ” ) )
kn cat ” story ” ))
( m318 ! ( k n c a t s t o r y )
( location
( m317 ( o b j e c t ( m50 ( l e x Round Table ) ) ) ( s p − r e l ( m253 ( l e x next t o ) ) ) ) )
( o b j e c t b12 ) )
( m318 ! )
CPU time : 0 . 0 4
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e b r a c h e t b i t e s something .
( describe
( add a g e n t ∗ b r a c h e t 1
act ( build action ( build lex ” bite ” )
o b j e c t #butt1 )
kn cat ” story ” ))
78
( m321 ! ( a c t ( m319 ( a c t i o n ( m148 ( l e x b i t e ) ) ) ( o b j e c t b16 ) ) ) ( a g e n t b14 ) )
( m320 ! ( a c t ( m319 ) ) ( a g e n t b14 ) ( k n c a t s t o r y ) )
( m260 ! ( s u b c l a s s ( m250 ( l e x b r a c h e t ) ) ) ( s u p e r c l a s s ( m1 ( l e x animal ) ) ) )
( m321 ! m320 ! m260 ! )
CPU time : 0 . 0 5
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; Brachet i s a s u b c l a s s o f animal
; ; In t h e s t o r y , t h e t h i n g t h a t t h e b r a c h e t b i t e s i s p a r t o f t h e h a r t .
( describe
( add whole ∗ h a r t 1 p a r t ∗ b u t t 1 k n c a t ” s t o r y ” ) )
( m322 ! ( k n c a t s t o r y ) ( p a r t b16 ) ( whole b12 ) )
( m322 ! )
CPU time : 0 . 0 5
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e t h i n g t h a t t h e b r a c h e t b i t e s i s a b u t t o c k
( describe
( add member ∗ b u t t 1 c l a s s ( b u i l d l e x ” b u t t o c k ” ) k n c a t ” s t o r y ” ) )
( m325 ! ( c l a s s ( m323 ( l e x b u t t o c k ) ) ) ( member b16 ) )
( m324 ! ( c l a s s ( m323 ) ) ( k n c a t s t o r y ) ( member b16 ) )
( m325 ! m324 ! )
CPU time : 0 . 0 8
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; What d o e s b r a c h e t mean?
ˆ
−−> (defineNoun ” b r a c h e t ” )
D e f in i t i o n of brachet :
C l a s s I n c l u s i o n s : animal ,
P o s s i b l e Actions : b i t e buttock ,
P o s s i b l e P r o p e r t i e s : white ,
P o s s i b l y S i m i l a r Items : mammal , pony ,
nil
CPU time : 5 . 6 9
∗ ;
; Therewith t h e k n i g h t a r o s e , took up t h e b r a c h e t , went f o r t h out o f t h e h a l l ,
; took h i s h o r s e and r o d e away with t h e b r a c h e t .
79
; ; In t h e s t o r y , t h e r e i s a k n i g h t
( describe
( add member # k n i g h t 1 c l a s s ( b u i l d l e x ” k n i g h t ” ) k n c a t ” s t o r y ” ) )
( m328 ! ( c l a s s ( m44 ( l e x k n i g h t ) ) ) ( member b17 ) )
( m327 ! ( c l a s s ( m38 ( l e x p e r s o n ) ) ) ( member b17 ) )
( m326 ! ( c l a s s ( m44 ) ) ( k n c a t s t o r y ) ( member b17 ) )
( m328 ! m327 ! m326 ! )
CPU time : 0 . 1 2
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; The k n i g h t i s a k n i g h t
; ; The k n i g h t i s a p e r s o n
; ; In t h e s t o r y , t h e k n i g h t a r i s e s
( describe
( add a g e n t ∗ k n i g h t 1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” a r i s e ” ) ) k n c a t ” s t o r y ” ) )
( m331 ! ( a c t ( m330 ( a c t i o n ( m329 ( l e x a r i s e ) ) ) ) ) ( a g e n t b17 ) ( k n c a t s t o r y ) )
( m331 ! )
CPU time : 0 . 0 6
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e k n i g h t p i c k s up t h e b r a c h e t
( describe
( add a g e n t ∗ k n i g h t 1
a c t ( b u i l d a c t i o n ( b u i l d l e x ” p i c k up” )
object ∗ brachet1 )
kn cat ” story ” ))
( m334 ! ( a c t ( m333 ( a c t i o n ( m332 ( l e x p i c k up ) ) ) ( o b j e c t b14 ) ) ) ( a g e n t b17 )
( kn cat story ))
( m334 ! )
CPU time : 0 . 0 6
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e k n i g h t mounts something
( describe
( add a g e n t ∗ k n i g h t 1
a c t ( b u i l d a c t i o n ( b u i l d l e x ”mount” )
object #horsey1 )
80
kn cat ” story ” ))
( m337 ! ( a c t ( m336 ( a c t i o n ( m335 ( l e x mount ) ) ) ( o b j e c t b18 ) ) ) ( a g e n t b17 )
( kn cat story ))
( m337 ! )
CPU time : 0 . 0 7
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e t h i n g t h a t t h e k n i g h t mounts i s a h o r s e
( describe
( add member ∗ h o r s e y 1 c l a s s ( b u i l d l e x ” h o r s e ” ) k n c a t ” s t o r y ” ) )
( m344 ! ( c l a s s ( m22 ( l e x h o r s e ) ) ) ( member b18 ) )
( m343 ! ( c l a s s ( m8 ( l e x h e r b i v o r e ) ) ) ( member b18 ) )
( m342 ! ( c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) ( member b18 ) )
( m341 ! ( c l a s s ( m4 ( l e x quadruped ) ) ) ( member b18 ) )
( m340 ! ( c l a s s ( m2 ( l e x phys o b j ) ) ) ( member b18 ) )
( m339 ! ( c l a s s ( m1 ( l e x animal ) ) ) ( member b18 ) )
( m338 ! ( c l a s s ( m22 ) ) ( k n c a t s t o r y ) ( member b18 ) )
( m263 ! ( mode ( m150 ( l e x presumably ) ) )
( o b j e c t ( m260 ! ( s u b c l a s s ( m250 ( l e x b r a c h e t ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m235 ! ( mode ( m150 ) ) ( o b j e c t ( m234 ( s u b c l a s s ( m8 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m173 ! ( mode ( m150 ) ) ( o b j e c t ( m172 ( s u b c l a s s ( m5 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m171 ! ( mode ( m150 ) ) ( o b j e c t ( m170 ( s u b c l a s s ( m4 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m169 ! ( mode ( m150 ) ) ( o b j e c t ( m168 ( s u b c l a s s ( m1 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m167 ! ( mode ( m150 ) )
( o b j e c t ( m166 ! ( s u b c l a s s ( m10 ( l e x mammal ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m165 ! ( mode ( m150 ) )
( o b j e c t ( m164 ! ( s u b c l a s s ( m13 ( l e x d e e r ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m163 ! ( mode ( m150 ) )
( o b j e c t ( m162 ( s u b c l a s s ( m20 ( l e x h a r t ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m161 ! ( mode ( m150 ) ) ( o b j e c t ( m160 ! ( s u b c l a s s ( m22 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m159 ! ( mode ( m150 ) )
( o b j e c t ( m158 ! ( s u b c l a s s ( m27 ( l e x pony ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m157 ! ( mode ( m150 ) )
( o b j e c t ( m156 ! ( s u b c l a s s ( m29 ( l e x dog ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m155 ! ( mode ( m150 ) )
( o b j e c t ( m154 ( s u b c l a s s ( m34 ( l e x hound ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m153 ! ( mode ( m150 ) ) ( o b j e c t ( m152 ( s u b c l a s s ( m2 ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m344 ! m343 ! m342 ! m341 ! m340 ! m339 ! m338 ! m263 ! m235 ! m173 ! m171 ! m169 !
m167 ! m165 ! m163 ! m161 ! m159 ! m157 ! m155 ! m153 ! )
CPU time : 1 . 6 1
∗
;;
;;
;;
;;
;;
;;
Newly i n f e r r e d i n f o r m a t i o n :
The
The
The
The
horse
horse
horse
horse
is
is
is
is
a
a
a
a
horse .
herbivore .
vertebrate .
quadruped .
81
; ; The h o r s e i s a p h y s i c a l o b j e c t .
; ; The h o r s e i s an animal .
;;
; ; In t h e s t o r y , t h e k n i g h t r i d e s t h e h o r s e
( describe
( add a g e n t ∗ k n i g h t 1
act ( build action ( build lex ” ride ” )
object ∗ horsey1 )
kn cat ” story ” ))
( m347 ! ( a c t ( m346 ( a c t i o n ( m345 ( l e x r i d e ) ) ) ( o b j e c t b18 ) ) ) ( a g e n t b17 )
( kn cat story ))
( m347 ! )
CPU time : 0 . 0 7
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e k n i g h t c a r r i e s t h e b r a c h e t
( describe
( add a g e n t ∗ k n i g h t 1
act ( build action ( build lex ” carry ” )
object ∗ brachet1 )
kn cat ” story ” ))
( m351 !
( m350 !
( m349 !
( m258 !
(
(
(
(
o b j e c t b14 ) ( p r o p e r t y ( m93 ( l e x s m a l l ) ) ) )
a c t ( m348 ( a c t i o n ( m205 ( l e x c a r r y ) ) ) ( o b j e c t b14 ) ) ) ( a g e n t b17 ) )
a c t ( m348 ) ) ( a g e n t b17 ) ( k n c a t s t o r y ) )
s u b c l a s s ( m250 ( l e x b r a c h e t ) ) ) ( s u p e r c l a s s ( m2 ( l e x phys o b j ) ) ) )
( m351 ! m350 ! m349 ! m258 ! )
CPU time : 0 . 1 6
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; The b r a c h e t i s s m a l l .
; ; What d o e s b r a c h e t mean?
ˆ
−−> (defineNoun ” b r a c h e t ” )
D e f i n i t i o n of brachet :
C l a s s I n c l u s i o n s : animal ,
P o s s i b l e Actions : b i t e buttock ,
P o s s i b l e P r o p e r t i e s : small , white ,
P o s s i b l y S i m i l a r Items : mammal , pony ,
nil
CPU time : 7 . 1 4
∗
;
; Right s o a l a d y came i n on a w h i t e p a l f r e y and c r i e d a l o u d t o King Arthur ,
82
; ‘ S i r e , s u f f e r me not t o have t h i s s p i t e f o r t h e b r a c h e t i s mine t h a t t h e k n i g h t
; l e d away . ’ ” [ p66 ]
; ; In t h e s t o r y , t h e r e i s a l a d y
( describe
( add member # l a d y 1
c l a s s ( build lex ” lady ” ) kn cat ” story ” ) )
( m354 ! ( c l a s s ( m352 ( l e x l a d y ) ) ) ( member b19 ) )
( m353 ! ( c l a s s ( m352 ) ) ( k n c a t s t o r y ) ( member b19 ) )
( m354 ! m353 ! )
CPU time : 0 . 0 8
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e l a d y s a y s t h a t t h e k n i g h t took t h e b r a c h e t
( describe
( add a g e n t ∗ l a d y 1
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( build agent ∗ knight1
act ( build action ( build lex ” take ” )
object ∗ brachet1 ) ) )
kn cat ” story ” ))
( m359 !
( a c t ( m358 ( a c t i o n ( m210 ( l e x say t h a t ) ) )
( object
( m357 ( a c t ( m356 ( a c t i o n ( m355 ( l e x t a k e ) ) ) ( o b j e c t b14 ) ) )
( a g e n t b17 ) ) ) ) )
( a g e n t b19 ) ( k n c a t s t o r y ) )
( m359 ! )
CPU time : 0 . 0 8
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e l a d y s a y s t h a t t h e b r a c h e t b e l o n g s t o h e r .
( describe
( add a g e n t ∗ l a d y 1
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
object ( build p o s s e s s o r ∗ lady1
object ∗ brachet1
r e l ( build lex ” brachet ” ) ) )
kn cat ” story ” ))
( m362 !
( a c t ( m361 ( a c t i o n ( m210 ( l e x say t h a t ) ) )
( object
( m360 ( o b j e c t b14 ) ( p o s s e s s o r b19 ) ( r e l ( m250 ( l e x b r a c h e t ) ) ) ) ) ) )
( a g e n t b19 ) ( k n c a t s t o r y ) )
83
( m362 ! )
CPU time : 0 . 0 4
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e l a d y s a y s t h a t s h e wants t h e b r a c h e t .
( describe
( add a g e n t ∗ l a d y 1
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( build agent ∗ lady1
a c t ( b u i l d a c t i o n ( b u i l d l e x ”want” )
object ∗ brachet1 ) ) )
kn cat ” story ” ))
( m368 ! ( o b j e c t b14 ) ( p r o p e r t y ( m208 ( l e x v a l u a b l e ) ) ) )
( m367 !
( a c t ( m365 ( a c t i o n ( m210 ( l e x say t h a t ) ) )
( object
( m364 ! ( a c t ( m363 ( a c t i o n ( m207 ( l e x want ) ) ) ( o b j e c t b14 ) ) )
( a g e n t b19 ) ) ) ) )
( a g e n t b19 ) )
( m366 ! ( a c t ( m365 ) ) ( a g e n t b19 ) ( k n c a t s t o r y ) )
( m368 ! m367 ! m366 ! m364 ! )
CPU time : 0 . 0 6
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; The b r a c h e t i s v a l u a b l e .
; ; What d o e s b r a c h e t mean?
ˆ
−−> (defineNoun ” b r a c h e t ” )
D e f in i t i o n of brachet :
C l a s s I n c l u s i o n s : animal ,
P o s s i b l e Actions : b i t e buttock ,
P o s s i b l e P r o p e r t i e s : valuable , small , white ,
P o s s i b l y S i m i l a r Items : mammal , pony ,
nil
CPU time : 8 . 6 8
∗
; ; ; This i s t h e c o n t e n t o f Karen ’ s o r i g i n a l ” br . t x t 2 ” f i l e
;;;
; ” ’ Then , ’ s a i d M e r l i n , ’ c a l l s i r Gawain , f o r he must b r i n g back t h e w h i t e
; h a r t . Also , s i r , ye must c a l l S i r Tor , f o r he must b r i n g back t h e b r a c h e t
; and t h e k n i g h t , o r e l s e s l a y him . . . . ’ ” [ p67 ]
; ; In t h e s t o r y , M e r l i n ( from background ) s a y s t h a t S i r Gawain ( from BG) must b r i n g
;;
the hart to the h a l l
84
( describe
( add
a g e n t ∗ Mer
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d mode ( b u i l d l e x ”must” )
o b j e c t ( b u i l d a g e n t ∗SG
act ( build action ( build lex ” bring ” )
object ∗ hart1 )
to ∗ h a l l 1 ) ) )
kn cat ” story ” ))
( m375 !
( a c t ( m374 ( a c t i o n ( m210 ( l e x say t h a t ) ) )
( object
( m373 ( mode ( m369 ( l e x must ) ) )
( object
( m372 ( a c t ( m371 ( a c t i o n ( m370 ( l e x b r i n g ) ) ) ( o b j e c t b12 ) ) )
( a g e n t b8 ) ( t o b13 ) ) ) ) ) ) )
( a g e n t b5 ) ( k n c a t s t o r y ) )
( m375 ! )
CPU time : 0 . 0 7
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , M e r l i n s a y s t h a t an unknown t h i n g must b r i n g t h e
;;
brachet to the h a l l
( describe
( add
a g e n t ∗ Mer
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d mode ( b u i l d l e x ”must” )
o b j e c t ( build agent #SirTor
act ( build action ( build lex ” bring ” )
object ∗ brachet1 )
to ∗ h a l l 1 ) ) )
kn cat ” story ” ))
( m380 !
( a c t ( m379 ( a c t i o n ( m210 ( l e x say t h a t ) ) )
( object
( m378 ( mode ( m369 ( l e x must ) ) )
( object
( m377 ( a c t ( m376 ( a c t i o n ( m370 ( l e x b r i n g ) ) ) ( o b j e c t b14 ) ) )
( a g e n t b20 ) ( t o b13 ) ) ) ) ) ) )
( a g e n t b5 ) ( k n c a t s t o r y ) )
( m380 ! )
CPU time : 0 . 0 7
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
85
; ; In t h e s t o r y , t h e t h i n g t h a t must b r i n g t h e b r a c h e t t o t h e h a l l i s
;;
named S i r Tor
( describe
( as se rt o b j e c t ∗ S i r T o r proper−name ( b u i l d l e x ” S i r Tor” ) k n c a t ” s t o r y ” ) )
( m382 ! ( k n c a t s t o r y ) ( o b j e c t b20 ) ( proper−name ( m381 ( l e x S i r Tor ) ) ) )
( m382 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , S i r Tor i s a k n i g h t
( describe
( a sse r t member ∗ S i r T o r c l a s s ( b u i l d l e x ” k n i g h t ” ) k n c a t ” story−comp ” ) )
( m383 ! ( c l a s s ( m44 ( l e x k n i g h t ) ) ) ( k n c a t story−comp ) ( member b20 ) )
( m383 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , M e r l i n s a y s t h a t S i r Tor must e i t h e r b r i n g t h e k n i g h t
; ; who took t h e b r a c h e t t o t h e h a l l o r he must s l a y t h e k n i g h t who
;;
took t h e b r a c h e t .
( describe
( add a g e n t ∗ Mer
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d mode ( b u i l d l e x ”must” )
o b j e c t ( b u i l d min 1 max 1
arg ( build agent ∗ SirTor
act ( build action
object
to ∗ h a l l 1 )
arg ( build agent ∗ SirTor
act ( build action
object
kn cat ” story ” ))
( m391 !
( a c t ( m390 ( a c t i o n ( m210 ( l e x say t h a t ) ) )
( object
( m389 ( mode ( m369 ( l e x must ) ) )
( object
( m388 ( min 1 ) (max 1 )
( arg
( m387 ( a c t ( m386 ( a c t i o n ( m106 ( l e x s l a y ) ) ) ( o b j e c t b17 ) ) )
( a g e n t b20 ) )
( m385 ( a c t ( m384 ( a c t i o n ( m370 ( l e x b r i n g ) ) ) ( o b j e c t b17 ) ) )
86
( build lex ” bring ” )
∗ knight1 )
( build lex ” slay ”)
∗ knight1 ) ) ) ) )
( a g e n t b20 ) ( t o b13 ) ) ) ) ) ) ) ) )
( a g e n t b5 ) ( k n c a t s t o r y ) )
( m391 ! )
CPU time : 0 . 0 8
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; What d o e s b r a c h e t mean?
ˆ
−−> (defineNoun ” b r a c h e t ” )
D e f in i t i o n of brachet :
C l a s s I n c l u s i o n s : animal ,
P o s s i b l e Actions : b i t e buttock ,
P o s s i b l e P r o p e r t i e s : valuable , small , white ,
P o s s i b l y S i m i l a r Items : mammal , pony ,
nil
CPU time : 1 0 . 3 2
∗
; ; ; This i s t h e c o n t e n t o f Karen ’ s o r i g i n a l ” br . t x t 3 ” f i l e
;;;
; ‘ S i r , ’ s a i d t h e e l d e r ‘ t h e r e came a w h i t e h a r t t h i s way t h i s day and
; many hounds c h a s e d him , and a w h i t e b r a c h e t was always nex t t o him . ’
; [ p67 ]
; ; In t h e s t o r y , t h e r e i s an e l d e r
( describe
( a s s e r t member # e l d e r c l a s s ( b u i l d l e x ” e l d e r ” ) k n c a t ” s t o r y ” ) )
( m392 ! ( c l a s s ( m217 ( l e x e l d e r ) ) ) ( k n c a t s t o r y ) ( member b21 ) )
( m392 ! )
CPU time : 0 . 0 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e r e i s a h a r t
( describe
( a sse r t member # h a r t 2 c l a s s ( b u i l d l e x ” h a r t ” ) k n c a t ” s t o r y ” ) )
( m393 ! ( c l a s s ( m20 ( l e x h a r t ) ) ) ( k n c a t s t o r y ) ( member b22 ) )
( m393 ! )
CPU time : 0 . 0 2
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
87
; ; None .
; ; In t h e s t o r y , t h e h a r t i s w h i t e
( describe
( as se rt o b j e c t ∗ h a r t 2 p r o p e r t y ( b u i l d l e x ” w h i t e ” ) k n c a t ” s t o r y ” ) )
( m394 ! ( k n c a t s t o r y ) ( o b j e c t b22 ) ( p r o p e r t y ( m88 ( l e x w h i t e ) ) ) )
( m394 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e e l d e r s a y s t h a t t h e h a r t came t o something .
( describe
( add
agent ∗ e l d e r
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( build agent ∗ hart2
a c t ( b u i l d a c t i o n ( b u i l d l e x ”come” )
place #elderplace )))
kn cat ” story ” ))
( m399 !
( a c t ( m398 ( a c t i o n ( m210 ( l e x say t h a t ) ) )
( object
( m397 ( a c t ( m396 ( a c t i o n ( m395 ( l e x come ) ) ) ( p l a c e b23 ) ) )
( a g e n t b22 ) ) ) ) )
( a g e n t b21 ) ( k n c a t s t o r y ) )
( m399 ! )
CPU time : 0 . 0 8
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e e l d e r s a y s t h a t something i s c h a s i n g t h e h a r t .
( describe
( add
agent ∗ e l d e r
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d a g e n t #hounds2
act ( build action ( build lex ” chase ” )
object ∗ hart2 ) ) )
kn cat ” story ” ))
( m403 !
( a c t ( m402 ( a c t i o n ( m210 ( l e x say t h a t ) ) )
( object
( m401 ( a c t ( m400 ( a c t i o n ( m220 ( l e x c h a s e ) ) ) ( o b j e c t b22 ) ) )
( a g e n t b24 ) ) ) ) )
( a g e n t b21 ) ( k n c a t s t o r y ) )
88
( m403 ! )
CPU time : 0 . 0 9
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e t h i n g c h a s i n g t h e h a r t i s a hound
( describe
( a sse r t member ∗ hounds2 c l a s s ( b u i l d l e x ”hound” )
kn cat ” story ” ))
( m404 ! ( c l a s s ( m34 ( l e x hound ) ) ) ( k n c a t s t o r y ) ( member b24 ) )
( m404 ! )
CPU time : 0 . 0 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e e l d e r s a y s t h a t something i s next t o t h e h a r t
( describe
( add
agent ∗ e l d e r
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
object ( build object #brachet2
l o c a t i o n ( b u i l d s p − r e l ( b u i l d l e x ” nex t t o ” )
object ∗ hart2 ) ) )
kn cat ” story ” ))
( m408 !
( a c t ( m407 ( a c t i o n ( m210 ( l e x say t h a t ) ) )
( object
( m406 ( l o c a t i o n ( m405 ( o b j e c t b22 ) ( s p − r e l ( m253 ( l e x next t o ) ) ) ) )
( o b j e c t b25 ) ) ) ) )
( a g e n t b21 ) ( k n c a t s t o r y ) )
( m408 ! )
CPU time : 0 . 0 8
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e t h i n g t h a t i s next t o t h e h a r t i s a b r a c h e t
( describe
( a s s e r t member ∗ b r a c h e t 2
c l a s s ( build lex ” brachet ” )
kn cat ” story ” ))
( m409 ! ( c l a s s ( m250 ( l e x b r a c h e t ) ) ) ( k n c a t s t o r y ) ( member b25 ) )
( m409 ! )
89
CPU time : 0 . 0 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e b r a c h e t i s w h i t e
( describe
( as se r t o b j e c t ∗ b r a c h e t 2 p r o p e r t y ( b u i l d l e x ” w h i t e ” ) k n c a t ” s t o r y ” ) )
( m410 ! ( k n c a t s t o r y ) ( o b j e c t b25 ) ( p r o p e r t y ( m88 ( l e x w h i t e ) ) ) )
( m410 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e two b r a c h e t s a r e a c t u a l l y t h e same b r a c h e t .
( describe
( as s ert e q u i v ∗ b r a c h e t 1 e q u i v ∗ b r a c h e t 2 k n c a t ” story−comp ” ) )
( m411 ! ( e q u i v b25 b14 ) ( k n c a t story−comp ) )
( m411 ! )
CPU time : 0 . 0 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e two h a r t s a r e a c t u a l l y t h e same h a r t .
( describe
( a sse r t e q u i v ∗ h a r t 1 e q u i v ∗ h a r t 2 k n c a t ” story−comp ” ) )
( m412 ! ( e q u i v b22 b12 ) ( k n c a t story−comp ) )
( m412 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e two hounds a r e a c t u a l l y t h e same hound .
( describe
( a sse r t e q u i v ∗ hounds1 e q u i v ∗ hounds2 k n c a t ” story−comp ” ) )
( m413 ! ( e q u i v b24 b15 ) ( k n c a t story−comp ) )
90
( m413 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; What d o e s b r a c h e t mean?
ˆ
−−> (defineNoun ” b r a c h e t ” )
D e f in i t i o n of brachet :
C l a s s I n c l u s i o n s : animal ,
P o s s i b l e Actions : b i t e buttock ,
P o s s i b l e P r o p e r t i e s : valuable , small , white ,
P o s s i b l y S i m i l a r Items : mammal , pony ,
nil
CPU time : 1 3 . 4 4
∗
; ; ; This i s t h e c o n t e n t o f Karen ’ s o r i g i n a l ” br . t x t 4 ” f i l e
;;;
; When S i r Tor was r ea dy , he mounted upon h i s h o r s e ’ s back , and r o d e a f t e r t h e
; k n i g h t with t h e b r a c h e t .
[71]
; ; In t h e s t o r y , S i r Tor mounts something .
( describe
( add a g e n t ∗ S i r T o r
a c t ( b u i l d a c t i o n ( b u i l d l e x ”mount” )
object #torhorse kn cat ” story ” ) ) )
( m422 ! ( a c t ( m421 ( a c t i o n ( m335 ( l e x mount ) ) ) ( k n c a t s t o r y ) ( o b j e c t b26 ) ) )
( a g e n t b20 ) )
( m422 ! )
CPU time : 0 . 0 7
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e t h i n g t h a t S i r Tor mounts i s h i s h o r s e .
( describe
( asse r t o b j e c t ∗ t o r h o r s e r e l ( b u i l d l e x ” h o r s e ” ) p o s s e s s o r ∗ S i r T o r
kn cat ” story ” ))
( m423 ! ( k n c a t s t o r y ) ( o b j e c t b26 ) ( p o s s e s s o r b20 ) ( r e l ( m22 ( l e x h o r s e ) ) ) )
( m423 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
91
;;
; ; None .
; ; In t h e s t o r y , S i r Tor ’ s h o r s e i s a h o r s e .
( describe
( as ser t member ∗ t o r h o r s e c l a s s ( b u i l d l e x ” h o r s e ” ) k n c a t ” s t o r y ” ) )
( m424 ! ( c l a s s ( m22 ( l e x h o r s e ) ) ) ( k n c a t s t o r y ) ( member b26 ) )
( m424 ! )
CPU time : 0 . 0 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , S i r Tor r i d e s h i s h o r s e
( describe
( add a g e n t ∗ S i r T o r
act ( build action ( build lex ” ride ” )
object ∗ torhorse )
d i r e c t i o n ∗ knight1 kn cat ” story ” ))
( m426 ! ( a c t ( m425 ( a c t i o n ( m345 ( l e x r i d e ) ) ) ( o b j e c t b26 ) ) ) ( a g e n t b20 )
( d i r e c t i o n b17 ) ( k n c a t s t o r y ) )
( m426 ! )
CPU time : 0 . 0 6
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e k n i g h t who to ok t h e b r a c h e t i s with t h e b r a c h e t .
( describe
( a s s e r t o b j e c t 1 ∗ k n i g h t 1 r e l ( b u i l d l e x ” with ” ) o b j e c t 2 ∗ b r a c h e t 1
kn cat ” story ” ))
( m428 ! ( k n c a t s t o r y ) ( o b j e c t 1 b17 ) ( o b j e c t 2 b14 ) ( r e l ( m427 ( l e x with ) ) ) )
( m428 ! )
CPU time : 0 . 0 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
;
; ‘ Ye s h a l l say [ you a r e s e n t ]
; with t h e b r a c h e t . ’
[71]
by t h e k n i g h t who went i n q u e s t o f t h e k n i g h t
; ; In t h e s t o r y , S i r Tor s a y s t h a t something s h a l l say t h a t i t was s e n t by t h e k n i g h t
92
; ; who i s q u e s t i n g f o r t h e b r a c h e t .
( describe
( add a g e n t ∗ S i r T o r
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d mode ( b u i l d l e x ” s h a l l ” )
o b j e c t ( b u i l d a g e n t #guys
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
object ( build
agent ( build s k f ” questor−for ”
a1 ∗ k n i g h t 1
a2 ∗ b r a c h e t 1 )
a c t ( b u i l d o b j e c t ∗ guys
action ( build
l e x ” send ” ) ) ) ) ) ) )
kn cat ” story ” ))
( m438 !
( a c t ( m437 ( a c t i o n ( m210 ( l e x say t h a t ) ) )
( object
( m436 ( mode ( m429 ( l e x s h a l l ) ) )
( object
( m435
( a c t ( m434 ( a c t i o n ( m210 ) )
( object
( m433 ( a c t ( m432 ( a c t i o n ( m431 ( l e x send ) ) ) ( o b j e c t b27 ) ) )
( a g e n t ( m430 ( a1 b17 ) ( a2 b14 ) ( s k f q u e s t o r − f o r ) ) ) ) ) ) )
( a g e n t b27 ) ) ) ) ) ) )
( a g e n t b20 ) ( k n c a t s t o r y ) )
( m438 ! )
CPU time : 0 . 1 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , S i r Tor i s t h e k n i g h t who i s q u e s t i n g f o r t h e b r a c h e t
( describe
( a s s e r t e q u i v ( b u i l d s k f ” q u e s t o r − f o r ” a1 ∗ k n i g h t 1 a2 ∗ b r a c h e t 1 )
e q u i v ∗ S i r T o r k n c a t ” story−comp ” ) )
( m439 ! ( e q u i v ( m430 ( a1 b17 ) ( a2 b14 ) ( s k f q u e s t o r − f o r ) ) b20 )
( k n c a t story−comp ) )
( m439 ! )
CPU time : 0 . 0 2
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; What d o e s b r a c h e t mean?
ˆ
−−> (defineNoun ” b r a c h e t ” )
93
D e f in i t i o n of brachet :
C l a s s I n c l u s i o n s : animal ,
P o s s i b l e Actions : b i t e buttock ,
P o s s i b l e P r o p e r t i e s : valuable , small , white ,
P o s s i b l y S i m i l a r Items : mammal , pony ,
nil
CPU time : 1 4 . 8 5
∗
;
; ‘ I know you r i d e a f t e r t h e k n i g h t with t h e w h i t e b r a c h e t , and I s h a l l b r i n g
; you where he i s , ’ s a i d t h e dwarf .
[72]
; In t h e s t o r y , t h e r e i s a dwarf
( describe
( as se r t member # dwarf1 c l a s s ( b u i l d l e x ” dwarf ” ) k n c a t ” s t o r y ” ) )
( m441 ! ( c l a s s ( m440 ( l e x dwarf ) ) ) ( k n c a t s t o r y ) ( member b28 ) )
( m441 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e dwarf s a y s t h a t he knows t h a t S i r Tor s e e k s t h e k n i g h t who took t h e b r a c h e t .
( describe
( add a g e n t ∗ dwarf1
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d a g e n t ∗ dwarf1
a c t ( b u i l d a c t i o n ( b u i l d l e x ”know t h a t ” )
o b j e c t ( build agent ∗ SirTor
act ( build action ( build lex ” seek ” )
object ∗ knight1 ) ) ) ) )
kn cat ” story ” ))
( m449 !
( a c t ( m448 ( a c t i o n ( m210 ( l e x say t h a t ) ) )
( object
( m447
( a c t ( m446 ( a c t i o n ( m442 ( l e x know t h a t ) ) )
( object
( m445 ( a c t ( m444 ( a c t i o n ( m443 ( l e x s e e k ) ) ) ( o b j e c t b17 ) ) )
( a g e n t b20 ) ) ) ) )
( a g e n t b28 ) ) ) ) )
( a g e n t b28 ) ( k n c a t s t o r y ) )
( m449 ! )
CPU time : 0 . 1 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
94
; ; In t h e s t o r y , t h e dwarf s a y s t h a t he w i l l b r i n g S i r Tor s o m e p l a c e .
( describe
( add a g e n t ∗ dwarf1
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d a g e n t ∗ dwarf1
act ( build action ( build lex ” bring ” )
o b j e c t ∗ SirTor to # brplace ) ) )
kn cat ” story ” ))
( m453 !
( a c t ( m452 ( a c t i o n ( m210 ( l e x say t h a t ) ) )
( object
( m451 ( a c t ( m450 ( a c t i o n ( m370 ( l e x b r i n g ) ) ) ( o b j e c t b20 ) ( t o b29 ) ) )
( a g e n t b28 ) ) ) ) )
( a g e n t b28 ) ( k n c a t s t o r y ) )
( m453 ! )
CPU time : 0 . 0 9
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e k n i g h t i s i n t h e p l a c e t h a t t h e dwarf i s t a k i n g S i r Tor .
( describe
( assert o b j e c t ∗ knight1 l o c a t i o n ∗ b r p l a c e kn cat ” s t o r y ” ) )
( m454 ! ( k n c a t s t o r y ) ( l o c a t i o n b29 ) ( o b j e c t b17 ) )
( m454 ! )
CPU time : 0 . 0 6
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e b r a c h e t i s i n t h e p l a c e t h a t t h e dwarf i s t a k i n g S i r Tor .
( describe
( as s ert o b j e c t ∗ b r a c h e t 1 l o c a t i o n ∗ b r p l a c e k n c a t ” story−comp ” ) )
( m455 ! ( k n c a t story−comp ) ( l o c a t i o n b29 ) ( o b j e c t b14 ) )
( m455 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; ; This i s t h e c o n t e n t o f Karen ’ s o r i g i n a l ” br . t x t 5 ” f i l e
95
;;;
; Then he went t o t h e o t h e r p a v i l i o n and found a l a d y l y i n g s l e e p i n g t h e r e i n ;
; and t h e r e was t h e w h i t e b r a c h e t which bayed a t him f a s t .
; ; In t h e s t o r y , S i r Tor g o e s t o some p l a c e
( describe
( add a g e n t ∗ S i r T o r a c t ( b u i l d a c t i o n ( b u i l d l e x ” go ” ) ) t o # p a v i l i o n 1 k n c a t ” s t o r y ” ) )
( m458 ! ( a c t ( m457 ( a c t i o n ( m456 ( l e x go ) ) ) ) ) ( a g e n t b20 ) ( k n c a t s t o r y )
( t o b30 ) )
( m458 ! )
CPU time : 0 . 0 9
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e p l a c e t h a t S i r Tor g o e s t o i s a p a v i l i o n
( describe
( assert member ∗ p a v i l i o n 1
class ( build lex ” pavilion ”)
kn cat ” story ” ))
( m460 ! ( c l a s s ( m459 ( l e x p a v i l i o n ) ) ) ( k n c a t s t o r y ) ( member b30 ) )
( m460 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e l a d y i s s l e e p i n g i n t h e p a v i l i o n
( describe
( add a g e n t ∗ l a d y 1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” s l e e p ” ) p l a c e ∗ p a v i l i o n 1 ) k n c a t ” s t o r y ” ) )
( m463 ! ( a c t ( m462 ( a c t i o n ( m461 ( l e x sleep ) ) ) ( p l a c e b30 ) ) ) ( a g e n t b19 )
( kn cat story ))
( m463 ! )
CPU time : 0 . 0 8
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , S i r Tor f i n d s t h e l a d y i n t h e p a v i l i o n
( describe
( add a g e n t ∗ S i r T o r
act ( build action ( build lex ” find ” )
object ∗ lady1 )
place ∗ pavilion1
kn cat ” story ” ))
96
( m466 ! ( a c t ( m465 ( a c t i o n ( m464 ( l e x find ) ) ) ( o b j e c t b19 ) ) ) ( a g e n t b20 )
( k n c a t s t o r y ) ( p l a c e b30 ) )
( m466 ! )
CPU time : 0 . 1 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , S i r Tor f i n d s t h e b r a c h e t i n t h e p a v i l i o n
( describe
( add a g e n t ∗ S i r T o r
act ( build action ( build lex ” find ” )
object ∗ brachet1 )
place ∗ pavilion1
kn cat ” story ” ))
( m468 ! ( a c t ( m467 ( a c t i o n ( m464 ( l e x find ) ) ) ( o b j e c t b14 ) ) ) ( a g e n t b20 )
( k n c a t s t o r y ) ( p l a c e b30 ) )
( m468 ! )
CPU time : 0 . 0 9
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e b r a c h e t bays a t S i r Tor .
( describe
( add a g e n t ∗ b r a c h e t 1
a c t ( b u i l d a c t i o n ( b u i l d l e x ” bay ” )
d i r e c t i o n ∗ SirTor )
kn cat ” story ” ))
( m470 ! ( a c t ( m469 ( a c t i o n ( m111 ( l e x bay ) ) ) ( d i r e c t i o n b20 ) ) ) ( a g e n t b14 )
( kn cat story ))
( m289 ! ( a c t ( m112 ( a c t i o n ( m111 ) ) ) ) ( a g e n t b14 ) )
( m259 ! ( s u b c l a s s ( m250 ( l e x b r a c h e t ) ) ) ( s u p e r c l a s s ( m34 ( l e x hound ) ) ) )
( m470 ! m289 ! m259 ! )
CPU time : 0 . 2 2
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; The b r a c h e t bays .
; ; Brachet i s a s u b c l a s s o f hound .
; ; What d o e s b r a c h e t mean?
ˆ
−−> (defineNoun ” b r a c h e t ” )
97
D e f in i t i o n of brachet :
C l a s s I n c l u s i o n s : hound , dog ,
P o s s i b l e A c t i o n s : b i t e b u t t o c k , bay , hunt ,
P o s s i b l e P r o p e r t i e s : valuable , small , white ,
nil
CPU time : 8 4 . 3 4
∗
; ; ; This i s t h e c o n t e n t o f Karen ’ s o r i g i n a l ” br . t x t 6 ” f i l e
;;;
; As soon a s S i r Tor s p i e d t h e w h i t e b r a c h e t , he took i t by f o r c e and gave i t
; t o t h e dwarf .
; ; In t h e s t o r y , S i r Tor s p y s t h e b r a c h e t
( describe
( add a g e n t ∗ S i r T o r
a c t ( b u i l d a c t i o n ( b u i l d l e x ” spy ” )
object ∗ brachet1 )
kn cat ” story ” ))
( m500 ! ( a c t ( m499 ( a c t i o n ( m498 ( l e x spy ) ) ) ( o b j e c t b14 ) ) ) ( a g e n t b20 )
( kn cat story ))
( m500 ! )
CPU time : 0 . 1 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , S i r Tor t a k e s t h e b r a c k e t
( describe
( add a g e n t ∗ S i r T o r
act ( build action ( build lex ” take ” )
object ∗ brachet1 )
kn cat ” story ” ))
( m501 ! ( a c t ( m356 ( a c t i o n ( m355 ( l e x t a k e ) ) ) ( o b j e c t b14 ) ) ) ( a g e n t b20 )
( kn cat story ))
( m501 ! )
CPU time : 0 . 1 4
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , S i r Tor g i v e s t h e b r a c h e t t o t h e dwarf
( describe
( add a g e n t ∗ S i r T o r
act ( build action ( build lex ” give ” )
object ∗ brachet1
i n d o b j ∗ dwarf1 )
kn cat ” story ” ))
98
( m504 ! ( a c t ( m503 ( a c t i o n ( m502 ( l e x g i v e ) ) ) ( i n d o b j b28 ) ( o b j e c t b14 ) ) )
( a g e n t b20 ) ( k n c a t s t o r y ) )
( m504 ! )
CPU time : 0 . 0 7
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
;
; With t h e n o i s e , t h e l a d y came out o f t h e p a v i l i o n with a l l h e r d a m o s e l s .
; ; In t h e s t o r y , t h e l a d y comes from t h e p a v i l i o n
( describe
( add a g e n t ∗ l a d y 1 a c t ( b u i l d a c t i o n ( b u i l d l e x ”come” ) from ∗ p a v i l i o n 1 ) k n c a t ” s t o r y ” ) )
( m506 ! ( a c t ( m505 ( a c t i o n ( m395 ( l e x come ) ) ) ( from b30 ) ) ) ( a g e n t b19 )
( kn cat story ))
( m506 ! )
CPU time : 0 . 1 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e r e i s a n o i s e
( describe
( a ss er t member # n o i s e 1
c l a s s ( build lex noise ) kn cat ” story ” ))
( m508 ! ( c l a s s ( m507 ( l e x n o i s e ) ) ) ( k n c a t s t o r y ) ( member b31 ) )
( m508 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e n o i s e c a u s e d t h e l a d y t o come from t h e p a v i l i o n .
( describe
( add
cause ∗ noise1
e f f e c t ( b u i l d a g e n t ∗ l a d y 1 a c t ( b u i l d a c t i o n ( b u i l d l e x ”come” ) from ∗ p a v i l i o n 1 ) )
kn cat ” story ” ))
( m510 ! ( c a u s e b31 )
( effect
( m509 ( a c t ( m505 ( a c t i o n ( m395 ( l e x come ) ) ) ( from b30 ) ) ) ( a g e n t b19 ) ) )
( kn cat story ))
99
( m510 ! )
CPU time : 0 . 0 9
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e r e i s a damosel
( describe
( a sse r t member ∗ d a m o s e l s 1
c l a s s ( b u i l d l e x ” damosel ” )
kn cat ” story ” ))
( m512 ! ( c l a s s ( m511 ( l e x damosel ) ) ) ( k n c a t s t o r y ) )
( m512 ! )
CPU time : 0 . 0 3
∗
; ; In t h e s t o r y , t h e damosel comes from t h e p a v i l i o n
( describe
( add a g e n t # d a m o s e l s 1 a c t ( b u i l d a c t i o n ( b u i l d l e x ”come” ) from ∗ p a v i l i o n 1 ) k n c a t ” s t o r y ” ) )
( m513 ! ( a c t ( m505 ( a c t i o n ( m395 ( l e x come ) ) ) ( from b30 ) ) ) ( a g e n t b32 )
( kn cat story ))
( m513 ! )
CPU time : 0 . 1 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e n o i s e c a u s e d t h e damosel t o come from t h e p a v i l i o n
( describe
( add
cause ∗ noise1
e f f e c t ( b u i l d agent ∗ damosels1 act ( b u i l d a c t i o n
( b u i l d l e x ”come” ) from ∗ p a v i l i o n 1 ) )
kn cat ” story ” ))
( m515 ! ( c a u s e b31 )
( effect
( m514 ( a c t ( m505 ( a c t i o n ( m395 ( l e x come ) ) ) ( from b30 ) ) ) ( a g e n t b32 ) ) )
( kn cat story ))
( m515 ! )
CPU time : 0 . 0 9
∗
; ; In t h e s t o r y , t h e damosel i s a p e r s o n
( describe
( a ss er t member ∗ d a m o s e l s 1 c l a s s ( b u i l d l e x ” p e r s o n ” ) k n c a t ” story−comp ” ) )
100
( m516 ! ( c l a s s ( m38 ( l e x p e r s o n ) ) ) ( k n c a t story−comp ) ( member b32 ) )
( m516 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e n o i s e was t h e b r a c h e t ba yin g .
( describe
( a sse r t e q u i v ∗ n o i s e 1 e q u i v ( b u i l d a g e n t ∗ b r a c h e t 1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” bay ” ) ) )
kn cat ” story comp ” ) )
( m517 ! ( e q u i v b31 ( m289 ! ( a c t ( m112 ( a c t i o n ( m111 ( l e x bay ) ) ) ) ) ( a g e n t b14 ) ) )
( kn cat story comp ) )
( m517 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; ; ‘ What !
W i l l ye t a k e my b r a c h e t from me ? ’ s a i d t h e l a d y .
; ; In t h e s t o r y , t h e l a d y a s k s S i r Tor why he took t h e b r a c h e t from h e r .
( describe
( add a g e n t ∗ l a d y 1
a c t ( b u i l d a c t i o n ( b u i l d l e x ” ask ” )
o b j e c t ( build agent ∗ SirTor
act ( build action ( build lex ” take ” )
object ∗ brachet1 )
from ∗ l a d y 1 ) )
indobj ∗ SirTor kn cat ” story ” ) )
( m521 !
( a c t ( m520 ( a c t i o n ( m518 ( l e x ask ) ) )
( object
( m519 ( a c t ( m356 ( a c t i o n ( m355 ( l e x t a k e ) ) ) ( o b j e c t b14 ) ) )
( a g e n t b20 ) ( from b19 ) ) ) ) )
( a g e n t b19 ) ( i n d o b j b20 ) ( k n c a t s t o r y ) )
( m521 ! )
CPU time : 0 . 1 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , t h e l a d y i s angry .
( describe
101
( a sse r t o b j e c t ∗ l a d y 1 p r o p e r t y ( b u i l d l e x ” angry ” ) k n c a t ” story−comp ” ) )
( m523 ! ( k n c a t story−comp ) ( o b j e c t b19 ) ( p r o p e r t y ( m522 ( l e x angry ) ) ) )
( m523 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , S i r Tor t a k i n g t h e b r a c h e t c a u s e d t h e l a d y t o be angry .
( describe
( as s ert c a u s e ( b u i l d a g e n t ∗ S i r T o r
act ( build action ( build lex ” take ” )
object ∗ brachet1 )
from ∗ l a d y 1 )
e f f e c t ( b u i l d o b j e c t ∗ l a d y 1 p r o p e r t y ( b u i l d l e x ” angry ” ) )
k n c a t ” story−comp ” ) )
( m525 !
( cause
( m519 ( a c t ( m356 ( a c t i o n ( m355 ( l e x t a k e ) ) ) ( o b j e c t b14 ) ) ) ( a g e n t b20 )
( from b19 ) ) )
( e f f e c t ( m524 ( o b j e c t b19 ) ( p r o p e r t y ( m522 ( l e x angry ) ) ) ) )
( k n c a t story−comp ) )
( m525 ! )
CPU time : 0 . 0 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
;
; ‘ Yes , ’ s a i d S i r Tor , ‘ t h i s b r a c h e t I have s o u g h t from King Arthur ’ s c o u r t
; hither . ’
[72]
; ; In t h e s t o r y , S i r Tor t e l l s t h e l a d y t h a t he took t h e b r a c h e t from h e r .
( describe
( add a g e n t ∗ S i r T o r
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( build agent ∗ SirTor
act ( build action ( build lex ” take ” )
object ∗ brachet1 )
from ∗ l a d y 1 )
indobj ∗ lady1 ) kn cat ” story ” ) )
( m527 !
( a c t ( m526 ( a c t i o n ( m210 ( l e x say t h a t ) ) ) ( i n d o b j b19 )
( object
( m519 ( a c t ( m356 ( a c t i o n ( m355 ( l e x t a k e ) ) ) ( o b j e c t b14 ) ) )
( a g e n t b20 ) ( from b19 ) ) ) ) )
( a g e n t b20 ) ( k n c a t s t o r y ) )
102
( m527 ! )
CPU time : 0 . 1 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; In t h e s t o r y , S i r Tor s a y s t h a t he s o u g h t t h e b r a c h e t from t h e h a l l t o t h e p a v i l i o n .
( describe
( add a g e n t ∗ S i r T o r
a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( build agent ∗ SirTor
act ( build action ( build lex ” seek ” )
object ∗ brachet1 )
from ∗ h a l l 1
to ∗ p a v i l i o n 1 ) )
kn cat ” story ” ))
( m531 !
( a c t ( m530 ( a c t i o n ( m210 ( l e x say t h a t ) ) )
( object
( m529 ( a c t ( m528 ( a c t i o n ( m443 ( l e x s e e k ) ) ) ( o b j e c t b14 ) ) )
( a g e n t b20 ) ( from b13 ) ( t o b30 ) ) ) ) )
( a g e n t b20 ) ( k n c a t s t o r y ) )
( m531 ! )
CPU time : 0 . 1 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; ; What d o e s b r a c h e t mean?
ˆ
−−> (defineNoun ” b r a c h e t ” )
D e f in i t i o n of brachet :
C l a s s I n c l u s i o n s : dog ,
P o s s i b l e A c t i o n s : b i t e b u t t o c k , bay , hunt ,
P o s s i b l e P r o p e r t i e s : valuable , small , white ,
nil
CPU time : 2 4 . 3 9
∗
End o f / p r o j e c t s / s t n 2 /CVA/demos/ b r a c h e t . demo d e m o n s t r a t i o n .
CPU time : 1 9 3 . 3 7
∗
B.2
Cat
==============================================================
S t a r t i n g image ‘ / u t i l / a c l 6 2 / composer ’
103
with no arguments
i n directory ‘ / p r o j e c t s / s t n 2 /CVA/ ’
on machine ‘ l o c a l h o s t ’ .
I n t e r n a t i o n a l A l l e g r o CL E n t e r p r i s e E d i t i o n
6 . 2 [ S o l a r i s ] ( Aug 1 5 , 2 0 0 2 1 4 : 2 4 )
C o p y r ig h t ( C) 1 9 8 5 − 2 0 0 2 , Franz I n c . , B e r k e l e y , CA , USA .
A l l R i g h t s Reserved .
This development copy o f A l l e g r o CL i s l i c e n s e d t o :
[ 4 5 4 9 ] SUNY/ B u f f a l o , N . Campus
; ; O p t i m i z a t i o n s e t t i n g s : s a f e t y 1 , s p a c e 1 , s p e e d 1 , debug 2 .
; ; For a c o m p l e t e d e s c r i p t i o n o f a l l c o m p i l e r s w i t c h e s g i v e n t h e c u r r e n t
; ; optimization s e t t i n g s evaluate ( explain−compiler−settings ) .
;;−−−
; ; Current r e a d e r c a s e mode : : c a s e − s e n s i t i v e − l o w e r
cl−user ( 1 ) : : ld / p r o j e c t s / snwiz / bin / sneps
; Loading / p r o j e c t s / s n w i z / b i n / s n e p s . l i s p
Loading system SNePS...10% 20% 30% 40% 50% 60% 70% 80% 90% 100%
SNePS−2 . 6 [ PL : 0 a 2 0 0 2 / 0 9 / 3 0 2 2 : 3 7 : 4 6 ] l o a d e d .
Type ‘ ( s n e p s ) ’ or ‘ ( s n e p s l o g ) ’ t o get s t a r t e d .
c l − u s e r ( 2 ) : : l d defun noun . c l
; Loading / p r o j e c t s / s t n 2 /CVA/ defun noun . c l
cl−user ( 3 ) : ( sneps )
Welcome t o SNePS−2 . 6 [ PL : 0 a 2 0 0 2 / 0 9 / 3 0 2 2 : 3 7 : 4 6 ]
C o p y r i g h t ( C) 1984−−2002 by R e s e a r c h Foundation o f
S t a t e U n i v e r s i t y o f New York . SNePS comes with ABSOLUTELY NO WARRANTY!
Type ‘ ( c o p y r i g h t ) ’ f o r d e t a i l e d c o p y r i g h t i n f o r m a t i o n .
Type ‘ ( demo ) ’ f o r a l i s t o f example a p p l i c a t i o n s .
2/24/2003 15:49:35
∗ ( demo ”demos/ c a t . demo” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ c a t . demo i s now t h e s o u r c e o f i n p u t .
CPU time : 0 . 0 2
∗ ; ; ; R e s e t t h e network
( resetnet t )
Net r e s e t
CPU time : 0 . 0 3
∗
; ; ; Don ’ t t r a c e i n f e r
ˆ(
−−> s e t q s n i p : ∗ i n f e r t r a c e ∗ n i l )
nil
CPU time : 0 . 0 0
∗
; ; ; Load a l l v a l i d r e l a t i o n s
( i n t e x t ”/ p r o j e c t s / s t n 2 /CVA/demos/ r e l s ” )
104
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ r e l s i s now t h e s o u r c e o f i n p u t .
CPU time : 0 . 0 0
∗
( a1 a2 a3 a4 a f t e r a g e n t antonym a s s o c i a t e d b e f o r e c a u s e c l a s s d i r e c t i o n e q u i v
e t i m e from i n i n d o b j i n s t r i n t o l e x l o c a t i o n manner member mode o b j e c t on
onto p a r t p l a c e p o s s e s s o r proper−name p r o p e r t y r e l s k f s p − r e l s t i m e s u b c l a s s
s u p e r c l a s s synonym time t o whole k n c a t )
CPU time : 0 . 2 2
∗
End o f f i l e / p r o j e c t s / s t n 2 /CVA/demos/ r e l s
CPU time : 0 . 2 3
∗
; ; ; Compose p a t h s
( i n t e x t ”/ p r o j e c t s / s t n 2 /CVA/demos/ p a t h s ” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ p a t h s i s now t h e s o u r c e o f i n p u t .
CPU time : 0 . 0 1
∗
b e f o r e i m p l i e d by t h e path ( compose b e f o r e ( k s t a r ( compose a f t e r − ! b e f o r e ) ) )
b e f or e − i m p l i e d by t h e path ( compose ( k s t a r ( compose b e f o re − ! a f t e r ) ) b ef or e − )
CPU time : 0 . 0 0
∗
a f t e r i m p l i e d by t h e path ( compose a f t e r ( k s t a r ( compose bef o re − ! a f t e r ) ) )
a f t e r − i m p l i e d by t h e path ( compose ( k s t a r ( compose a f t e r − ! b e f o r e ) ) a f t e r − )
CPU time : 0 . 0 0
∗
c l a s s i m p l i e d by t h e path ( compose c l a s s
( k s t a r ( compose s u b c l a s s − ! s u p e r c l a s s ) ) )
c l a s s − i m p l i e d by t h e path ( compose ( k s t a r ( compose s u p e r c l a s s − ! s u b c l a s s ) )
class− )
CPU time : 0 . 0 0
∗
s u b c l a s s i m p l i e d by t h e path ( compose s u b c l a s s
( k s t a r ( compose s u p e r c l a s s − ! s u b c l a s s ) ) )
s u b c l a s s − i m p l i e d by t h e path ( compose
( k s t a r ( compose s u b c l a s s − ! s u p e r c l a s s ) )
subclass− )
CPU time : 0 . 0 0
∗
End o f f i l e / p r o j e c t s / s t n 2 /CVA/demos/ p a t h s
105
CPU time : 0 . 0 3
∗
; ; ; Load Background Knowledge
( demo ”/ p r o j e c t s / s t n 2 /CVA/demos/ c a t . b a s e ” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ c a t . b a s e i s now t h e s o u r c e o f i n p u t .
CPU time : 0 . 0 1
∗ ; ; ; Knowledge Base f o r i n i t i a l c a t demo
; ; ; Harts a r e d e e r
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” h a r t ” )
s u p e r c l a s s ( build lex ” deer ” ) ) )
(m3 ! ( s u b c l a s s ( m1 ( l e x h a r t ) ) ) ( s u p e r c l a s s ( m2 ( l e x d e e r ) ) ) )
(m3 ! )
CPU time : 0 . 0 1
∗
; ; ; Halls are buildings
( describe
( a ss ert s u b c l a s s ( b u i l d l e x ” h a l l ” )
superclass ( build lex ” building ” )))
(m6 ! ( s u b c l a s s ( m4 ( l e x h a l l ) ) ) ( s u p e r c l a s s ( m5 ( l e x b u i l d i n g ) ) ) )
(m6 ! )
CPU time : 0 . 0 1
∗
; ; ; Hounds a r e dogs
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ”hound” )
s u p e r c l a s s ( b u i l d l e x ” dog ” ) ) )
(m9 ! ( s u b c l a s s ( m7 ( l e x hound ) ) ) ( s u p e r c l a s s ( m8 ( l e x dog ) ) ) )
(m9 ! )
CPU time : 0 . 0 1
∗
; ; ; Dogs a r e mammals
( describe
( a ss ert s u b c l a s s ( b u i l d l e x ” dog ” )
s u p e r c l a s s ( b u i l d l e x ”mammal” ) ) )
( m11 ! ( s u b c l a s s ( m8 ( l e x dog ) ) ) ( s u p e r c l a s s ( m10 ( l e x mammal ) ) ) )
( m11 ! )
106
CPU time : 0 . 0 1
∗
; ; ; Dogs a r e quadrupeds
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” dog ” )
s u p e r c l a s s ( b u i l d l e x ” quadruped ” ) ) )
( m13 ! ( s u b c l a s s ( m8 ( l e x dog ) ) ) ( s u p e r c l a s s ( m12 ( l e x quadruped ) ) ) )
( m13 ! )
CPU time : 0 . 0 1
∗
; ; ; Dogs a r e c a r n i v o r e s
( describe
( as ser t s u b c l a s s ( b u i l d l e x ” dog ” )
superclass ( build lex ” carnivore ” )))
( m15 ! ( s u b c l a s s ( m8 ( l e x dog ) ) ) ( s u p e r c l a s s ( m14 ( l e x c a r n i v o r e ) ) ) )
( m15 ! )
CPU time : 0 . 0 0
∗
; ; ; Dogs a r e p r e d a t o r s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” dog ” )
superclass ( build lex ” predator ” ) ) )
( m17 ! ( s u b c l a s s ( m8 ( l e x dog ) ) ) ( s u p e r c l a s s ( m16 ( l e x p r e d a t o r ) ) ) )
( m17 ! )
CPU time : 0 . 0 1
∗
; ; ; Dogs a r e a n i m a l s
( describe
( as ser t s u b c l a s s ( b u i l d l e x ” dog ” )
s u p e r c l a s s ( b u i l d l e x ” animal ” ) ) )
( m19 ! ( s u b c l a s s ( m8 ( l e x dog ) ) ) ( s u p e r c l a s s ( m18 ( l e x animal ) ) ) )
( m19 ! )
CPU time : 0 . 0 1
∗
; ; ; Rex i s a dog
; ; ; ( E h r l i c h n e v e r had an o b j e c t − proper−name c a s e frame f o r Rex )
( describe
( as se r t member #Rex
c l a s s ( b u i l d l e x ” dog ” ) ) )
107
( m20 ! ( c l a s s ( m8 ( l e x dog ) ) ) ( member b1 ) )
( m20 ! )
CPU time : 0 . 0 0
∗
( describe
( a sse r t o b j e c t ∗ Rex
proper−name ( b u i l d l e x ”Rex” ) ) )
( m22 ! ( o b j e c t b1 ) ( proper−name ( m21 ( l e x Rex ) ) ) )
( m22 ! )
CPU time : 0 . 0 1
∗
; ; ; Rex b e l o n g s t o a p e r s o n
( describe
( a sse r t o b j e c t ∗ Rex
p o s s e s s o r #person1
r e l ( b u i l d l e x ” dog ” ) ) )
( m23 ! ( o b j e c t b1 ) ( p o s s e s s o r b2 ) ( r e l ( m8 ( l e x dog ) ) ) )
( m23 ! )
CPU time : 0 . 0 1
∗
( describe
( as se r t member ∗ p e r s o n 1
c l a s s ( build lex ” person ” ) ) )
(m25 ! ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member b2 ) )
( m25 ! )
CPU time : 0 . 0 1
∗
; ; ; Deer a r e mammals
( describe
( as ser t s u b c l a s s ( b u i l d l e x ” d e e r ” )
s u p e r c l a s s ( b u i l d l e x ”mammal” ) ) )
(m26 ! ( s u b c l a s s ( m2 ( l e x d e e r ) ) ) ( s u p e r c l a s s ( m10 ( l e x mammal ) ) ) )
(m26 ! )
CPU time : 0 . 0 0
∗
; ; ; Deer a r e quadrupeds
( describe
( a ss ert s u b c l a s s ( b u i l d l e x ” d e e r ” )
108
s u p e r c l a s s ( b u i l d l e x ” quadruped ” ) ) )
(m27 ! ( s u b c l a s s ( m2 ( l e x d e e r ) ) ) ( s u p e r c l a s s ( m12 ( l e x quadruped ) ) ) )
(m27 ! )
CPU time : 0 . 0 0
∗
; ; ; Deer a r e h e r b i v o r e s
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” d e e r ” )
superclass ( build lex ” herbivore ”)
))
(m29 ! ( s u b c l a s s ( m2 ( l e x d e e r ) ) ) ( s u p e r c l a s s ( m28 ( l e x h e r b i v o r e ) ) ) )
(m29 ! )
CPU time : 0 . 0 1
∗
; ; ; Carnivores are animals
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” c a r n i v o r e ” )
s u p e r c l a s s ( b u i l d l e x ” animal ” )
))
( m30 ! ( s u b c l a s s ( m14 ( l e x c a r n i v o r e ) ) ) ( s u p e r c l a s s ( m18 ( l e x animal ) ) ) )
( m30 ! )
CPU time : 0 . 0 0
∗
; ; ; Predators are carnivores
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” p r e d a t o r ” )
superclass ( build lex ” carnivore ”)
))
( m31 ! ( s u b c l a s s ( m16 ( l e x p r e d a t o r ) ) ) ( s u p e r c l a s s ( m14 ( l e x c a r n i v o r e ) ) ) )
( m31 ! )
CPU time : 0 . 0 0
∗
; ; ; ” H e r b i v o r e ” and ” c a r n i v o r e ” a r e antonyms
( describe
( a ss er t antonym ( b u i l d l e x ” h e r b i v o r e ” )
antonym ( b u i l d l e x ” c a r n i v o r e ” ) ) )
(m32 ! ( antonym ( m28 ( l e x h e r b i v o r e ) ) ( m14 ( l e x c a r n i v o r e ) ) ) )
(m32 ! )
CPU time : 0 . 0 1
109
∗
; ; ; ” P r e d a t o r ” and ” c a r n i v o r e ” a r e antonyms
( describe
( as se r t antonym ( b u i l d l e x ” p r e d a t o r ” )
antonym ( b u i l d l e x ” c a r n i v o r e ” ) ) )
( m33 ! ( antonym ( m16 ( l e x p r e d a t o r ) ) ( m14 ( l e x c a r n i v o r e ) ) ) )
( m33 ! )
CPU time : 0 . 0 1
∗
; ; ; Mammals a r e a n i m a l s
( describe
( ass er t s u b c l a s s ( b u i l d l e x ”mammal” )
s u p e r c l a s s ( b u i l d l e x ” animal ” )
))
(m34 ! ( s u b c l a s s ( m10 ( l e x mammal ) ) ) ( s u p e r c l a s s ( m18 ( l e x animal ) ) ) )
(m34 ! )
CPU time : 0 . 0 0
∗
; ; ; Mammals a r e v e r t e b r a t e s
( describe
( a ss ert s u b c l a s s ( b u i l d l e x ”mammal” )
superclass ( build lex ” vertebrate ”)
))
( m36 ! ( s u b c l a s s ( m10 ( l e x mammal ) ) ) ( s u p e r c l a s s ( m35 ( l e x v e r t e b r a t e ) ) ) )
( m36 ! )
CPU time : 0 . 0 1
∗
; ; ; Quadrupeds a r e v e r t e b r a t e s
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” quadruped ” )
superclass ( build lex ” vertebrate ”)
))
(m37 ! ( s u b c l a s s ( m12 ( l e x quadruped ) ) ) ( s u p e r c l a s s ( m35 ( l e x v e r t e b r a t e ) ) ) )
(m37 ! )
CPU time : 0 . 0 0
∗
; ; ; Animals a r e p h y s i c a l o b j e c t s
( describe
( a ss ert s u b c l a s s ( b u i l d l e x ” animal ” )
s u p e r c l a s s ( b u i l d l e x ” phys o b j ” )
))
110
( m39 ! ( s u b c l a s s ( m18 ( l e x animal ) ) ) ( s u p e r c l a s s ( m38 ( l e x phys o b j ) ) ) )
( m39 ! )
CPU time : 0 . 0 1
∗
; ; ; The Round Table i s a t a b l e
( describe
( a sse r t member ( b u i l d l e x ”Round Table ” )
class ( build lex ” table ”)
))
( m42 ! ( c l a s s ( m41 ( l e x t a b l e ) ) ) ( member ( m40 ( l e x Round Table ) ) ) )
( m42 ! )
CPU time : 0 . 0 1
∗
; ; ; King Arthur i s a k i n g
( describe
( as ser t o b j e c t #KingArt
proper−name ( b u i l d l e x ” King Arthur ” )
))
(m44 ! ( o b j e c t b3 ) ( proper−name ( m43 ( l e x King Arthur ) ) ) )
( m44 ! )
CPU time : 0 . 0 1
∗
( describe
( as ser t member ∗ KingArt
c l a s s ( build lex ” king ” )
))
( m46 ! ( c l a s s ( m45 ( l e x k i n g ) ) ) ( member b3 ) )
( m46 ! )
CPU time : 0 . 0 0
∗
; ; ; The Round Table i s King Arthur ’ s t a b l e
( describe
( as ser t o b j e c t ( b u i l d l e x ”Round Table ” )
p o s s e s s o r ∗ KingArt
r e l ( build lex ” table ”)
))
(m47 ! ( o b j e c t ( m40 ( l e x Round Table ) ) ) ( p o s s e s s o r b3 ) ( r e l ( m41 ( l e x t a b l e ) ) ) )
(m47 ! )
111
CPU time : 0 . 0 1
∗
; ; ; E x c a l i b u r i s a sword
( describe
( as se r t o b j e c t # Excal
proper−name ( b u i l d l e x ” E x c a l i b u r ” )
))
( m49 ! ( o b j e c t b4 ) ( proper−name ( m48 ( l e x E x c a l i b u r ) ) ) )
( m49 ! )
CPU time : 0 . 0 1
∗
( describe
( as se r t member ∗ Excal
c l a s s ( b u i l d l e x ” sword ” )
))
( m51 ! ( c l a s s ( m50 ( l e x sword ) ) ) ( member b4 ) )
( m51 ! )
CPU time : 0 . 0 0
∗
; ; ; E x c a l i b u r i s King Arthur ’ s sword
( describe
( as se r t o b j e c t ∗ Excal
p o s s e s s o r ∗ KingArth
r e l ( b u i l d l e x ” sword ” )
))
( m52 ! ( o b j e c t b4 ) ( r e l ( m50 ( l e x sword ) ) ) )
( m52 ! )
CPU time : 0 . 0 0
∗
; ; ; Merlin i s a wizard
( describe
( as ser t o b j e c t # M e r l i n
proper−name ( b u i l d l e x ” M e r l i n ” )
))
(m54 ! ( o b j e c t b5 ) ( proper−name ( m53 ( l e x M e r l i n ) ) ) )
( m54 ! )
CPU time : 0 . 0 1
∗
( describe
( as se r t member ∗ M e r l i n
112
c l a s s ( build l e x ” wizard ” )
))
(m56 ! ( c l a s s ( m55 ( l e x w i z a r d ) ) ) ( member b5 ) )
(m56 ! )
CPU time : 0 . 0 1
∗
; ; ; Wizards a r e p e r s o n s
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” w i z a r d ” )
s u p e r c l a s s ( build lex ” person ” )
))
(m57 ! ( s u b c l a s s ( m55 ( l e x w i z a r d ) ) ) ( s u p e r c l a s s ( m24 ( l e x p e r s o n ) ) ) )
(m57 ! )
CPU time : 0 . 0 1
∗
; ; ; King Ban i s a k i n g
( describe
( as se r t o b j e c t #KingBan
proper−name ( b u i l d l e x ” King Ban” )
))
( m59 ! ( o b j e c t b6 ) ( proper−name ( m58 ( l e x King Ban ) ) ) )
( m59 ! )
CPU time : 0 . 0 2
∗
( describe
( a sse r t member ∗ KingBan
c l a s s ( build lex ” king ” )
))
(m60 ! ( c l a s s ( m45 ( l e x k i n g ) ) ) ( member b6 ) )
(m60 ! )
CPU time : 0 . 0 1
∗
; ; ; King Bors i s a k i n g
( describe
( as s ert o b j e c t #KingBors
proper−name ( b u i l d l e x ” King Bors ” )
))
(m62 ! ( o b j e c t b7 ) ( proper−name ( m61 ( l e x King Bors ) ) ) )
(m62 ! )
113
CPU time : 0 . 0 1
∗
( describe
( as se r t member ∗ KingBors
c l a s s ( build lex ” king ” )
))
(m63 ! ( c l a s s ( m45 ( l e x k i n g ) ) ) ( member b7 ) )
( m63 ! )
CPU time : 0 . 0 0
∗
; ; ; King Lot i s a k i n g
( describe
( as se r t o b j e c t #KingLot
proper−name ( b u i l d l e x ” King Lot ” )
))
( m65 ! ( o b j e c t b8 ) ( proper−name ( m64 ( l e x King Lot ) ) ) )
( m65 ! )
CPU time : 0 . 0 1
∗
( describe
( as se r t member ∗ KingLot
c l a s s ( build lex ” king ” )
))
( m66 ! ( c l a s s ( m45 ( l e x k i n g ) ) ) ( member b8 ) )
( m66 ! )
CPU time : 0 . 0 1
∗
; ; ; S i r Galahad i s a k n i g h t
( describe
( as se r t o b j e c t # S i r G a l
proper−name ( b u i l d l e x ” S i r Galahad ” )
))
( m68 ! ( o b j e c t b9 ) ( proper−name ( m67 ( l e x S i r Galahad ) ) ) )
( m68 ! )
CPU time : 0 . 0 1
∗
( describe
( as se r t member ∗ S i r G a l
114
c l a s s ( build lex ” knight ” )
))
(m70 ! ( c l a s s ( m69 ( l e x k n i g h t ) ) ) ( member b9 ) )
(m70 ! )
CPU time : 0 . 0 0
∗
; ; ; S i r Gawain i s a k n i g h t
( describe
( as s ert o b j e c t #SirGaw
proper−name ( b u i l d l e x ” S i r Gawain” )
))
(m72 ! ( o b j e c t b10 ) ( proper−name ( m71 ( l e x S i r Gawain ) ) ) )
(m72 ! )
CPU time : 0 . 0 1
∗
( describe
( as s ert member ∗ SirGaw
c l a s s ( build lex ” knight ” )
))
( m73 ! ( c l a s s ( m69 ( l e x k n i g h t ) ) ) ( member b10 ) )
(m73 ! )
CPU time : 0 . 0 1
∗
; ; ; S i r Tristram i s a knight
( describe
( as s ert o b j e c t # S i r T r i s
proper−name ( b u i l d l e x ” S i r T r i s t r a m ” )
))
(m75 ! ( o b j e c t b11 ) ( proper−name ( m74 ( l e x S i r T r i s t r a m ) ) ) )
(m75 ! )
CPU time : 0 . 0 1
∗
( describe
( as s ert member ∗ S i r T r i s
c l a s s ( build lex ” knight ” )
))
( m76 ! ( c l a s s ( m69 ( l e x k n i g h t ) ) ) ( member b11 ) )
115
( m76 ! )
CPU time : 0 . 0 0
∗
; ; ; Sideboards are f u r n i t u r e
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” s i d e b o a r d ” )
superclass ( build lex ” furniture ”)
))
(m79 ! ( s u b c l a s s ( m77 ( l e x s i d e b o a r d ) ) ) ( s u p e r c l a s s ( m78 ( l e x f u r n i t u r e ) ) ) )
(m79 ! )
CPU time : 0 . 0 2
∗
; ; ; Tables are f u r n i t u r e
( describe
( a ss ert s u b c l a s s ( b u i l d l e x ” t a b l e ” )
superclass ( build lex ” furniture ”)
))
( m80 ! ( s u b c l a s s ( m41 ( l e x t a b l e ) ) ) ( s u p e r c l a s s ( m78 ( l e x f u r n i t u r e ) ) ) )
( m80 ! )
CPU time : 0 . 0 1
∗
; ; ; Chairs are f u r n i t u r e
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” c h a i r ” )
superclass ( build lex ” furniture ”)
))
(m82 ! ( s u b c l a s s ( m81 ( l e x c h a i r ) ) ) ( s u p e r c l a s s ( m78 ( l e x f u r n i t u r e ) ) ) )
(m82 ! )
CPU time : 0 . 0 1
∗
; ; ; H o r s e s a r e quadrupeds
( describe
( a ss ert s u b c l a s s ( b u i l d l e x ” h o r s e ” )
s u p e r c l a s s ( b u i l d l e x ” quadruped ” )
))
( m84 ! ( s u b c l a s s ( m83 ( l e x h o r s e ) ) ) ( s u p e r c l a s s ( m12 ( l e x quadruped ) ) ) )
( m84 ! )
CPU time : 0 . 0 1
∗
; ; ; Horses are h e r b i v o r e s
116
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” h o r s e ” )
superclass ( build lex ” herbivore ”)
))
( m85 ! ( s u b c l a s s ( m83 ( l e x h o r s e ) ) ) ( s u p e r c l a s s ( m28 ( l e x h e r b i v o r e ) ) ) )
( m85 ! )
CPU time : 0 . 0 1
∗
; ; ; Ungulates are h e r b i v o r e s
( describe
( a ss ert s u b c l a s s ( b u i l d l e x ” u n g u l a t e ” )
superclass ( build lex ” herbivore ”)
))
( m87 ! ( s u b c l a s s ( m86 ( l e x u n g u l a t e ) ) ) ( s u p e r c l a s s ( m28 ( l e x h e r b i v o r e ) ) ) )
( m87 ! )
CPU time : 0 . 0 3
∗
; ; ; Horses are animals
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” h o r s e ” )
s u p e r c l a s s ( b u i l d l e x ” animal ” )
))
(m88 ! ( s u b c l a s s ( m83 ( l e x h o r s e ) ) ) ( s u p e r c l a s s ( m18 ( l e x animal ) ) ) )
(m88 ! )
CPU time : 0 . 0 1
∗
; ; ; Knights a r e p e r s o n s
( describe
( a ss ert s u b c l a s s ( b u i l d l e x ” k n i g h t ” )
s u p e r c l a s s ( build lex ” person ” )
))
( m89 ! ( s u b c l a s s ( m69 ( l e x k n i g h t ) ) ) ( s u p e r c l a s s ( m24 ( l e x p e r s o n ) ) ) )
( m89 ! )
CPU time : 0 . 0 1
∗
; ; ; ” Person ” i s a b a s i c − l e v e l c a t e g o r y
( describe
( as ser t member ( b u i l d l e x ” p e r s o n ” )
c l a s s ( build lex ” bas ic ctgy ” )
))
117
( m91 ! ( c l a s s ( m90 ( l e x b a s i c c t g y ) ) ) ( member ( m24 ( l e x p e r s o n ) ) ) )
( m91 ! )
CPU time : 0 . 0 1
∗
; ; ; ”Dog ” i s a b a s i c − l e v e l c a t e g o r y
( describe
( a ss ert member ( b u i l d l e x ” dog ” )
c l a s s ( build lex ” bas ic ctgy ” )
))
( m92 ! ( c l a s s ( m90 ( l e x b a s i c c t g y ) ) ) ( member ( m8 ( l e x dog ) ) ) )
( m92 ! )
CPU time : 0 . 0 0
∗
; ; ; ” Horse ” i s a b a s i c − l e v e l c a t e g o r y
( describe
( as ser t member ( b u i l d l e x ” h o r s e ” )
c l a s s ( build lex ” bas ic ctgy ” )
))
( m93 ! ( c l a s s ( m90 ( l e x b a s i c c t g y ) ) ) ( member ( m83 ( l e x h o r s e ) ) ) )
( m93 ! )
CPU time : 0 . 0 2
∗
; ; ; ” Deer ” i s a b a s i c − l e v e l c a t e g o r y
( describe
( as se r t member ( b u i l d l e x ” d e e r ” )
c l a s s ( build lex ” bas ic ctgy ” )
))
( m94 ! ( c l a s s ( m90 ( l e x b a s i c c t g y ) ) ) ( member ( m2 ( l e x d e e r ) ) ) )
( m94 ! )
CPU time : 0 . 0 1
∗
; ; ; ” Chair ” i s a b a s i c − l e v e l c a t e g o r y
( describe
( as ser t member ( b u i l d l e x ” c h a i r ” )
c l a s s ( build lex ” bas ic ctgy ” )
))
( m95 ! ( c l a s s ( m90 ( l e x b a s i c c t g y ) ) ) ( member ( m81 ( l e x c h a i r ) ) ) )
118
( m95 ! )
CPU time : 0 . 0 2
∗
; ; ; ” Table ” i s a b a s i c − l e v e l c a t e g o r y
( describe
( as ser t member ( b u i l d l e x ” t a b l e ” )
c l a s s ( build lex ” bas ic ctgy ” )
))
( m96 ! ( c l a s s ( m90 ( l e x b a s i c c t g y ) ) ) ( member ( m41 ( l e x t a b l e ) ) ) )
( m96 ! )
CPU time : 0 . 0 0
∗
; ; ; White i s a c o l o r
( describe
( as ser t member ( b u i l d l e x ” w h i t e ” )
class ( build lex ” color ”)
))
( m99 ! ( c l a s s ( m98 ( l e x c o l o r ) ) ) ( member ( m97 ( l e x w h i t e ) ) ) )
( m99 ! )
CPU time : 0 . 0 2
∗
; ; ; Black i s a c o l o r
( describe
( as ser t member ( b u i l d l e x ” b l a c k ” )
class ( build lex ” color ”)
))
( m101 ! ( c l a s s ( m98 ( l e x c o l o r ) ) ) ( member ( m100 ( l e x b l a c k ) ) ) )
( m101 ! )
CPU time : 0 . 0 1
∗
; ; ; Small i s a s i z e
( describe
( as ser t member ( b u i l d l e x ” s m a l l ” )
class ( build lex ” s ize ”)
))
( m104 ! ( c l a s s ( m103 ( l e x s i z e ) ) ) ( member ( m102 ( l e x s m a l l ) ) ) )
( m104 ! )
CPU time : 0 . 0 1
∗
119
; ; ; ” Small ” and ” l i t t l e ” a r e synonyms
( describe
( ass er t synonym ( b u i l d l e x ” s m a l l ” )
synonym ( b u i l d l e x ” l i t t l e ” )
))
( m106 ! ( synonym ( m105 ( l e x l i t t l e ) ) ( m102 ( l e x s m a l l ) ) ) )
( m106 ! )
CPU time : 0 . 0 1
∗
; ; ; Large i s a s i z e
( describe
( a ss ert member ( b u i l d l e x ” l a r g e ” )
class ( build lex ” s ize ”)
))
( m108 ! ( c l a s s ( m103 ( l e x s i z e ) ) ) ( member ( m107 ( l e x l a r g e ) ) ) )
( m108 ! )
CPU time : 0 . 0 2
∗
; ; ; ” Large ” and ” b i g ” a r e synonyms
( describe
( as se r t synonym ( b u i l d l e x ” l a r g e ” )
synonym ( b u i l d l e x ” b i g ” )
))
( m110 ! ( synonym ( m109 ( l e x b i g ) ) ( m107 ( l e x l a r g e ) ) ) )
( m110 ! )
CPU time : 0 . 0 2
∗
; ; ; Good i s a v a l u e
( describe
( as se r t member ( b u i l d l e x ” good ” )
c l a s s ( build lex ” value ” )
))
( m113 ! ( c l a s s ( m112 ( l e x v a l u e ) ) ) ( member ( m111 ( l e x good ) ) ) )
( m113 ! )
CPU time : 0 . 0 1
∗
; ; ; Bad i s a v a l u e
( describe
( as se r t member ( b u i l d l e x ” bad” )
c l a s s ( build lex ” value ” )
))
120
( m115 ! ( c l a s s ( m112 ( l e x v a l u e ) ) ) ( member ( m114 ( l e x bad ) ) ) )
( m115 ! )
CPU time : 0 . 0 1
∗
; ; ; I f x i s a h o r s e , then presumably t h e r e i s a p e r s o n , y , such t h a t t h e
;;;
f u n c t i o n o f x i s t o be r i d d e n by y
( describe
( a sse r t f o r a l l $v2
ant ( b u i l d member ∗ v2
c l a s s ( build lex ” horse ” ))
cq ( ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d o b j e c t 1 ∗ v2
c l a s s ( b u i l d a g e n t ( b u i l d a2 ∗ v2
skf ” rider−of ”)
act ( build action ( build lex ” ride ” )
o b j e c t ∗ v2 ) )
r e l ( build lex ” function ” )))
( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d member ( b u i l d a2 ∗ v2
skf ” rider−of ”)
c l a s s ( build lex ” person ” ) ) ) ) ) )
( m119 ! ( f o r a l l v1 ) ( ant ( p1 ( c l a s s ( m83 ( l e x h o r s e ) ) ) ( member v1 ) ) )
( cq
( p8 ( mode ( m116 ( l e x presumably ) ) )
( object
( p7 ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member ( p2 ( a2 v1 ) ( s k f r i d e r − o f ) ) ) ) ) )
( p6 ( mode ( m116 ) )
( object
( p5
( class
( p4 ( a c t ( p3 ( a c t i o n ( m117 ( l e x r i d e ) ) ) ( o b j e c t v1 ) ) ) ( a g e n t ( p2 ) ) ) )
( o b j e c t 1 v1 ) ( r e l ( m118 ( l e x f u n c t i o n ) ) ) ) ) ) ) )
( m119 ! )
CPU time : 0 . 0 4
∗
;;;
;;;
I f a r i d e r r i d e s an animal t h a t b e l o n g s t o some c l a s s , then t h a t c l a s s i s
a subclass of equine
( describe
( a sse r t f o r a l l ( ∗ v2 $v3 )
&ant ( ( b u i l d member ∗ v2
c l a s s ( b u i l d l e x ” animal ” ) )
( b u i l d member ∗ v2
c l a s s ∗ v3
)
( b u i l d member ( b u i l d a2 ∗ v2
skf ” rider−of ”)
c l a s s ( build lex ” person ” ))
( b u i l d a g e n t ( b u i l d a2 ∗ v2
skf ” rider−of ”)
act ( build action ( build lex ” ride ” )
121
o b j e c t ∗ v2 ) ) )
cq ( b u i l d s u b c l a s s ∗ v3
s u p e r c l a s s ( build lex ” equine ” ) ) ) )
( m121 ! ( f o r a l l v2 v1 )
(& ant ( p10 ( c l a s s v2 ) ( member v1 ) )
( p9 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v1 ) )
( p7 ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member ( p2 ( a2 v1 ) ( s k f r i d e r − o f ) ) ) )
( p4 ( a c t ( p3 ( a c t i o n ( m117 ( l e x r i d e ) ) ) ( o b j e c t v1 ) ) ) ( a g e n t ( p2 ) ) ) )
( cq ( p11 ( s u b c l a s s v2 ) ( s u p e r c l a s s ( m120 ( l e x e q u i n e ) ) ) ) ) )
( m121 ! )
CPU time : 0 . 0 3
∗
; ; A l l a n i m a l s who bay a r e hounds
( describe
( a sse r t f o r a l l ( $hound1 $ c a t e g )
&ant ( ( b u i l d a g e n t ∗ hound1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” bay ” ) ) )
( b u i l d member ∗ hound1 c l a s s ∗ c a t e g )
( b u i l d s u b c l a s s ∗ c a t e g s u p e r c l a s s ( b u i l d l e x ” animal ” ) ) )
cq ( b u i l d s u b c l a s s ∗ c a t e g s u p e r c l a s s ( b u i l d l e x ”hound” ) ) ) )
( m124 ! ( f o r a l l v4 v3 )
(& ant ( p14 ( s u b c l a s s v4 ) ( s u p e r c l a s s ( m18 ( l e x animal ) ) ) )
( p13 ( c l a s s v4 ) ( member v3 ) )
( p12 ( a c t ( m123 ( a c t i o n ( m122 ( l e x bay ) ) ) ) ) ( a g e n t v3 ) ) )
( cq ( p15 ( s u b c l a s s v4 ) ( s u p e r c l a s s ( m7 ( l e x hound ) ) ) ) ) )
( m124 ! )
CPU time : 0 . 0 3
∗
;;;
I f something b i t e s , then i t ’ s an animal
( describe
; i f i t b i t e s , i t ’ s an animal
( a sse r t f o r a l l ( $animal1 $ b i t t e n ∗ c a t e g )
&ant ( ( b u i l d a g e n t ∗ animal1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” b i t e ” )
object ∗ bitten ))
( b u i l d member ∗ animal1 c l a s s ∗ c a t e g ) )
cq ( b u i l d s u b c l a s s ∗ c a t e g s u p e r c l a s s ( b u i l d l e x ” animal ” ) )
kn cat ” l i f e − r u l e .1” ))
( m126 ! ( f o r a l l v6 v5 v4 )
(& ant ( p18 ( c l a s s v4 ) ( member v5 ) )
( p17 ( a c t ( p16 ( a c t i o n ( m125 ( l e x b i t e ) ) ) ( o b j e c t v6 ) ) ) ( a g e n t v5 ) ) )
( cq ( p14 ( s u b c l a s s v4 ) ( s u p e r c l a s s ( m18 ( l e x animal ) ) ) ) ) ( k n c a t l i f e − r u l e . 1 ) )
( m126 ! )
CPU time : 0 . 0 3
∗
;;;
I f something s l e e p s , then i t ’ s an animal
122
( describe
( a sse r t f o r a l l $v5
ant ( b u i l d a c t ( b u i l d a c t i o n ( b u i l d l e x ” s l e e p ” ) )
a g e n t ∗ v5 )
cq ( b u i l d member ∗ v5
c l a s s ( b u i l d l e x ” animal ” ) )
))
( m129 ! ( f o r a l l v7 )
( ant ( p19 ( a c t ( m128 ( a c t i o n ( m127 ( l e x sleep ) ) ) ) ) ( a g e n t v7 ) ) )
( cq ( p20 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v7 ) ) ) )
( m129 ! )
CPU time : 0 . 0 3
∗
;;;
I f something ambles , then i t ’ s an animal
( describe
( as ser t f o r a l l ∗ v5
ant ( b u i l d a c t ( b u i l d a c t i o n ( b u i l d l e x ” ambling ” ) )
a g e n t ∗ v5 )
cq ( b u i l d member ∗ v5
c l a s s ( b u i l d l e x ” animal ” ) )
))
( m132 ! ( f o r a l l v7 )
( ant ( p21 ( a c t ( m131 ( a c t i o n ( m130 ( l e x ambling ) ) ) ) ) ( a g e n t v7 ) ) )
( cq ( p20 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v7 ) ) ) )
( m132 ! )
CPU time : 0 . 0 2
∗
;;;
;;;
I f something i s an animal and a member o f a n o t h e r c l a s s , then t h a t c l a s s
i s a s u b c l a s s o f animal
( describe
( as ser t f o r a l l ( ∗ v5 $v6 )
&ant ( ( b u i l d member ∗ v5
c l a s s ( b u i l d l e x ” animal ” ) )
( b u i l d member ∗ v5
c l a s s ∗ v6 ) )
cq ( b u i l d s u b c l a s s ∗ v6
s u p e r c l a s s ( b u i l d l e x ” animal ” ) ) ) )
( m133 ! ( f o r a l l v8 v7 )
(& ant ( p22 ( c l a s s v8 ) ( member v7 ) )
( p20 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v7 ) ) )
( cq ( p23 ( s u b c l a s s v8 ) ( s u p e r c l a s s ( m18 ) ) ) ) )
( m133 ! )
CPU time : 0 . 0 1
123
∗
;;;
;;;
I f something i s presumed t o be an animal and a member o f a n o t h e r c l a s s ,
then presumably t h a t c l a s s i s a s u b c l a s s o f animal
( describe
( as se r t f o r a l l ( ∗ v5 ∗ v6 )
&ant ( ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d member ∗ v5
c l a s s ( b u i l d l e x ” animal ” ) ) )
( b u i l d member ∗ v5
c l a s s ∗ v6 ) )
cq ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d s u b c l a s s ∗ v6
s u p e r c l a s s ( b u i l d l e x ” animal ” ) ) )
))
( m134 ! ( f o r a l l v8 v7 )
(& ant
( p24 ( mode ( m116 ( l e x presumably ) ) )
( o b j e c t ( p20 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v7 ) ) ) )
( p22 ( c l a s s v8 ) ( member v7 ) ) )
( cq ( p25 ( mode ( m116 ) ) ( o b j e c t ( p23 ( s u b c l a s s v8 ) ( s u p e r c l a s s ( m18 ) ) ) ) ) ) )
( m134 ! )
CPU time : 0 . 0 2
∗
;;;
;;;
I f something i s a mammal and a member o f a n o t h e r ( n o n − s u p e r o r d i n a t e ) c l a s s ,
then t h a t c l a s s i s a s u b c l a s s o f mammal
; ; ; ( describe
; ; ; ( a s s e r t f o r a l l ( ∗ v5 ∗ v6 )
;;;
&ant ( ( b u i l d member ∗ v5
;;;
c l a s s ∗ v6 )
;;;
( b u i l d member ∗ v5
;;;
c l a s s ( b u i l d l e x ”mammal” )
;;;
))
;;;
cq ( ( b u i l d s u b c l a s s ∗ v6
;;;
s u p e r c l a s s ( b u i l d l e x ” animal ” ) )
;;;
( b u i l d s u b c l a s s ∗ v6
;;;
s u p e r c l a s s ( b u i l d l e x ”mammal ” ) ) )
;;;
))
; ; ; I f someone b e l o n g s t o a s u b c l a s s o f p e r s o n then t h a t someone i s a p e r s o n
( describe
( as s ert f o r a l l ( $v8 $v9 )
&ant ( ( b u i l d s u b c l a s s ∗ v8
s u p e r c l a s s ( build lex ” person ” ))
( b u i l d member ∗ v9
c l a s s ∗ v8 ) )
cq ( b u i l d member ∗ v9
c l a s s ( build lex ” person ” ))
))
( m135 ! ( f o r a l l v10 v9 )
(& ant ( p27 ( c l a s s v9 ) ( member v10 ) )
( p26 ( s u b c l a s s v9 ) ( s u p e r c l a s s ( m24 ( l e x p e r s o n ) ) ) ) )
124
( cq ( p28 ( c l a s s ( m24 ) ) ( member v10 ) ) ) )
( m135 ! )
CPU time : 0 . 0 1
∗
;;;
I f a p e r s o n can c a r r y an o b j e c t , then t h a t o b j e c t i s s m a l l
( describe
( a ss er t f o r a l l ( $v13 ∗ v9 )
&ant ( ( b u i l d member ∗ v9
c l a s s ( build lex ” person ” ))
( b u i l d a c t ( b u i l d a c t i o n ( b u i l d l e x ” c a r r y ” ) o b j e c t ∗ v13 )
a g e n t ∗ v9 ) )
cq ( b u i l d o b j e c t ∗ v13
property ( build lex ” small ” ))
))
( m137 ! ( f o r a l l v11 v10 )
(& ant ( p30 ( a c t ( p29 ( a c t i o n ( m136 ( l e x c a r r y ) ) ) ( o b j e c t v11 ) ) ) ( a g e n t v10 ) )
( p28 ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member v10 ) ) )
( cq ( p31 ( o b j e c t v11 ) ( p r o p e r t y ( m102 ( l e x s m a l l ) ) ) ) ) )
( m137 ! )
CPU time : 0 . 0 3
∗
; ; ; I f a p e r s o n wants something , then i t i s v a l u a b l e
; ; ; ( E h r l i c h doesn ’ t mention t h a t ∗ v9 must be a p e r s o n , s o I modify i t )
( describe
( as se rt f o r a l l ( ∗ v13 ∗ v9 )
&ant ( ( b u i l d a g e n t ∗ v9
a c t ( b u i l d a c t i o n ( b u i l d l e x ”want” ) o b j e c t ∗ v13 ) )
( b u i l d member ∗ v9
c l a s s ( build lex ” person ” ) ) )
cq ( b u i l d o b j e c t ∗ v13
property ( build lex ” valuable ” ))
))
( m140 ! ( f o r a l l v11 v10 )
(& ant ( p33 ( a c t ( p32 ( a c t i o n ( m138 ( l e x want ) ) ) ( o b j e c t v11 ) ) ) ( a g e n t v10 ) )
( p28 ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member v10 ) ) )
( cq ( p34 ( o b j e c t v11 ) ( p r o p e r t y ( m139 ( l e x v a l u a b l e ) ) ) ) ) )
( m140 ! )
CPU time : 0 . 0 4
∗
;;;
I f someone s a y s they want something , then they do
( describe
( a ss er t f o r a l l ( ∗ v13 ∗ v9 )
ant ( b u i l d a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
125
o b j e c t ( b u i l d a c t ( b u i l d a c t i o n ( b u i l d l e x ”want” ) o b j e c t ∗ v13 )
a g e n t ∗ v9 ) )
a g e n t ∗ v9 )
cq ( b u i l d a c t ( b u i l d a c t i o n ( b u i l d l e x ” want” ) o b j e c t ∗ v13 )
a g e n t ∗ v9 )
))
( m142 ! ( f o r a l l v11 v10 )
( ant
( p36
( a c t ( p35 ( a c t i o n ( m141 ( l e x say t h a t ) ) )
( object
( p33 ( a c t ( p32 ( a c t i o n ( m138 ( l e x want ) ) ) ( o b j e c t v11 ) ) )
( a g e n t v10 ) ) ) ) )
( a g e n t v10 ) ) )
( cq ( p33 ) ) )
( m142 ! )
CPU time : 0 . 0 2
∗
;;;
;;;
I f something has c o l o r and b e l o n g s t o some c l a s s , then t h a t c l a s s i s a
subclass of physical object
( describe
( a sse r t f o r a l l ( $v14 $v15 $v16 )
&ant ( ( b u i l d member ∗ v15
class ( build lex ” color ” ))
( b u i l d o b j e c t ∗ v16
p r o p e r t y ∗ v15 )
( b u i l d member ∗ v16
c l a s s ∗ v14 ) )
cq ( b u i l d s u b c l a s s ∗ v14
s u p e r c l a s s ( b u i l d l e x ” phys o b j ” ) )
))
( m143 ! ( f o r a l l v14 v13 v12 )
(& ant ( p39 ( c l a s s v12 ) ( member v14 ) ) ( p38 ( o b j e c t v14 ) ( p r o p e r t y v13 ) )
( p37 ( c l a s s ( m98 ( l e x c o l o r ) ) ) ( member v13 ) ) )
( cq ( p40 ( s u b c l a s s v12 ) ( s u p e r c l a s s ( m38 ( l e x phys o b j ) ) ) ) ) )
( m143 ! )
CPU time : 0 . 0 2
∗
;;;
;;;
I f something has s i z e and b e l o n g s t o some c l a s s , then t h a t c l a s s i s a
subclass of physical object
( describe
( a sse r t f o r a l l ( ∗ v14 ∗ v15 $v17 )
&ant ( ( b u i l d member ∗ v15
class ( build lex ” s ize ” ))
( b u i l d member ∗ v17
c l a s s ∗ v14 )
( b u i l d o b j e c t ∗ v17
p r o p e r t y ∗ v15 ) )
126
cq ( b u i l d s u b c l a s s ∗ v14
s u p e r c l a s s ( b u i l d l e x ” phys o b j ” ) )
))
( m144 ! ( f o r a l l v15 v13 v12 )
(& ant ( p43 ( o b j e c t v15 ) ( p r o p e r t y v13 ) ) ( p42 ( c l a s s v12 ) ( member v15 ) )
( p41 ( c l a s s ( m103 ( l e x s i z e ) ) ) ( member v13 ) ) )
( cq ( p40 ( s u b c l a s s v12 ) ( s u p e r c l a s s ( m38 ( l e x phys o b j ) ) ) ) ) )
( m144 ! )
CPU time : 0 . 0 2
∗
;;;
;;;
I f a member o f some c l a s s has a p r o p e r t y , then i t i s p o s s i b l e f o r o t h e r
members o f t h a t c l a s s t o have t h a t p r o p e r t y
( describe
( a ss er t f o r a l l ( ∗ v14 ∗ v15 ∗ v17 $v18 )
&ant ( ( b u i l d o b j e c t ∗ v17
p r o p e r t y ∗ v15 )
( b u i l d member ∗ v17
c l a s s ∗ v14 )
( b u i l d member ∗ v18
c l a s s ∗ v14 ) )
cq ( b u i l d mode ( b u i l d l e x ” p o s s i b l y ” )
o b j e c t ( b u i l d o b j e c t ∗ v18
p r o p e r t y ∗ v15 ) )
))
( m146 ! ( f o r a l l v16 v15 v13 v12 )
(& ant ( p44 ( c l a s s v12 ) ( member v16 ) ) ( p43 ( o b j e c t v15 ) ( p r o p e r t y v13 ) )
( p42 ( c l a s s v12 ) ( member v15 ) ) )
( cq
( p46 ( mode ( m145 ( l e x p o s s i b l y ) ) )
( o b j e c t ( p45 ( o b j e c t v16 ) ( p r o p e r t y v13 ) ) ) ) ) )
( m146 ! )
CPU time : 0 . 0 1
∗
;;;
I f an animal a c t s , then t h e a c t pe r f o r m e d i s an a c t i o n
( describe
( a ss er t f o r a l l ( $v19 $v20 )
&ant ( ( b u i l d member ∗ v20
c l a s s ( b u i l d l e x ” animal ” ) )
( b u i l d a c t ( b u i l d a c t i o n ∗ v19 )
a g e n t ∗ v20 ) )
cq ( b u i l d member ∗ v19
class ( build lex ” action ” ))
))
( m148 ! ( f o r a l l v18 v17 )
(& ant ( p49 ( a c t ( p48 ( a c t i o n v17 ) ) ) ( a g e n t v18 ) )
( p47 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v18 ) ) )
( cq ( p50 ( c l a s s ( m147 ( l e x a c t i o n ) ) ) ( member v17 ) ) ) )
127
( m148 ! )
CPU time : 0 . 0 2
∗
;;;
I f a p e r s o n a c t s , then t h e a c t p e r f o r m e d i s an a c t i o n
( describe
( a sse r t f o r a l l ( $v21 $v22 )
&ant ( ( b u i l d member ∗ v22
c l a s s ( build lex ” person ” ))
( b u i l d a c t ( b u i l d a c t i o n ∗ v21 )
a g e n t ∗ v22 ) )
cq ( b u i l d member ∗ v21
class ( build lex ” action ” ))
))
( m149 ! ( f o r a l l v20 v19 )
(& ant ( p53 ( a c t ( p52 ( a c t i o n v19 ) ) ) ( a g e n t v20 ) )
( p51 ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member v20 ) ) )
( cq ( p54 ( c l a s s ( m147 ( l e x a c t i o n ) ) ) ( member v19 ) ) ) )
( m149 ! )
CPU time : 0 . 0 2
∗
; ; ; S p e a r s a r e weapons
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” s p e a r ” )
s u p e r c l a s s ( b u i l d l e x ”weapon” )
))
( m152 ! ( s u b c l a s s ( m150 ( l e x s p e a r ) ) ) ( s u p e r c l a s s ( m151 ( l e x weapon ) ) ) )
( m152 ! )
CPU time : 0 . 0 1
∗
;;;
I f something i s a weapon , then i t s f u n c t i o n i s t o damage
( describe
( a ss ert f o r a l l $v23
ant ( b u i l d member ∗ v23
c l a s s ( b u i l d l e x ”weapon” )
)
cq ( b u i l d o b j e c t 1 ∗ v23
o b j e c t 2 ( b u i l d l e x ”damage” )
r e l ( build lex ” function ” ))
))
( m154 ! ( f o r a l l v21 ) ( ant ( p55 ( c l a s s ( m151 ( l e x weapon ) ) ) ( member v21 ) ) )
( cq
( p56 ( o b j e c t 1 v21 ) ( o b j e c t 2 ( m153 ( l e x damage ) ) )
( r e l ( m118 ( l e x f u n c t i o n ) ) ) ) ) )
128
( m154 ! )
CPU time : 0 . 0 1
∗
; ; ; Kings a r e p e r s o n s
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” k i n g ” )
s u p e r c l a s s ( build lex ” person ” )
))
( m155 ! ( s u b c l a s s ( m45 ( l e x k i n g ) ) ) ( s u p e r c l a s s ( m24 ( l e x p e r s o n ) ) ) )
( m155 ! )
CPU time : 0 . 0 1
∗
; ; ; Squires are persons
( describe
( a ss ert s u b c l a s s ( b u i l d l e x ” s q u i r e ” )
s u p e r c l a s s ( build lex ” person ” )
))
( m157 ! ( s u b c l a s s ( m156 ( l e x s q u i r e ) ) ) ( s u p e r c l a s s ( m24 ( l e x p e r s o n ) ) ) )
( m157 ! )
CPU time : 0 . 1 8
∗
; ; ; Yeomen a r e p e r s o n s
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ”yeoman” )
s u p e r c l a s s ( build lex ” person ” )
))
( m159 ! ( s u b c l a s s ( m158 ( l e x yeoman ) ) ) ( s u p e r c l a s s ( m24 ( l e x p e r s o n ) ) ) )
( m159 ! )
CPU time : 0 . 0 1
∗
;;;
I f something i s a c a r n i v o r e , then i t e a t s meat
( describe
( a ss ert f o r a l l ∗ v5
ant ( b u i l d member ∗ v5
class ( build lex ” carnivore ”)
)
cq ( b u i l d a c t ( b u i l d a c t i o n ( b u i l d l e x ” e a t ” ) o b j e c t ( b u i l d l e x ”meat” ) )
a g e n t ∗ v5 ) ) )
129
( m163 ! ( f o r a l l v7 ) ( ant ( p57 ( c l a s s ( m14 ( l e x c a r n i v o r e ) ) ) ( member v7 ) ) )
( cq
( p58 ( a c t ( m162 ( a c t i o n ( m160 ( l e x e a t ) ) ) ( o b j e c t ( m161 ( l e x meat ) ) ) ) )
( a g e n t v7 ) ) ) )
( m163 ! )
CPU time : 0 . 0 2
∗
;;;
I f something i s an h e r b i v o r e , then i t e a t s p l a n t s and d o e s not e a t meat
( describe
( as ser t f o r a l l ∗ v5
ant ( b u i l d member ∗ v5
class ( build lex ” herbivore ”)
)
cq ( ( b u i l d a c t ( b u i l d a c t i o n ( b u i l d l e x ” e a t ” ) o b j e c t ( b u i l d l e x ” p l a n t ” ) )
a g e n t ∗ v5 )
( b u i l d min 0
max 0
a r g ( b u i l d a c t ( b u i l d a c t i o n ( b u i l d l e x ” e a t ” ) o b j e c t ( b u i l d l e x ”meat” ) )
a g e n t ∗ v5 ) ) ) ) )
( m166 ! ( f o r a l l v7 ) ( ant ( p59 ( c l a s s ( m28 ( l e x h e r b i v o r e ) ) ) ( member v7 ) ) )
( cq
( p61 ( min 0 ) (max 0 )
( arg
( p58 ( a c t ( m162 ( a c t i o n ( m160 ( l e x e a t ) ) ) ( o b j e c t ( m161 ( l e x meat ) ) ) ) )
( a g e n t v7 ) ) ) )
( p60 ( a c t ( m165 ( a c t i o n ( m160 ) ) ( o b j e c t ( m164 ( l e x p l a n t ) ) ) ) ) ( a g e n t v7 ) ) ) )
( m166 ! )
CPU time : 0 . 0 1
∗
; ; ; I f something i s a mammal , presumably i t b e a r s
; ; ; ∗ ∗ NOTE∗ ∗ Change t o b e a r s l i v e young
( describe
( as se r t f o r a l l ∗ v5
ant ( b u i l d member ∗ v5
c l a s s ( b u i l d l e x ”mammal” ) )
cq ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( build act ( build a c t i o n ( build l e x ” bear ” ) )
a g e n t ∗ v5 ) ) ) )
( m169 ! ( f o r a l l v7 ) ( ant ( p62 ( c l a s s ( m10 ( l e x mammal ) ) ) ( member v7 ) ) )
( cq
( p64 ( mode ( m116 ( l e x presumably ) ) )
( o b j e c t ( p63 ( a c t ( m168 ( a c t i o n ( m167 ( l e x b e a r ) ) ) ) ) ( a g e n t v7 ) ) ) ) ) )
( m169 ! )
CPU time : 0 . 0 3
∗
;;;
130
; ; ; I f something b e a r s , then i t i s a mammal
; ; ; ∗ ∗ NOTE∗ ∗ Change t o b e a r s l i v e young
; ; ; ( describe
; ; ; ( a s s e r t f o r a l l ( $v24 ∗ v5 )
;;;
ant ( b u i l d a c t ( b u i l d a c t i o n ( b u i l d l e x ” b e a r ” ) o b j e c t ∗ v24 )
;;;
a g e n t ∗ v5 )
;;;
cq ( b u i l d member ∗ v5
;;;
c l a s s ( b u i l d l e x ”mammal ” ) ) ) )
; ; ; I f something b e a r s and i t i s a member o f a c l a s s then t h a t c l a s s
;;;
i s a s u b c l a s s o f mammal .
( describe
( as se r t f o r a l l ( $mammal $young $sup )
&ant ( ( b u i l d a g e n t ∗mammal
act ( build a c t i o n ( build l e x ” bear ” )
o b j e c t ∗ young ) )
( b u i l d member ∗mammal c l a s s ∗ sup ) )
cq ( b u i l d s u b c l a s s ∗ sup s u p e r c l a s s ( b u i l d l e x ”mammal” ) ) ) )
( m170 ! ( f o r a l l v24 v23 v22 )
(& ant ( p67 ( c l a s s v24 ) ( member v22 ) )
( p66 ( a c t ( p65 ( a c t i o n ( m167 ( l e x b e a r ) ) ) ( o b j e c t v23 ) ) ) ( a g e n t v22 ) ) )
( cq ( p68 ( s u b c l a s s v24 ) ( s u p e r c l a s s ( m10 ( l e x mammal ) ) ) ) ) )
( m170 ! )
CPU time : 0 . 0 2
∗
;;;
I f something i s a p r e d a t o r , then presumably i t hunts
( describe
( a ss ert f o r a l l ∗ v5
ant ( b u i l d member ∗ v5
c l a s s ( build lex ” predator ” ))
cq ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d a c t ( b u i l d a c t i o n ( b u i l d l e x ” hunt ” ) )
a g e n t ∗ v5 ) ) ) )
( m173 ! ( f o r a l l v7 ) ( ant ( p69 ( c l a s s ( m16 ( l e x p r e d a t o r ) ) ) ( member v7 ) ) )
( cq
( p71 ( mode ( m116 ( l e x presumably ) ) )
( o b j e c t ( p70 ( a c t ( m172 ( a c t i o n ( m171 ( l e x hunt ) ) ) ) ) ( a g e n t v7 ) ) ) ) ) )
( m173 ! )
CPU time : 0 . 0 2
∗
;;;
;;;
I f an a g e n t l e a p s onto an o b j e c t a t time x , then t h e r e i s a time y when
t h e l e a p e r i s on t h e o b j e c t , and y i s a f t e r x
( describe
( a ss ert f o r a l l ( $v25 $v26 $v27 )
ant ( b u i l d a g e n t ∗ v25
act ( build action ( build lex ” leap ” )
onto ∗ v26
time ∗ v27 ) )
131
cq ( ( b u i l d o b j e c t 1 ∗ v25
o b j e c t 2 ∗ v26
r e l ( b u i l d l e x ” on” )
time ( b u i l d a3 ∗ v26
s k f ” time−at ” ) )
( b u i l d a f t e r ( b u i l d a3 ∗ v26
s k f ” time−at ” )
b e f o r e ∗ v27 ) ) ) )
( m176 ! ( f o r a l l v27 v26 v25 )
( ant
( p73 ( a c t ( p72 ( a c t i o n ( m174 ( l e x l e a p ) ) ) ( onto v26 ) ( time v27 ) ) )
( a g e n t v25 ) ) )
( cq ( p76 ( a f t e r ( p74 ( a3 v26 ) ( s k f time−at ) ) ) ( b e f o r e v27 ) )
( p75 ( o b j e c t 1 v25 ) ( o b j e c t 2 v26 ) ( r e l ( m175 ( l e x on ) ) ) ( time ( p74 ) ) ) ) )
( m176 ! )
CPU time : 0 . 0 4
∗
;;;
;;;
I f an a g e n t l e a p s t o a g o a l a t time x , then t h e r e i s a time y when t h e
l e a p e r i s a t t h e g o a l , and y i s a f t e r x
( describe
( a sse r t f o r a l l ( ∗ v25 ∗ v26 ∗ v27 )
ant ( b u i l d a g e n t ∗ v25
act ( build action ( build lex ” leap ” )
time ∗ v27
t o ∗ v26 ) )
cq ( ( b u i l d o b j e c t 1 ∗ v25
o b j e c t 2 ∗ v26
r e l ( build l e x ” at ” )
time ( b u i l d a3 ∗ v26
s k f ” time−at ” ) )
( b u i l d a f t e r ( b u i l d a3 ∗ v26
s k f ” time−at ” )
b e f o r e ∗ v27 ) )
))
( m178 ! ( f o r a l l v27 v26 v25 )
( ant
( p78 ( a c t ( p77 ( a c t i o n ( m174 ( l e x l e a p ) ) ) ( time v27 ) ( t o v26 ) ) )
( a g e n t v25 ) ) )
( cq
( p79 ( o b j e c t 1 v25 ) ( o b j e c t 2 v26 ) ( r e l ( m177 ( l e x a t ) ) )
( time ( p74 ( a3 v26 ) ( s k f time−at ) ) ) )
( p76 ( a f t e r ( p74 ) ) ( b e f o r e v27 ) ) ) )
( m178 ! )
CPU time : 0 . 0 3
∗
;;;
;;;
I f an a g e n t l e a p s from an o b j e c t a t time x , then t h e r e i s a time y when
t h e l e a p e r i s on t h e o b j e c t , and y i s b e f o r e x
( describe
132
( a sse r t f o r a l l ( ∗ v25 ∗ v26 $v28 $v29 )
ant ( b u i l d a g e n t ∗ v25
act ( build action ( build lex ” leap ” )
from ∗ v28
time ∗ v29 ) )
cq ( ( b u i l d o b j e c t 1 ∗ v25
o b j e c t 2 ∗ v28
r e l ( b u i l d l e x ” on” )
time ( b u i l d a4 ∗ v28
s k f ” time−at ” ) )
( b u i l d a f t e r ∗ v29
b e f o r e ( b u i l d a4 ∗ v28
s k f ” time−at ” ) ) )
))
( m179 ! ( f o r a l l v29 v28 v26 v25 )
( ant
( p81 ( a c t ( p80 ( a c t i o n ( m174 ( l e x l e a p ) ) ) ( from v28 ) ( time v29 ) ) )
( a g e n t v25 ) ) )
( cq ( p84 ( a f t e r v29 ) ( b e f o r e ( p82 ( a4 v28 ) ( s k f time−at ) ) ) )
( p83 ( o b j e c t 1 v25 ) ( o b j e c t 2 v28 ) ( r e l ( m175 ( l e x on ) ) ) ( time ( p82 ) ) ) ) )
( m179 ! )
CPU time : 0 . 0 3
∗
( describe
( a sse r t f o r a l l ( $v30 $v31 $v32 )
ant ( ( b u i l d a g e n t ∗ v30
p l a c e ∗ v31
time ∗ v32 )
( b u i l d o b j e c t ∗ v30
p l a c e ∗ v31
time ∗ v32 ) )
cq ( b u i l d o b j e c t 1 ∗ v30
o b j e c t 2 ∗ v31
r e l ( build l e x ” at ” )
time ∗ v32 )
))
( m180 ! ( f o r a l l v32
( ant ( p86 ( o b j e c t
( p85 ( a g e n t v30 )
( cq ( p87 ( o b j e c t 1
v31 v30 )
v30 ) ( p l a c e v31 ) ( time v32 ) )
( p l a c e v31 ) ( time v32 ) ) )
v30 ) ( o b j e c t 2 v31 ) ( r e l ( m177 ( l e x a t ) ) ) ( time v32 ) ) ) )
( m180 ! )
CPU time : 0 . 0 3
∗
; ; Define a p r i m i t i v e a c t i o n that does nothing
ˆ(
−−> d e f i n e − p r i m a c t i o n noop ( )
”Do n o t h i n g ”
( format t ”” ) )
noop
133
CPU time : 0 . 0 0
∗ ˆ(
−−> a t t a c h − p r i m a c t i o n noop noop )
t
CPU time : 0 . 0 1
∗
ˆ(
−−> a t t a c h − p r i m a c t i o n s n i f s n i f b e l i e v e b e l i e v e )
t
CPU time : 0 . 0 1
∗ ( describe
( a sse r t
f o r a l l ( $x $y $z )
&ant ( ( b u i l d member ∗ x c l a s s ∗ y )
( b u i l d member ∗ x c l a s s ∗ z )
( b u i l d o b j e c t ∗ y p r o p e r t y ( b u i l d l e x ”unknown” ) ) )
cq ( b u i l d
when ( b u i l d member ∗ x c l a s s ∗ y )
do ( b u i l d a c t i o n s n i f
object1 ( ( build condition
( build subclass ∗ z superclass ∗y)
then ( b u i l d a c t i o n noop ) )
( build e l s e
( build action believe
object1
( b u i l d mode ( b u i l d l e x ” presumably ” )
object
( build subclass ∗y superclass ∗ z ) ) ) ) ) ) ) ) )
( m183 !
(& ant
( p89
( cq
( p98
( do
( f o r a l l v35 v34 v33 )
( p90 ( o b j e c t v34 ) ( p r o p e r t y ( m181 ( l e x unknown ) ) ) )
( c l a s s v35 ) ( member v33 ) ) ( p88 ( c l a s s v34 ) ( member v33 ) ) )
( p97
( action s n i f )
( object1
( p96
( else
( p95 ( a c t i o n b e l i e v e )
( object1
( p94 ( mode ( m116 ( l e x presumably ) ) )
( o b j e c t ( p93 ( s u b c l a s s v34 ) ( s u p e r c l a s s v35 ) ) ) ) ) ) ) )
( p92 ( c o n d i t i o n ( p91 ( s u b c l a s s v35 ) ( s u p e r c l a s s v34 ) ) )
( then ( m182 ( a c t i o n noop ) ) ) ) ) ) )
(when ( p88 ) ) ) ) )
( m183 ! )
CPU time : 0 . 0 4
∗
134
End o f / p r o j e c t s / s t n 2 /CVA/demos/ c a t . b a s e d e m o n s t r a t i o n .
CPU time : 2 . 0 1
∗
; ; ; Begin Reading S t o r y
; ; ; There i s a c a t
( describe
( add member #Pye
c l a s s ( build lex ” cat ” ) ) )
( m246 ! ( c l a s s ( m147 ( l e x a c t i o n ) ) ) ( member ( m160 ( l e x e a t ) ) ) )
( m245 ! ( a c t ( m244 ( a c t i o n ( m160 ) ) ) ) ( a g e n t b1 ) )
( m243 ! ( a c t ( m162 ( a c t i o n ( m160 ) ) ( o b j e c t ( m161 ( l e x meat ) ) ) ) ) ( a g e n t b1 ) )
( m241 ! ( c l a s s ( m35 ( l e x v e r t e b r a t e ) ) ) ( member b1 ) )
( m240 ! ( c l a s s ( m16 ( l e x p r e d a t o r ) ) ) ( member b1 ) )
( m239 ! ( c l a s s ( m14 ( l e x c a r n i v o r e ) ) ) ( member b1 ) )
( m238 ! ( c l a s s ( m12 ( l e x quadruped ) ) ) ( member b1 ) )
( m237 ! ( c l a s s ( m10 ( l e x mammal ) ) ) ( member b1 ) )
( m236 ! ( c l a s s ( m78 ( l e x f u r n i t u r e ) ) ) ( member ( m40 ( l e x Round Table ) ) ) )
( m235 ! ( c l a s s ( m38 ( l e x phys o b j ) ) ) ( member b1 ) )
( m232 ! ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member b11 ) )
( m231 ! ( c l a s s ( m24 ) ) ( member b10 ) )
( m230 ! ( c l a s s ( m24 ) ) ( member b9 ) )
( m229 ! ( c l a s s ( m24 ) ) ( member b8 ) )
( m228 ! ( c l a s s ( m24 ) ) ( member b7 ) )
( m227 ! ( c l a s s ( m24 ) ) ( member b6 ) )
( m226 ! ( c l a s s ( m24 ) ) ( member b5 ) )
( m225 ! ( c l a s s ( m24 ) ) ( member b3 ) )
( m224 ! ( c l a s s ( m18 ( l e x animal ) ) ) ( member b1 ) )
( m185 ! ( c l a s s ( m184 ( l e x c a t ) ) ) ( member b12 ) )
( m159 ! ( s u b c l a s s ( m158 ( l e x yeoman ) ) ) ( s u p e r c l a s s ( m24 ) ) )
( m157 ! ( s u b c l a s s ( m156 ( l e x s q u i r e ) ) ) ( s u p e r c l a s s ( m24 ) ) )
( m155 ! ( s u b c l a s s ( m45 ( l e x k i n g ) ) ) ( s u p e r c l a s s ( m24 ) ) )
( m115 ! ( c l a s s ( m112 ( l e x v a l u e ) ) ) ( member ( m114 ( l e x bad ) ) ) )
( m113 ! ( c l a s s ( m112 ) ) ( member ( m111 ( l e x good ) ) ) )
( m108 ! ( c l a s s ( m103 ( l e x s i z e ) ) ) ( member ( m107 ( l e x l a r g e ) ) ) )
( m104 ! ( c l a s s ( m103 ) ) ( member ( m102 ( l e x s m a l l ) ) ) )
( m101 ! ( c l a s s ( m98 ( l e x c o l o r ) ) ) ( member ( m100 ( l e x b l a c k ) ) ) )
( m99 ! ( c l a s s ( m98 ) ) ( member ( m97 ( l e x w h i t e ) ) ) )
( m96 ! ( c l a s s ( m90 ( l e x b a s i c c t g y ) ) ) ( member ( m41 ( l e x t a b l e ) ) ) )
( m95 ! ( c l a s s ( m90 ) ) ( member ( m81 ( l e x c h a i r ) ) ) )
( m94 ! ( c l a s s ( m90 ) ) ( member ( m2 ( l e x d e e r ) ) ) )
( m93 ! ( c l a s s ( m90 ) ) ( member ( m83 ( l e x h o r s e ) ) ) )
( m92 ! ( c l a s s ( m90 ) ) ( member ( m8 ( l e x dog ) ) ) )
( m91 ! ( c l a s s ( m90 ) ) ( member ( m24 ) ) )
( m89 ! ( s u b c l a s s ( m69 ( l e x k n i g h t ) ) ) ( s u p e r c l a s s ( m24 ) ) )
( m76 ! ( c l a s s ( m69 ) ) ( member b11 ) )
( m73 ! ( c l a s s ( m69 ) ) ( member b10 ) )
( m70 ! ( c l a s s ( m69 ) ) ( member b9 ) )
( m66 ! ( c l a s s ( m45 ) ) ( member b8 ) )
( m63 ! ( c l a s s ( m45 ) ) ( member b7 ) )
( m60 ! ( c l a s s ( m45 ) ) ( member b6 ) )
( m57 ! ( s u b c l a s s ( m55 ( l e x w i z a r d ) ) ) ( s u p e r c l a s s ( m24 ) ) )
( m56 ! ( c l a s s ( m55 ) ) ( member b5 ) )
( m51 ! ( c l a s s ( m50 ( l e x sword ) ) ) ( member b4 ) )
135
( m46 !
( m42 !
( m25 !
( m20 !
(
(
(
(
class
class
class
class
( m45 ) ) ( member b3 ) )
( m41 ) ) ( member ( m40 ) ) )
( m24 ) ) ( member b2 ) )
( m8 ) ) ( member b1 ) )
( m246 ! m245 ! m243 ! m241 ! m240 ! m239 ! m238 ! m237 ! m236 ! m235 ! m232 ! m231 ! m230 !
m229 ! m228 ! m227 ! m226 ! m225 ! m224 ! m185 ! m159 ! m157 ! m155 ! m115 ! m113 ! m108 !
m104 ! m101 ! m99 ! m96 ! m95 ! m94 ! m93 ! m92 ! m91 ! m89 ! m76 ! m73 ! m70 ! m66 ! m63 !
m60 ! m57 ! m56 ! m51 ! m46 ! m42 ! m25 ! m20 ! )
CPU time : 5 . 9 2
∗
; ; ; Cat i s an unknown word
( describe
( add o b j e c t ( b u i l d l e x ” c a t ” )
p r o p e r t y ( b u i l d l e x ”unknown” ) ) )
( m246 ! ( c l a s s ( m147 ( l e x a c t i o n ) ) ) ( member ( m160 ( l e x e a t ) ) ) )
( m241 ! ( c l a s s ( m35 ( l e x v e r t e b r a t e ) ) ) ( member b1 ) )
( m240 ! ( c l a s s ( m16 ( l e x p r e d a t o r ) ) ) ( member b1 ) )
( m239 ! ( c l a s s ( m14 ( l e x c a r n i v o r e ) ) ) ( member b1 ) )
( m238 ! ( c l a s s ( m12 ( l e x quadruped ) ) ) ( member b1 ) )
( m237 ! ( c l a s s ( m10 ( l e x mammal ) ) ) ( member b1 ) )
( m236 ! ( c l a s s ( m78 ( l e x f u r n i t u r e ) ) ) ( member ( m40 ( l e x Round Table ) ) ) )
( m235 ! ( c l a s s ( m38 ( l e x phys o b j ) ) ) ( member b1 ) )
( m232 ! ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member b11 ) )
( m231 ! ( c l a s s ( m24 ) ) ( member b10 ) )
( m230 ! ( c l a s s ( m24 ) ) ( member b9 ) )
( m229 ! ( c l a s s ( m24 ) ) ( member b8 ) )
( m228 ! ( c l a s s ( m24 ) ) ( member b7 ) )
( m227 ! ( c l a s s ( m24 ) ) ( member b6 ) )
( m226 ! ( c l a s s ( m24 ) ) ( member b5 ) )
( m225 ! ( c l a s s ( m24 ) ) ( member b3 ) )
( m224 ! ( c l a s s ( m18 ( l e x animal ) ) ) ( member b1 ) )
( m202 ! ( o b j e c t ( m184 ( l e x c a t ) ) ) ( p r o p e r t y ( m181 ( l e x unknown ) ) ) )
( m115 ! ( c l a s s ( m112 ( l e x v a l u e ) ) ) ( member ( m114 ( l e x bad ) ) ) )
( m113 ! ( c l a s s ( m112 ) ) ( member ( m111 ( l e x good ) ) ) )
( m108 ! ( c l a s s ( m103 ( l e x s i z e ) ) ) ( member ( m107 ( l e x l a r g e ) ) ) )
( m104 ! ( c l a s s ( m103 ) ) ( member ( m102 ( l e x s m a l l ) ) ) )
( m101 ! ( c l a s s ( m98 ( l e x c o l o r ) ) ) ( member ( m100 ( l e x b l a c k ) ) ) )
( m99 ! ( c l a s s ( m98 ) ) ( member ( m97 ( l e x w h i t e ) ) ) )
( m96 ! ( c l a s s ( m90 ( l e x b a s i c c t g y ) ) ) ( member ( m41 ( l e x t a b l e ) ) ) )
( m95 ! ( c l a s s ( m90 ) ) ( member ( m81 ( l e x c h a i r ) ) ) )
( m94 ! ( c l a s s ( m90 ) ) ( member ( m2 ( l e x d e e r ) ) ) )
( m93 ! ( c l a s s ( m90 ) ) ( member ( m83 ( l e x h o r s e ) ) ) )
( m92 ! ( c l a s s ( m90 ) ) ( member ( m8 ( l e x dog ) ) ) )
( m91 ! ( c l a s s ( m90 ) ) ( member ( m24 ) ) )
( m76 ! ( c l a s s ( m69 ( l e x k n i g h t ) ) ) ( member b11 ) )
( m73 ! ( c l a s s ( m69 ) ) ( member b10 ) )
( m70 ! ( c l a s s ( m69 ) ) ( member b9 ) )
( m66 ! ( c l a s s ( m45 ( l e x k i n g ) ) ) ( member b8 ) )
( m63 ! ( c l a s s ( m45 ) ) ( member b7 ) )
( m60 ! ( c l a s s ( m45 ) ) ( member b6 ) )
( m56 ! ( c l a s s ( m55 ( l e x w i z a r d ) ) ) ( member b5 ) )
( m51 ! ( c l a s s ( m50 ( l e x sword ) ) ) ( member b4 ) )
( m46 ! ( c l a s s ( m45 ) ) ( member b3 ) )
( m42 ! ( c l a s s ( m41 ) ) ( member ( m40 ) ) )
136
( m25 ! ( c l a s s ( m24 ) ) ( member b2 ) )
( m20 ! ( c l a s s ( m8 ) ) ( member b1 ) )
( m246 ! m241 ! m240 ! m239 ! m238 ! m237 ! m236 ! m235 ! m232 ! m231 ! m230 ! m229 ! m228 !
m227 ! m226 ! m225 ! m224 ! m202 ! m115 ! m113 ! m108 ! m104 ! m101 ! m99 ! m96 ! m95 !
m94 ! m93 ! m92 ! m91 ! m76 ! m73 ! m70 ! m66 ! m63 ! m60 ! m56 ! m51 ! m46 ! m42 ! m25 !
m20 ! )
CPU time : 2 . 2 3
∗
; ; ; The c a t i s named Pyewacket
( describe
( a sse r t o b j e c t ∗ Pye
proper−name ( b u i l d l e x ” Pyewacket ” ) ) )
( m262 ! ( o b j e c t b12 ) ( proper−name ( m261 ( l e x Pyewacket ) ) ) )
( m262 ! )
CPU time : 0 . 0 2
∗
; ; ; What i s t h e meaning o f c a t ?
ˆ(
−−> defineNoun ” c a t ” )
Definition of cat :
Named I n d i v i d u a l s : Pyewacket ,
nil
CPU time : 4 . 1 8
∗
; ; ; There i s a p e r s o n
( describe
( add member #Evelyn
c l a s s ( build lex ” person ” ) ) )
( m276 ! ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member b13 ) )
( m232 ! ( c l a s s ( m24 ) ) ( member b11 ) )
( m231 ! ( c l a s s ( m24 ) ) ( member b10 ) )
( m230 ! ( c l a s s ( m24 ) ) ( member b9 ) )
( m229 ! ( c l a s s ( m24 ) ) ( member b8 ) )
( m228 ! ( c l a s s ( m24 ) ) ( member b7 ) )
( m227 ! ( c l a s s ( m24 ) ) ( member b6 ) )
( m226 ! ( c l a s s ( m24 ) ) ( member b5 ) )
( m225 ! ( c l a s s ( m24 ) ) ( member b3 ) )
( m25 ! ( c l a s s ( m24 ) ) ( member b2 ) )
( m276 ! m232 ! m231 ! m230 ! m229 ! m228 ! m227 ! m226 ! m225 ! m25 ! )
CPU time : 6 . 5 6
∗
; ; ; The p e r s o n i s named Evelyn
( describe
( as ser t o b j e c t ∗ Evelyn
proper−name ( b u i l d l e x ” Evelyn ” ) ) )
137
( m337 ! ( o b j e c t b13 ) ( proper−name ( m336 ( l e x Evelyn ) ) ) )
( m337 ! )
CPU time : 0 . 0 0
∗
; ; ; Pyewacket i s Evelyn ’ s c a t
( describe
( add o b j e c t ∗ Pye
p o s s e s s o r ∗ Evelyn
r e l ( build lex ” cat ” ) ) )
( m338 ! ( o b j e c t b12 ) ( p o s s e s s o r b13 ) ( r e l ( m184 ( l e x c a t ) ) ) )
( m338 ! )
CPU time : 0 . 0 9
∗
; ; ; What i s t h e meaning o f c a t ?
ˆ(
−−> defineNoun ” c a t ” )
Definition of cat :
P os s e s s iv e : person ,
Named I n d i v i d u a l s : Pyewacket ,
nil
CPU time : 0 . 5 6
∗
; ; ; Pyewacket b e a r s something
( describe
( add a g e n t ∗ Pye
act ( build a c t i o n ( build l e x ” bear ” )
object #kittens1 )))
( m340 ! ( a c t ( m339 ( a c t i o n ( m167 ( l e x b e a r ) ) ) ( o b j e c t b14 ) ) ) ( a g e n t b12 ) )
( m274 ! ( a c t ( m168 ( a c t i o n ( m167 ) ) ) ) ( a g e n t b12 ) )
( m266 ! ( s u b c l a s s ( m184 ( l e x c a t ) ) ) ( s u p e r c l a s s ( m10 ( l e x mammal ) ) ) )
( m340 ! m274 ! m266 ! )
CPU time : 0 . 1 3
∗
; ; ; The t h i n g t h a t Pyewacket b e a r s i s a k i t t e n
( describe
( add member ∗ k i t t e n s 1
class ( build lex ” kitten ” )))
( m342 ! ( c l a s s ( m341 ( l e x k i t t e n ) ) ) ( member b14 ) )
( m342 ! )
CPU time : 5 . 5 6
138
∗
; ; ; Kittens are cats
( describe
( add s u b c l a s s ( b u i l d l e x ” k i t t e n ” )
superclas s ( build lex ” cat ” ) ) )
( m385 ! ( s u b c l a s s ( m341 ( l e x k i t t e n ) ) ) ( s u p e r c l a s s ( m184 ( l e x c a t ) ) ) )
( m385 ! )
CPU time : 0 . 1 0
∗
; ; ; Kittens
( describe
( add f o r a l l
ant
cq
a r e young
$kitty
( b u i l d member ∗ k i t t y
class ( build lex ” kitten ” ))
( b u i l d o b j e c t ∗ k i t t y p r o p e r t y ( b u i l d l e x ” young ” ) ) ) )
( m388 ! ( o b j e c t b14 ) ( p r o p e r t y ( m386 ( l e x young ) ) ) )
( m387 ! ( f o r a l l v42 ) ( ant ( p318 ( c l a s s ( m341 ( l e x k i t t e n ) ) ) ( member v42 ) ) )
( cq ( p319 ( o b j e c t v42 ) ( p r o p e r t y ( m386 ) ) ) ) )
( m342 ! ( c l a s s ( m341 ) ) ( member b14 ) )
( m388 ! m387 ! m342 ! )
CPU time : 0 . 4 2
∗
; ; ; What i s t h e meaning o f c a t ?
ˆ(
−−> defineNoun ” c a t ” )
Definition of cat :
C l a s s I n c l u s i o n s : mammal ,
P o s s i b l e Actions : bear k i t t e n ,
P os s e s s iv e : person ,
nil
CPU time : 9 . 6 8
∗
; ; ; Something i s a c a t
( describe
( a ss ert member # F r i s k
c l a s s ( build lex ” cat ” ) ) )
( m417 ! ( c l a s s ( m184 ( l e x c a t ) ) ) ( member b15 ) )
( m417 ! )
CPU time : 0 . 0 2
∗
; ; ; That c a t i s named F r i s k y
( describe
( as se r t proper−name ( b u i l d l e x ” F r i s k y ” )
object ∗ Frisk ) )
139
( m419 ! ( o b j e c t b15 ) ( proper−name ( m418 ( l e x F r i s k y ) ) ) )
( m419 ! )
CPU time : 0 . 0 1
∗
; ; ; What i s t h e meaning o f c a t ?
ˆ(
−−> defineNoun ” c a t ” )
Definition of cat :
C l a s s I n c l u s i o n s : mammal ,
P o s s i b l e Actions : bear k i t t e n ,
P os s e s s iv e : person ,
nil
CPU time : 3 . 3 0
∗
; ; ; F r i s k y s l e e p s i n an something
( describe
( add a g e n t ∗ F r i s k
act ( build action ( build lex ” sleep ” ))
p l a c e #armch ) )
( m442 !
( m441 !
( m440 !
( m439 !
( m429 !
(
(
(
(
(
c l a s s ( m147 ( l e x a c t i o n ) ) ) ( member ( m127 ( l e x sleep ) ) ) )
c l a s s ( m38 ( l e x phys o b j ) ) ) ( member b15 ) )
c l a s s ( m18 ( l e x animal ) ) ) ( member b15 ) )
a c t ( m128 ( a c t i o n ( m127 ) ) ) ) ( a g e n t b15 ) ( p l a c e b16 ) )
a c t ( m128 ) ) ( a g e n t b15 ) )
( m442 ! m441 ! m440 ! m439 ! m429 ! )
CPU time : 1 . 1 9
∗
; ; ; The t h i n g t h a t F r i s k y s l e e p s i n i s a c h a i r
( describe
( as ser t member ∗ armch
class ( build lex ” chair ” )))
( m443 ! ( c l a s s ( m81 ( l e x c h a i r ) ) ) ( member b16 ) )
( m443 ! )
CPU time : 0 . 0 0
∗
; ; ; The t h i n g t h a t F r i s k y s l e e p s i n i s an a r m c h a i r
( describe
( as ser t member ∗ armch
c l a s s ( build l e x ” armchair ” ) ) )
( m445 ! ( c l a s s ( m444 ( l e x a r m c h a i r ) ) ) ( member b16 ) )
( m445 ! )
CPU time : 0 . 0 3
140
∗
; ; ; Armchairs a r e c h a i r s ( THIS SHOULD BE BK −− SN)
( describe
( a ss ert s u b c l a s s ( b u i l d l e x ” a r m c h a i r ” )
superclass ( build lex ” chair ” )))
( m446 ! ( s u b c l a s s ( m444 ( l e x a r m c h a i r ) ) ) ( s u p e r c l a s s ( m81 ( l e x c h a i r ) ) ) )
( m446 ! )
CPU time : 0 . 0 1
∗
; ; ; What i s t h e meaning o f c a t ?
ˆ(
−−> defineNoun ” c a t ” )
Definition of cat :
C l a s s I n c l u s i o n s : mammal ,
P o s s i b l e A c t i o n s : b e a r k i t t e n , sleep ,
P os s e s s iv e : person ,
nil
CPU time : 2 . 6 3
∗
; ; ; I f something i s a c a t , then presumably i t p u r r s .
( describe
( add f o r a l l $ c a t
ant ( b u i l d member ∗ c a t
c l a s s ( build lex ” cat ” ))
cq ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( build agent ∗ cat act ( build a c t i o n ( build l e x ” purr ” ) ) ) ) ) )
( m456 ! ( mode ( m116 ( l e x presumably ) ) )
( o b j e c t ( m455 ( a c t ( m448 ( a c t i o n ( m447 ( l e x p u r r ) ) ) ) ) ( a g e n t b15 ) ) ) )
( m454 ! ( mode ( m116 ) ) ( o b j e c t ( m453 ( a c t ( m448 ) ) ( a g e n t b14 ) ) ) )
( m452 ! ( c l a s s ( m184 ( l e x c a t ) ) ) ( member b14 ) )
( m451 ! ( mode ( m116 ) ) ( o b j e c t ( m450 ( a c t ( m448 ) ) ( a g e n t b12 ) ) ) )
( m449 ! ( f o r a l l v64 ) ( ant ( p414 ( c l a s s ( m184 ) ) ( member v64 ) ) )
( cq ( p416 ( mode ( m116 ) ) ( o b j e c t ( p415 ( a c t ( m448 ) ) ( a g e n t v64 ) ) ) ) ) )
( m417 ! ( c l a s s ( m184 ) ) ( member b15 ) )
( m185 ! ( c l a s s ( m184 ) ) ( member b12 ) )
( m456 ! m454 ! m452 ! m451 ! m449 ! m417 ! m185 ! )
CPU time : 1 . 2 1
∗
; ; ; What i s t h e meaning o f c a t ?
ˆ(
−−> defineNoun ” c a t ” )
Definition of cat :
C l a s s I n c l u s i o n s : mammal ,
Probable Actions : purr ,
P o s s i b l e P r o p e r t i e s : young ,
P os s e s s iv e : person ,
nil
141
CPU time : 3 . 3 3
∗
; ; ; I f something i s a c a t , then presumably i t hunts
( describe
( add f o r a l l ∗ c a t
ant ( b u i l d o b j e c t ∗ c a t
c l a s s ( build lex ” cat ” ))
cq ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d a g e n t ∗ c a t a c t ( b u i l d a c t i o n ( b u i l d l e x ” hunt ” ) ) ) ) ) )
( m458 ! ( f o r a l l v64 ) ( ant ( p433 ( c l a s s ( m184 ( l e x c a t ) ) ) ( o b j e c t v64 ) ) )
( cq
( p435 ( mode ( m116 ( l e x presumably ) ) )
( o b j e c t ( p434 ( a c t ( m172 ( a c t i o n ( m171 ( l e x hunt ) ) ) ) ) ( a g e n t v64 ) ) ) ) ) )
( m458 ! )
CPU time : 0 . 5 4
∗
; ; ; What i s t h e meaning o f c a t ?
ˆ(
−−> defineNoun ” c a t ” )
Definition of cat :
C l a s s I n c l u s i o n s : mammal ,
P r o b a b l e A c t i o n s : p u r r , hunt ,
P o s s i b l e P r o p e r t i e s : young ,
P os s e s s iv e : person ,
nil
CPU time : 3 . 2 9
∗
; ; ; Cats a r e mammals
( describe
( add s u b c l a s s ( b u i l d l e x ” c a t ” )
s u p e r c l a s s ( b u i l d l e x ”mammal” ) ) )
( m266 ! ( s u b c l a s s ( m184 ( l e x c a t ) ) ) ( s u p e r c l a s s ( m10 ( l e x mammal ) ) ) )
( m266 ! )
CPU time : 0 . 0 2
∗
; ; ; What i s t h e meaning o f c a t ?
ˆ(
−−> defineNoun ” c a t ” )
Definition of cat :
C l a s s I n c l u s i o n s : mammal ,
P r o b a b l e A c t i o n s : p u r r , hunt ,
P o s s i b l e P r o p e r t i e s : young ,
P os s e s s iv e : person ,
nil
CPU time : 3 . 6 0
∗
142
; ; ; Cats a r e p r e d a t o r s
( describe
( add s u b c l a s s ( b u i l d l e x ” c a t ” )
superclass ( build lex ” predator ” ) ) )
( m460 ! ( s u b c l a s s ( m341 ( l e x k i t t e n ) ) ) ( s u p e r c l a s s ( m16 ( l e x p r e d a t o r ) ) ) )
( m459 ! ( s u b c l a s s ( m184 ( l e x c a t ) ) ) ( s u p e r c l a s s ( m16 ) ) )
( m460 ! m459 ! )
CPU time : 0 . 2 1
∗
; ; ; What i s t h e meaning o f c a t ?
ˆ(
−−> defineNoun ” c a t ” )
Definition of cat :
C l a s s I n c l u s i o n s : p r e d a t o r , mammal ,
Probable Actions : purr ,
P o s s i b l e P r o p e r t i e s : young ,
P os s e s s iv e : person ,
nil
CPU time : 9 . 2 2
∗
; ; ; Cats a r e quadrupeds
( describe
( add s u b c l a s s ( b u i l d l e x ” c a t ” )
s u p e r c l a s s ( b u i l d l e x ” quadruped ” ) ) )
( m473 ! ( s u b c l a s s ( m341 ( l e x k i t t e n ) ) ) ( s u p e r c l a s s ( m12 ( l e x quadruped ) ) ) )
( m472 ! ( s u b c l a s s ( m184 ( l e x c a t ) ) ) ( s u p e r c l a s s ( m12 ) ) )
( m473 ! m472 ! )
CPU time : 0 . 2 2
∗
; ; ; What i s t h e meaning o f c a t ?
ˆ(
−−> defineNoun ” c a t ” )
Definition of cat :
C l a s s I n c l u s i o n s : p r e d a t o r , quadruped , mammal ,
Probable Actions : purr ,
P o s s i b l e P r o p e r t i e s : young ,
P os s e s s iv e : person ,
nil
CPU time : 1 2 . 8 0
∗
; ; ; I f something i s a c a t , then presumably i t has w h i s k e r s
( describe
( add f o r a l l ∗ c a t
ant ( b u i l d member ∗ c a t
c l a s s ( build lex ” cat ” ))
cq ( ( b u i l d mode ( b u i l d l e x ” presumably ” )
object ( build part ( build lex ” whisker ” )
143
whole ∗ c a t ) ) ) ) )
( m489 ! ( mode ( m116 ( l e x presumably ) ) )
( o b j e c t ( m488 ( p a r t ( m482 ( l e x w h i s k e r ) ) ) ( whole b12 ) ) ) )
( m487 ! ( mode ( m116 ) ) ( o b j e c t ( m486 ( p a r t ( m482 ) ) ( whole b15 ) ) ) )
( m485 ! ( mode ( m116 ) ) ( o b j e c t ( m484 ( p a r t ( m482 ) ) ( whole b14 ) ) ) )
( m483 ! ( f o r a l l v64 ) ( ant ( p414 ( c l a s s ( m184 ( l e x c a t ) ) ) ( member v64 ) ) )
( cq ( p525 ( mode ( m116 ) ) ( o b j e c t ( p524 ( p a r t ( m482 ) ) ( whole v64 ) ) ) ) ) )
( m489 ! m487 ! m485 ! m483 ! )
CPU time : 1 . 0 3
∗
; ; ; What i s t h e meaning o f c a t ?
ˆ(
−−> defineNoun ” c a t ” )
Definition of cat :
C l a s s I n c l u s i o n s : p r e d a t o r , quadruped , mammal ,
Probable Structure : whisker ,
Probable Actions : purr ,
P o s s i b l e P r o p e r t i e s : young ,
P os s e s s iv e : person ,
nil
CPU time : 9 . 9 8
∗
; ; ; End Reading S t o r y
End o f / p r o j e c t s / s t n 2 /CVA/demos/ c a t . demo d e m o n s t r a t i o n .
CPU time : 9 0 . 6 3
∗
B.3
Hackney
==============================================================
S t a r t i n g image ‘ / u t i l / a c l 6 2 / composer ’
with no arguments
i n directory ‘ / p r o j e c t s / s t n 2 /CVA/demos / ’
on machine ‘ l o c a l h o s t ’ .
I n t e r n a t i o n a l A l l e g r o CL E n t e r p r i s e E d i t i o n
6 . 2 [ S o l a r i s ] ( Aug 1 5 , 2 0 0 2 1 4 : 2 4 )
C o p y r i g h t ( C) 1 9 8 5 − 2 0 0 2 , Franz I n c . , B e r k e l e y , CA , USA .
A l l R i g h t s Reserved .
This development copy o f A l l e g r o CL i s l i c e n s e d t o :
[ 4 5 4 9 ] SUNY/ B u f f a l o , N . Campus
; ; O p t i m i z a t i o n s e t t i n g s : s a f e t y 1 , s p a c e 1 , s p e e d 1 , debug 2 .
; ; For a c o m p l e t e d e s c r i p t i o n o f a l l c o m p i l e r s w i t c h e s g i v e n t h e c u r r e n t
; ; optimization s e t t i n g s evaluate ( explain−compiler−settings ) .
;;−−−
; ; Current r e a d e r c a s e mode : : c a s e − s e n s i t i v e − l o w e r
cl−user ( 1 ) : : ld lna
E r r o r : ” l n a ” d o e s not e x i s t , cannot load
[ c o n d i t i o n type : f i l e − d o e s − n o t − e x i s t − e r r o r ]
144
R e s t a r t a c t i o n s ( s e l e c t u s i n g : continue ) :
0 : r e t r y t h e load o f l n a
1 : skip loading lna
2 : Abort e n t i r e l y from t h i s p r o c e s s .
[ 1 ] c l − u s e r ( 2 ) : : pop
c l − u s e r ( 3 ) : : cd . .
/ p r o j e c t s / s t n 2 /CVA/
cl−user ( 4 ) : : ld lan
E r r o r : ” l a n ” d o e s not e x i s t , cannot load
[ c o n d i t i o n ty pe : f i l e − d o e s − n o t − e x i s t − e r r o r ]
R e s t a r t a c t i o n s ( s e l e c t u s i n g : continue ) :
0 : r e t r y t h e load o f l a n
1 : skip loading lan
2 : Abort e n t i r e l y from t h i s p r o c e s s .
[ 1 ] c l − u s e r ( 5 ) : : pop
cl−user ( 6 ) : : ld lna
; Loading / p r o j e c t s / s t n 2 /CVA/ l n a . c l
;
Loading / p r o j e c t s / s n w i z / b i n / s n e p s . l i s p
Loading system SNePS...10% 20% 30% 40% 50% 60% 70% 80% 90% 100%
SNePS−2 . 6 [ PL : 0 a 2 0 0 2 / 0 9 / 3 0 2 2 : 3 7 : 4 6 ] l o a d e d .
Type ‘ ( s n e p s ) ’ or ‘ ( s n e p s l o g ) ’ t o get s t a r t e d .
;
Loading / p r o j e c t s / s t n 2 /CVA/ defun noun . c l
Welcome t o SNePS−2 . 6 [ PL : 0 a 2 0 0 2 / 0 9 / 3 0 2 2 : 3 7 : 4 6 ]
C o p y r i g h t ( C) 1984−−2002 by R e s e a r c h Foundation o f
S t a t e U n i v e r s i t y o f New York . SNePS comes with ABSOLUTELY NO WARRANTY!
Type ‘ ( c o p y r i g h t ) ’ f o r d e t a i l e d c o p y r i g h t i n f o r m a t i o n .
Type ‘ ( demo ) ’ f o r a l i s t o f example a p p l i c a t i o n s .
4/3/2003 15:36:51
∗ ( demo ”demos/ hackney . demo” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ hackney . demo i s now t h e s o u r c e o f i n p u t .
CPU time : 0 . 0 3
∗ ; ; ; R e s e t t h e network
( resetnet t )
Net r e s e t
CPU time : 0 . 0 2
∗
; ; ; Don ’ t t r a c e i n f e r
ˆ(
−−> s e t q s n i p : ∗ i n f e r t r a c e ∗ n i l )
nil
CPU time : 0 . 0 0
∗
; ; ; r e d e f i n e function to return n i l
; ; ; s o t h a t f o r w a r d i n f e r e n c e w i l l not be l i m i t e d
145
ˆ(
−−> defun br o a d ca s t− o n e− r ep o rt ( r e p )
( let ( anysent )
( do . c h s e t ( ch ∗OUTGOING−CHANNELS∗ a n y s e n t )
(when ( i s o p e n . ch ch )
( s e t q a n y s e n t ( or ( try−to−send−report r e p ch ) a n y s e n t ) ) ) ) )
nil )
br oa d ca s t− o n e − re p o r t
CPU time : 0 . 0 0
∗
; ; ; Load a l l v a l i d r e l a t i o n s
( demo ”/ p r o j e c t s / s t n 2 /CVA/demos/ r e l s ” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ r e l s i s now t h e s o u r c e o f i n p u t .
CPU time : 0 . 0 1
∗ ( d e f i n e a1 a2 a3 a4 a f t e r a g e n t antonym a s s o c i a t e d b e f o r e c a u s e
c l a s s d i r e c t i o n e q u i v e t i m e from i n i n d o b j i n s t r i n t o l e x l o c a t i o n
manner member mode o b j e c t on onto p a r t p l a c e p o s s e s s o r proper−name
p r o p e r t y r e l s k f s p − r e l s t i m e s u b c l a s s s u p e r c l a s s synonym time t o whole
kn cat )
( a1 a2 a3 a4 a f t e r a g e n t antonym a s s o c i a t e d b e f o r e c a u s e c l a s s d i r e c t i o n e q u i v
e t i m e from i n i n d o b j i n s t r i n t o l e x l o c a t i o n manner member mode o b j e c t on
onto p a r t p l a c e p o s s e s s o r proper−name p r o p e r t y r e l s k f s p − r e l s t i m e s u b c l a s s
s u p e r c l a s s synonym time t o whole k n c a t )
CPU time : 0 . 1 5
∗
End o f / p r o j e c t s / s t n 2 /CVA/demos/ r e l s d e m o n s t r a t i o n .
CPU time : 0 . 1 6
∗
; ; ; Compose p a t h s
( demo ”/ p r o j e c t s / s t n 2 /CVA/demos/ p a t h s ” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ p a t h s i s now t h e s o u r c e o f i n p u t .
CPU time : 0 . 0 1
∗ ; ; ; Composition o f c e r t a i n p a t h s
; ; ; Make B e f o r e T r a n s i t i v e
( d e f i n e − p a t h b e f o r e ( compose b e f o r e ( k s t a r ( compose a f t e r − ! b e f o r e ) ) ) )
b e f o r e i m p l i e d by t h e path ( compose b e f o r e ( k s t a r ( compose a f t e r − ! b e f o r e ) ) )
b e f or e − i m p l i e d by t h e path ( compose ( k s t a r ( compose be fo r e − ! a f t e r ) ) be f o r e − )
CPU time : 0 . 0 0
∗
; ; ; Make A f t e r T r a n s i t i v e
( d e f i n e − p a t h a f t e r ( compose a f t e r ( k s t a r ( compose b e fo r e − ! a f t e r ) ) ) )
146
a f t e r i m p l i e d by t h e path ( compose a f t e r ( k s t a r ( compose bef or e − ! a f t e r ) ) )
a f t e r − i m p l i e d by t h e path ( compose ( k s t a r ( compose a f t e r − ! b e f o r e ) ) a f t e r − )
CPU time : 0 . 0 1
∗
; ; I f X i s a member o f t h e c l a s s Y and Y i s a s u b c l a s s o f Z then
;;
X i s a member o f t h e c l a s s Z .
; ; Example :
I f Fido i s a b r a c h e t and a l l b r a c h e t s a r e hounds then
;;;
Fido i s a hound .
( d e f i n e − p a t h c l a s s ( compose c l a s s ( k s t a r ( compose s u b c l a s s − ! s u p e r c l a s s ) ) ) )
c l a s s i m p l i e d by t h e path ( compose c l a s s
( k s t a r ( compose s u b c l a s s − ! s u p e r c l a s s ) ) )
c l a s s − i m p l i e d by t h e path ( compose ( k s t a r ( compose s u p e r c l a s s − ! s u b c l a s s ) )
class− )
CPU time : 0 . 0 0
∗
; ; Make s u b c l a s s t r a n s i t i v e
( d e f i n e − p a t h s u b c l a s s ( compose s u b c l a s s ( k s t a r ( compose s u p e r c l a s s − ! s u b c l a s s ) ) ) )
s u b c l a s s i m p l i e d by t h e path ( compose s u b c l a s s
( k s t a r ( compose s u p e r c l a s s − ! s u b c l a s s ) ) )
s u b c l a s s − i m p l i e d by t h e path ( compose
( k s t a r ( compose s u b c l a s s − ! s u p e r c l a s s ) )
subclass− )
CPU time : 0 . 0 0
∗
; ; Make member move o v e r e q u i v a r c s
( d e f i n e − p a t h member ( compose member ( k s t a r ( compose equiv− ! e q u i v ) ) ) )
member i m p l i e d by t h e path ( compose member ( k s t a r ( compose equiv− ! e q u i v ) ) )
member− i m p l i e d by t h e path ( compose ( k s t a r ( compose equiv− ! e q u i v ) ) member−)
CPU time : 0 . 0 0
∗
End o f / p r o j e c t s / s t n 2 /CVA/demos/ p a t h s d e m o n s t r a t i o n .
CPU time : 0 . 0 2
∗
; ; ; Load Background Knowledge
( demo ”/ p r o j e c t s / s t n 2 /CVA/demos/ hackney . b a s e ” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ hackney . b a s e i s now t h e s o u r c e o f i n p u t .
CPU time : 0 . 0 0
∗ ; ; ; Knowledge Base f o r Hackney demo −− I n c l u d e s Knowledge Base p r e s e n t
; ; ; a t t h e b e g i n n i n g o f t h e Cat and Brachet demo
; ; ; Harts a r e d e e r
( describe
( ass er t s u b c l a s s ( b u i l d l e x ” h a r t ” )
s u p e r c l a s s ( build lex ” deer ” )
147
kn cat ” l i f e ” ))
(m3 ! ( k n c a t l i f e ) ( s u b c l a s s ( m1 ( l e x h a r t ) ) ) ( s u p e r c l a s s ( m2 ( l e x d e e r ) ) ) )
(m3 ! )
CPU time : 0 . 0 1
∗
; ; ; Halls are buildings
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” h a l l ” )
superclass ( build lex ” building ”)
kn cat ” l i f e ” ))
(m6 ! ( k n c a t l i f e ) ( s u b c l a s s ( m4 ( l e x h a l l ) ) ) ( s u p e r c l a s s ( m5 ( l e x b u i l d i n g ) ) ) )
(m6 ! )
CPU time : 0 . 0 2
∗
; ; ; Hounds a r e dogs
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ”hound” )
s u p e r c l a s s ( b u i l d l e x ” dog ” )
kn cat ” l i f e ” ))
(m9 ! ( k n c a t l i f e ) ( s u b c l a s s ( m7 ( l e x hound ) ) ) ( s u p e r c l a s s ( m8 ( l e x dog ) ) ) )
(m9 ! )
CPU time : 0 . 0 2
∗
; ; ; Dogs a r e mammals
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” dog ” )
s u p e r c l a s s ( b u i l d l e x ”mammal” )
kn cat ” l i f e ” ))
(m11 ! ( k n c a t l i f e ) ( s u b c l a s s ( m8 ( l e x dog ) ) ) ( s u p e r c l a s s ( m10 ( l e x mammal ) ) ) )
( m11 ! )
CPU time : 0 . 0 0
∗
; ; ; Dogs a r e quadrupeds
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” dog ” )
s u p e r c l a s s ( b u i l d l e x ” quadruped ” )
kn cat ” l i f e ” ))
(m13 ! ( k n c a t l i f e ) ( s u b c l a s s ( m8 ( l e x dog ) ) )
( s u p e r c l a s s ( m12 ( l e x quadruped ) ) ) )
( m13 ! )
148
CPU time : 0 . 0 0
∗
; ; ; Dogs a r e c a r n i v o r e s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” dog ” )
superclass ( build lex ” carnivore ”)
kn cat ” l i f e ” ))
(m15 ! ( k n c a t l i f e ) ( s u b c l a s s ( m8 ( l e x dog ) ) )
( s u p e r c l a s s ( m14 ( l e x c a r n i v o r e ) ) ) )
( m15 ! )
CPU time : 0 . 0 1
∗
; ; ; Dogs a r e p r e d a t o r s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” dog ” )
superclass ( build lex ” predator ” )
kn cat ” l i f e ” ))
(m17 ! ( k n c a t l i f e ) ( s u b c l a s s ( m8 ( l e x dog ) ) )
( s u p e r c l a s s ( m16 ( l e x p r e d a t o r ) ) ) )
( m17 ! )
CPU time : 0 . 0 1
∗
; ; ; Dogs a r e a n i m a l s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” dog ” )
s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
(m19 ! ( k n c a t l i f e ) ( s u b c l a s s ( m8 ( l e x dog ) ) ) ( s u p e r c l a s s ( m18 ( l e x animal ) ) ) )
( m19 ! )
CPU time : 0 . 0 1
∗
; ; ; Rex i s a dog
; ; ; ( E h r l i c h didn ’ t have a k n c a t a r c h e r e , must have l e f t o f f i n e r r o r )
; ; ; ( E h r l i c h n e v e r had an o b j e c t − proper−name c a s e frame f o r Rex )
( describe
( a sse r t member #Rex
c l a s s ( b u i l d l e x ” dog ” )
kn cat ” l i f e ” ))
(m20 ! ( c l a s s ( m8 ( l e x dog ) ) ) ( k n c a t l i f e ) ( member b1 ) )
( m20 ! )
149
CPU time : 0 . 0 0
∗
( describe
( as se r t o b j e c t ∗ Rex
proper−name ( b u i l d l e x ”Rex” )
kn cat ” l i f e ” ))
(m22 ! ( k n c a t l i f e ) ( o b j e c t b1 ) ( proper−name ( m21 ( l e x Rex ) ) ) )
( m22 ! )
CPU time : 0 . 0 2
∗
; ; ; Rex b e l o n g s t o a p e r s o n
; ; ; ( E h r l i c h n e v e r had a k n c a t a r c f o r p e r s o n , must have l e f t o f f i n e r r o r )
( describe
( a sse r t o b j e c t ∗ Rex
p o s s e s s o r #person1
r e l ( b u i l d l e x ” dog ” ) ) )
( m23 ! ( o b j e c t b1 ) ( p o s s e s s o r b2 ) ( r e l ( m8 ( l e x dog ) ) ) )
( m23 ! )
CPU time : 0 . 0 2
∗
( describe
( a sse r t member ∗ p e r s o n 1
c l a s s ( build lex ” person ” )
kn cat ” l i f e ” ))
(m25 ! ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( k n c a t l i f e ) ( member b2 ) )
( m25 ! )
CPU time : 0 . 0 1
∗
; ; ; Deer a r e mammals
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” d e e r ” )
s u p e r c l a s s ( b u i l d l e x ”mammal” )
kn cat ” l i f e ” ))
(m26 ! ( k n c a t l i f e ) ( s u b c l a s s ( m2 ( l e x d e e r ) ) ) ( s u p e r c l a s s ( m10 ( l e x mammal ) ) ) )
( m26 ! )
CPU time : 0 . 0 1
∗
; ; ; Deer a r e quadrupeds
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” d e e r ” )
150
s u p e r c l a s s ( b u i l d l e x ” quadruped ” )
kn cat ” l i f e ” ))
(m27 ! ( k n c a t l i f e ) ( s u b c l a s s ( m2 ( l e x d e e r ) ) )
( s u p e r c l a s s ( m12 ( l e x quadruped ) ) ) )
( m27 ! )
CPU time : 0 . 0 0
∗
; ; ; Deer a r e h e r b i v o r e s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” d e e r ” )
superclass ( build lex ” herbivore ”)
kn cat ” l i f e ” ))
(m29 ! ( k n c a t l i f e ) ( s u b c l a s s ( m2 ( l e x d e e r ) ) )
( s u p e r c l a s s ( m28 ( l e x h e r b i v o r e ) ) ) )
( m29 ! )
CPU time : 0 . 0 2
∗
; ; ; Carnivores are animals
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” c a r n i v o r e ” )
s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
(m30 ! ( k n c a t l i f e ) ( s u b c l a s s ( m14 ( l e x c a r n i v o r e ) ) )
( s u p e r c l a s s ( m18 ( l e x animal ) ) ) )
( m30 ! )
CPU time : 0 . 0 1
∗
; ; ; Predators are carnivores
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” p r e d a t o r ” )
superclass ( build lex ” carnivore ”)
kn cat ” l i f e ” ))
(m31 ! ( k n c a t l i f e ) ( s u b c l a s s ( m16 ( l e x p r e d a t o r ) ) )
( s u p e r c l a s s ( m14 ( l e x c a r n i v o r e ) ) ) )
( m31 ! )
CPU time : 0 . 0 1
∗
; ; ; ” H e r b i v o r e ” and ” c a r n i v o r e ” a r e antonyms
( describe
( as se r t antonym ( b u i l d l e x ” h e r b i v o r e ” )
antonym ( b u i l d l e x ” c a r n i v o r e ” ) ) )
151
( m32 ! ( antonym ( m28 ( l e x h e r b i v o r e ) ) ( m14 ( l e x c a r n i v o r e ) ) ) )
( m32 ! )
CPU time : 0 . 0 1
∗
; ; ; ” P r e d a t o r ” and ” c a r n i v o r e ” a r e antonyms
( describe
( a sse r t antonym ( b u i l d l e x ” p r e d a t o r ” )
antonym ( b u i l d l e x ” c a r n i v o r e ” ) ) )
( m33 ! ( antonym ( m16 ( l e x p r e d a t o r ) ) ( m14 ( l e x c a r n i v o r e ) ) ) )
( m33 ! )
CPU time : 0 . 0 0
∗
; ; ; Mammals a r e a n i m a l s
( describe
( as ser t s u b c l a s s ( b u i l d l e x ”mammal” )
s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
(m34 ! ( k n c a t l i f e ) ( s u b c l a s s ( m10 ( l e x mammal ) ) )
( s u p e r c l a s s ( m18 ( l e x animal ) ) ) )
( m34 ! )
CPU time : 0 . 0 1
∗
; ; ; Mammals a r e v e r t e b r a t e s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ”mammal” )
s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
(m34 ! ( k n c a t l i f e ) ( s u b c l a s s ( m10 ( l e x mammal ) ) )
( s u p e r c l a s s ( m18 ( l e x animal ) ) ) )
( m34 ! )
CPU time : 0 . 0 2
∗
; ; ; Quadrupeds a r e v e r t e b r a t e s
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” quadruped ” )
superclass ( build lex ” vertebrate ”)
kn cat ” l i f e ” ))
(m36 ! ( k n c a t l i f e ) ( s u b c l a s s ( m12 ( l e x quadruped ) ) )
( s u p e r c l a s s ( m35 ( l e x v e r t e b r a t e ) ) ) )
( m36 ! )
152
CPU time : 0 . 0 3
∗
; ; ; Animals a r e p h y s i c a l o b j e c t s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” animal ” )
s u p e r c l a s s ( b u i l d l e x ” phys o b j ” )
kn cat ” l i f e ” ))
(m38 ! ( k n c a t l i f e ) ( s u b c l a s s ( m18 ( l e x animal ) ) )
( s u p e r c l a s s ( m37 ( l e x phys o b j ) ) ) )
( m38 ! )
CPU time : 0 . 0 2
∗
; ; ; The Round Table i s a t a b l e
( describe
( as se r t member ( b u i l d l e x ”Round Table ” )
class ( build lex ” table ”)
kn cat ” l i f e ” ))
(m41 ! ( c l a s s ( m40 ( l e x t a b l e ) ) ) ( k n c a t l i f e ) ( member ( m39 ( l e x Round Table ) ) ) )
( m41 ! )
CPU time : 0 . 0 1
∗
; ; ; King Arthur i s a k i n g
( describe
( a sse r t o b j e c t #KA
proper−name ( b u i l d l e x ” King Arthur ” )
kn cat ” l i f e ” ))
(m43 ! ( k n c a t l i f e ) ( o b j e c t b3 ) ( proper−name ( m42 ( l e x King Arthur ) ) ) )
( m43 ! )
CPU time : 0 . 0 1
∗
( describe
( as se r t member ∗KA
c l a s s ( build lex ” king ” )
kn cat ” l i f e ” ))
(m45 ! ( c l a s s ( m44 ( l e x k i n g ) ) ) ( k n c a t l i f e ) ( member b3 ) )
( m45 ! )
CPU time : 0 . 0 0
∗
; ; ; The Round Table i s King Arthur ’ s t a b l e
( describe
153
( a sse r t o b j e c t ( b u i l d l e x ”Round Table ” )
p o s s e s s o r ∗KA
r e l ( build lex ” table ”)
kn cat ” l i f e ” ))
(m46 ! ( k n c a t l i f e ) ( o b j e c t ( m39 ( l e x Round Table ) ) ) ( p o s s e s s o r b3 )
( r e l ( m40 ( l e x t a b l e ) ) ) )
( m46 ! )
CPU time : 0 . 0 0
∗
; ; ; E x c a l i b u r i s a sword
( describe
( as se r t o b j e c t # Excal
proper−name ( b u i l d l e x ” E x c a l i b u r ” )
kn cat ” l i f e ” ))
(m48 ! ( k n c a t l i f e ) ( o b j e c t b4 ) ( proper−name ( m47 ( l e x E x c a l i b u r ) ) ) )
( m48 ! )
CPU time : 0 . 0 1
∗
( describe
( as se r t member ∗ Excal
c l a s s ( b u i l d l e x ” sword ” )
kn cat ” l i f e ” ))
(m50 ! ( c l a s s ( m49 ( l e x sword ) ) ) ( k n c a t l i f e ) ( member b4 ) )
( m50 ! )
CPU time : 0 . 0 1
∗
; ; ; E x c a l i b u r i s King Arthur ’ s sword
( describe
( a sse r t o b j e c t ∗ Excal
p o s s e s s o r ∗KA
r e l ( b u i l d l e x ” sword ” )
kn cat ” l i f e ” ))
(m51 ! ( k n c a t l i f e ) ( o b j e c t b4 ) ( p o s s e s s o r b3 ) ( r e l ( m49 ( l e x sword ) ) ) )
( m51 ! )
CPU time : 0 . 0 0
∗
; ; ; Merlin i s a wizard
( describe
( as se r t o b j e c t #Mer
proper−name ( b u i l d l e x ” M e r l i n ” )
kn cat ” l i f e ” ))
154
( m53 ! ( k n c a t l i f e ) ( o b j e c t b5 ) ( proper−name ( m52 ( l e x M e r l i n ) ) ) )
( m53 ! )
CPU time : 0 . 0 1
∗
( describe
( as se r t member ∗ Mer
c l a s s ( build l e x ” wizard ” )
kn cat ” l i f e ” ))
(m55 ! ( c l a s s ( m54 ( l e x w i z a r d ) ) ) ( k n c a t l i f e ) ( member b5 ) )
( m55 ! )
CPU time : 0 . 0 1
∗
; ; ; Wizards a r e p e r s o n s
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” w i z a r d ” )
s u p e r c l a s s ( build lex ” person ” )
kn cat ” l i f e ” ))
(m56 ! ( k n c a t l i f e ) ( s u b c l a s s ( m54 ( l e x w i z a r d ) ) )
( s u p e r c l a s s ( m24 ( l e x p e r s o n ) ) ) )
( m56 ! )
CPU time : 0 . 0 1
∗
; ; ; King Ban i s a k i n g
( describe
( as s ert o b j e c t #KingBan
proper−name ( b u i l d l e x ” King Ban” )
kn cat ” l i f e ” ))
(m58 ! ( k n c a t l i f e ) ( o b j e c t b6 ) ( proper−name ( m57 ( l e x King Ban ) ) ) )
( m58 ! )
CPU time : 0 . 0 1
∗
( describe
( as se r t member ∗ KingBan
c l a s s ( build lex ” king ” )
kn cat ” l i f e ” ))
(m59 ! ( c l a s s ( m44 ( l e x k i n g ) ) ) ( k n c a t l i f e ) ( member b6 ) )
( m59 ! )
CPU time : 0 . 0 2
155
∗
; ; ; King Bors i s a k i n g
( describe
( as se r t o b j e c t #KingBors
proper−name ( b u i l d l e x ” King Bors ” )
kn cat ” l i f e ” ))
(m61 ! ( k n c a t l i f e ) ( o b j e c t b7 ) ( proper−name ( m60 ( l e x King Bors ) ) ) )
( m61 ! )
CPU time : 0 . 0 1
∗
( describe
( a sse r t member ∗ KingBors
c l a s s ( build lex ” king ” )
kn cat ” l i f e ” ))
(m62 ! ( c l a s s ( m44 ( l e x k i n g ) ) ) ( k n c a t l i f e ) ( member b7 ) )
( m62 ! )
CPU time : 0 . 0 1
∗
; ; ; King Lot i s a k i n g
( describe
( a sse r t o b j e c t #KingLot
proper−name ( b u i l d l e x ” King Lot ” )
kn cat ” l i f e ” ))
(m64 ! ( k n c a t l i f e ) ( o b j e c t b8 ) ( proper−name ( m63 ( l e x King Lot ) ) ) )
( m64 ! )
CPU time : 0 . 0 2
∗
( describe
( as se r t member ∗ KingLot
c l a s s ( build lex ” king ” )
kn cat ” l i f e ” ))
(m65 ! ( c l a s s ( m44 ( l e x k i n g ) ) ) ( k n c a t l i f e ) ( member b8 ) )
( m65 ! )
CPU time : 0 . 0 1
∗
; ; ; S i r Galahad i s a k n i g h t
( describe
( a sse r t o b j e c t # S i r G a l
proper−name ( b u i l d l e x ” S i r Galahad ” )
156
kn cat ” l i f e ” ))
(m67 ! ( k n c a t l i f e ) ( o b j e c t b9 ) ( proper−name ( m66 ( l e x S i r Galahad ) ) ) )
( m67 ! )
CPU time : 0 . 0 1
∗
( describe
( a sse r t member ∗ S i r G a l
c l a s s ( build lex ” knight ” )
kn cat ” l i f e ” ))
(m69 ! ( c l a s s ( m68 ( l e x k n i g h t ) ) ) ( k n c a t l i f e ) ( member b9 ) )
( m69 ! )
CPU time : 0 . 0 1
∗
; ; ; S i r Gawain i s a k n i g h t
( describe
( a sse r t o b j e c t #SG
proper−name ( b u i l d l e x ” S i r Gawain” )
kn cat ” l i f e ” ))
(m71 ! ( k n c a t l i f e ) ( o b j e c t b10 ) ( proper−name ( m70 ( l e x S i r Gawain ) ) ) )
( m71 ! )
CPU time : 0 . 0 2
∗
( describe
( as se r t member ∗SG
c l a s s ( build lex ” knight ” )
kn cat ” l i f e ” ))
(m72 ! ( c l a s s ( m68 ( l e x k n i g h t ) ) ) ( k n c a t l i f e ) ( member b10 ) )
( m72 ! )
CPU time : 0 . 0 1
∗
; ; ; S i r Tristram i s a knight
( describe
( a sse r t o b j e c t # T r i s
proper−name ( b u i l d l e x ” S i r T r i s t r a m ” )
kn cat ” l i f e ” ))
(m74 ! ( k n c a t l i f e ) ( o b j e c t b11 ) ( proper−name ( m73 ( l e x S i r T r i s t r a m ) ) ) )
( m74 ! )
157
CPU time : 0 . 0 0
∗
( describe
( as se r t member ∗ T r i s
c l a s s ( build lex ” knight ” )
kn cat ” l i f e ” ))
(m75 ! ( c l a s s ( m68 ( l e x k n i g h t ) ) ) ( k n c a t l i f e ) ( member b11 ) )
( m75 ! )
CPU time : 0 . 0 1
∗
; ; ; Sideboards are f u r n i t u r e
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” s i d e b o a r d ” )
superclass ( build lex ” furniture ”)
kn cat ” l i f e ” ))
(m78 ! ( k n c a t l i f e ) ( s u b c l a s s ( m76 ( l e x s i d e b o a r d ) ) )
( s u p e r c l a s s ( m77 ( l e x f u r n i t u r e ) ) ) )
( m78 ! )
CPU time : 0 . 0 1
∗
; ; ; Tables are f u r n i t u r e
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” t a b l e ” )
superclass ( build lex ” furniture ”)
kn cat ” l i f e ” ))
(m79 ! ( k n c a t l i f e ) ( s u b c l a s s ( m40 ( l e x t a b l e ) ) )
( s u p e r c l a s s ( m77 ( l e x f u r n i t u r e ) ) ) )
( m79 ! )
CPU time : 0 . 0 0
∗
; ; ; Chairs are f u r n i t u r e
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” c h a i r ” )
superclass ( build lex ” furniture ”)
kn cat ” l i f e ” ))
(m81 ! ( k n c a t l i f e ) ( s u b c l a s s ( m80 ( l e x c h a i r ) ) )
( s u p e r c l a s s ( m77 ( l e x f u r n i t u r e ) ) ) )
( m81 ! )
CPU time : 0 . 0 1
∗
158
; ; ; H o r s e s a r e quadrupeds
( describe
( ass er t s u b c l a s s ( b u i l d l e x ” h o r s e ” )
s u p e r c l a s s ( b u i l d l e x ” quadruped ” )
kn cat ” l i f e ” ))
(m83 ! ( k n c a t l i f e ) ( s u b c l a s s ( m82 ( l e x h o r s e ) ) )
( s u p e r c l a s s ( m12 ( l e x quadruped ) ) ) )
( m83 ! )
CPU time : 0 . 0 1
∗
; ; ; Horses are h e r b i v o r e s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” h o r s e ” )
superclass ( build lex ” herbivore ”)
kn cat ” l i f e ” ))
(m84 ! ( k n c a t l i f e ) ( s u b c l a s s ( m82 ( l e x h o r s e ) ) )
( s u p e r c l a s s ( m28 ( l e x h e r b i v o r e ) ) ) )
( m84 ! )
CPU time : 0 . 0 1
∗
; ; ; Ungulates are h e r b i v o r e s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” u n g u l a t e ” )
superclass ( build lex ” herbivore ”)
kn cat ” l i f e ” ))
(m86 ! ( k n c a t l i f e ) ( s u b c l a s s ( m85 ( l e x u n g u l a t e ) ) )
( s u p e r c l a s s ( m28 ( l e x h e r b i v o r e ) ) ) )
( m86 ! )
CPU time : 0 . 0 0
∗
; ; ; Horses are animals
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” h o r s e ” )
s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
(m87 ! ( k n c a t l i f e ) ( s u b c l a s s ( m82 ( l e x h o r s e ) ) )
( s u p e r c l a s s ( m18 ( l e x animal ) ) ) )
( m87 ! )
CPU time : 0 . 0 1
∗
; ; ; Knights a r e p e r s o n s
( describe
159
( a sse r t s u b c l a s s ( b u i l d l e x ” k n i g h t ” )
s u p e r c l a s s ( build lex ” person ” )
kn cat ” l i f e ” ))
(m88 ! ( k n c a t l i f e ) ( s u b c l a s s ( m68 ( l e x k n i g h t ) ) )
( s u p e r c l a s s ( m24 ( l e x p e r s o n ) ) ) )
( m88 ! )
CPU time : 0 . 0 1
∗
; ; ; ” Person ” i s a b a s i c − l e v e l c a t e g o r y
( describe
( as s ert member ( b u i l d l e x ” p e r s o n ” )
c l a s s ( build lex ” bas ic ctgy ” )
kn cat ” l i f e ” ))
(m90 ! ( c l a s s ( m89 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m24 ( l e x p e r s o n ) ) ) )
( m90 ! )
CPU time : 0 . 0 1
∗
; ; ; ”Dog ” i s a b a s i c − l e v e l c a t e g o r y
( describe
( a sse r t member ( b u i l d l e x ” dog ” )
c l a s s ( build lex ” bas ic ctgy ” )
kn cat ” l i f e ” ))
(m91 ! ( c l a s s ( m89 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m8 ( l e x dog ) ) ) )
( m91 ! )
CPU time : 0 . 0 1
∗
; ; ; ” Horse ” i s a b a s i c − l e v e l c a t e g o r y
( describe
( a sse r t member ( b u i l d l e x ” h o r s e ” )
c l a s s ( build lex ” bas ic ctgy ” )
kn cat ” l i f e ” ))
(m92 ! ( c l a s s ( m89 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m82 ( l e x h o r s e ) ) ) )
( m92 ! )
CPU time : 0 . 0 1
∗
; ; ; ” Deer ” i s a b a s i c − l e v e l c a t e g o r y
( describe
( a sse r t member ( b u i l d l e x ” d e e r ” )
160
c l a s s ( build lex ” bas ic ctgy ” )
kn cat ” l i f e ” ))
(m93 ! ( c l a s s ( m89 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m2 ( l e x d e e r ) ) ) )
( m93 ! )
CPU time : 0 . 0 1
∗
; ; ; ” Chair ” i s a b a s i c − l e v e l c a t e g o r y
( describe
( a sse r t member ( b u i l d l e x ” c h a i r ” )
c l a s s ( build lex ” bas ic ctgy ” )
kn cat ” l i f e ” ))
(m94 ! ( c l a s s ( m89 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m80 ( l e x c h a i r ) ) ) )
( m94 ! )
CPU time : 0 . 0 1
∗
; ; ; ” Table ” i s a b a s i c − l e v e l c a t e g o r y
( describe
( a sse r t member ( b u i l d l e x ” t a b l e ” )
c l a s s ( build lex ” bas ic ctgy ” )
kn cat ” l i f e ” ))
(m95 ! ( c l a s s ( m89 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m40 ( l e x t a b l e ) ) ) )
( m95 ! )
CPU time : 0 . 0 0
∗
; ; ; White i s a c o l o r
( describe
( a sse r t member ( b u i l d l e x ” w h i t e ” )
class ( build lex ” color ”)
kn cat ” l i f e ” ))
(m98 ! ( c l a s s ( m97 ( l e x c o l o r ) ) ) ( k n c a t l i f e ) ( member ( m96 ( l e x w h i t e ) ) ) )
( m98 ! )
CPU time : 0 . 0 1
∗
; ; ; Black i s a c o l o r
( describe
( a sse r t member ( b u i l d l e x ” b l a c k ” )
class ( build lex ” color ”)
kn cat ” l i f e ” ))
( m100 ! ( c l a s s ( m97 ( l e x c o l o r ) ) ) ( k n c a t l i f e ) ( member ( m99 ( l e x b l a c k ) ) ) )
161
( m100 ! )
CPU time : 0 . 0 1
∗
; ; ; Small i s a s i z e
( describe
( a sse r t member ( b u i l d l e x ” s m a l l ” )
class ( build lex ” s ize ”)
kn cat ” l i f e ” ))
( m103 ! ( c l a s s ( m102 ( l e x s i z e ) ) ) ( k n c a t l i f e ) ( member ( m101 ( l e x s m a l l ) ) ) )
( m103 ! )
CPU time : 0 . 0 2
∗
; ; ; ” Small ” and ” l i t t l e ” a r e synonyms
( describe
( a sse r t synonym ( b u i l d l e x ” s m a l l ” )
synonym ( b u i l d l e x ” l i t t l e ” )
kn cat ” l i f e ” ))
( m105 ! ( k n c a t l i f e ) ( synonym ( m104 ( l e x l i t t l e ) ) ( m101 ( l e x s m a l l ) ) ) )
( m105 ! )
CPU time : 0 . 0 1
∗
; ; ; Large i s a s i z e
( describe
( a ss er t member ( b u i l d l e x ” l a r g e ” )
class ( build lex ” s ize ”)
kn cat ” l i f e ” ))
( m107 ! ( c l a s s ( m102 ( l e x s i z e ) ) ) ( k n c a t l i f e ) ( member ( m106 ( l e x l a r g e ) ) ) )
( m107 ! )
CPU time : 0 . 0 3
∗
; ; ; ” Large ” and ” b i g ” a r e synonyms
( describe
( a sse r t synonym ( b u i l d l e x ” l a r g e ” )
synonym ( b u i l d l e x ” b i g ” )
kn cat ” l i f e ” ))
( m109 ! ( k n c a t l i f e ) ( synonym ( m108 ( l e x b i g ) ) ( m106 ( l e x l a r g e ) ) ) )
( m109 ! )
CPU time : 0 . 0 1
∗
162
; ; ; Good i s a v a l u e
( describe
( ass er t member ( b u i l d l e x ” good ” )
c l a s s ( build lex ” value ” )
kn cat ” l i f e ” ))
( m112 ! ( c l a s s ( m111 ( l e x v a l u e ) ) ) ( k n c a t l i f e ) ( member ( m110 ( l e x good ) ) ) )
( m112 ! )
CPU time : 0 . 0 4
∗
; ; ; Bad i s a v a l u e
( describe
( a sse r t member ( b u i l d l e x ” bad ” )
c l a s s ( build lex ” value ” )
kn cat ” l i f e ” ))
( m114 ! ( c l a s s ( m111 ( l e x v a l u e ) ) ) ( k n c a t l i f e ) ( member ( m113 ( l e x bad ) ) ) )
( m114 ! )
CPU time : 0 . 0 1
∗
; ; ; I f x i s a h o r s e , then presumably t h e r e i s a p e r s o n , y , such t h a t t h e
;;;
f u n c t i o n o f x i s t o be r i d d e n by y
( describe
( a sse r t f o r a l l $ h o r s e 1
ant ( b u i l d member ∗ h o r s e 1 c l a s s ( b u i l d l e x ” h o r s e ” ) )
cq ( ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d member ( b u i l d s k f ” r i d e r − o f ”
a2 ∗ h o r s e 1 ) = t h i s r i d e r
c l a s s ( build lex ” person ” ) ) )
( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( build agent ∗ t h i s r i d e r
act ( build action ( build lex ” ride ” )
object ∗ horse1 ) ) ) )
kn cat ” l i f e − r u l e .1” ))
( m117 ! ( f o r a l l v1 ) ( ant ( p1 ( c l a s s ( m82 ( l e x h o r s e ) ) ) ( member v1 ) ) )
( cq
( p7 ( mode ( m115 ( l e x presumably ) ) )
( object
( p6 ( a c t ( p5 ( a c t i o n ( m116 ( l e x r i d e ) ) ) ( o b j e c t v1 ) ) )
( a g e n t ( p2 ( a2 v1 ) ( s k f r i d e r − o f ) ) ) ) ) )
( p4 ( mode ( m115 ) ) ( o b j e c t ( p3 ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member ( p2 ) ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m117 ! )
CPU time : 0 . 0 4
∗
;;;
;;;
I f a r i d e r r i d e s an animal t h a t b e l o n g s t o some c l a s s , then t h a t c l a s s i s
a subclass of equine
163
( describe
( a sse r t f o r a l l ( $v2 $v3 )
&ant ( ( b u i l d member ∗ v2
c l a s s ( b u i l d l e x ” animal ” ) )
( b u i l d member ∗ v2
c l a s s ∗ v3 )
( b u i l d member ( b u i l d a2 ∗ v2
skf ” rider−of ”)
c l a s s ( build lex ” person ” ))
( b u i l d a g e n t ( b u i l d a2 ∗ v2
skf ” rider−of ”)
act ( build action ( build lex ” ride ” )
o b j e c t ∗ v2 ) ) )
cq ( b u i l d s u b c l a s s ∗ v3
s u p e r c l a s s ( build lex ” equine ” ))
kn cat ” l i f e − r u l e .1” ))
( m119 ! ( f o r a l l v3 v2 )
(& ant
( p13 ( a c t ( p12 ( a c t i o n ( m116 ( l e x r i d e ) ) ) ( o b j e c t v2 ) ) )
( a g e n t ( p10 ( a2 v2 ) ( s k f r i d e r − o f ) ) ) )
( p11 ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member ( p10 ) ) ) ( p9 ( c l a s s v3 ) ( member v2 ) )
( p8 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v2 ) ) )
( cq ( p14 ( s u b c l a s s v3 ) ( s u p e r c l a s s ( m118 ( l e x e q u i n e ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m119 ! )
CPU time : 0 . 0 3
∗
; ; ; I f x i s an animal and a member o f some o t h e r named c l a s s y , and i f
; ; ; t h e r e i s a z t h a t r i d e s x , then y i s a s u b c l a s s o f ” e q u i n e ”
( describe
( ass ert f o r a l l ( ∗ v2 $v39 )
&ant ( ( b u i l d member ∗ v2
c l a s s ( b u i l d l e x ” animal ” ) )
( b u i l d member ∗ v2
c l a s s ∗ v39 )
( b u i l d a g e n t ( b u i l d a2 ∗ v2
skf ” rider−of ”)
act ( build action ( build lex ” ride ” )
o b j e c t ∗ v2 ) ) )
cq ( b u i l d s u b c l a s s ∗ v39
s u p e r c l a s s ( build lex ” equine ” ))
kn cat ” l i f e − r u l e .1” ))
( m120 ! ( f o r a l l v4 v2 )
(& ant ( p15 ( c l a s s v4 ) ( member v2 ) )
( p13 ( a c t ( p12 ( a c t i o n ( m116 ( l e x r i d e ) ) ) ( o b j e c t v2 ) ) )
( a g e n t ( p10 ( a2 v2 ) ( s k f r i d e r − o f ) ) ) )
( p8 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v2 ) ) )
( cq ( p16 ( s u b c l a s s v4 ) ( s u p e r c l a s s ( m118 ( l e x e q u i n e ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
164
( m120 ! )
CPU time : 0 . 0 2
∗
;;;
I f something b i t e s , then i t ’ s an animal
( describe
( a sse r t f o r a l l $v5
ant ( b u i l d a c t ( b u i l d a c t i o n ( b u i l d l e x ” b i t e ” ) )
a g e n t ∗ v5 )
cq ( b u i l d member ∗ v5
c l a s s ( b u i l d l e x ” animal ” ) )
kn cat ” l i f e − r u l e .1” ))
( m123 ! ( f o r a l l v5 )
( ant ( p17 ( a c t ( m122 ( a c t i o n ( m121 ( l e x b i t e ) ) ) ) ) ( a g e n t v5 ) ) )
( cq ( p18 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v5 ) ) ) ( k n c a t l i f e − r u l e . 1 ) )
( m123 ! )
CPU time : 0 . 0 1
∗
;;;
I f something s l e e p s , then i t ’ s an animal
( describe
( assert f o r a l l ∗ v5
ant ( b u i l d a c t ( b u i l d a c t i o n ( b u i l d l e x ” s l e e p ” ) )
a g e n t ∗ v5 )
cq ( b u i l d member ∗ v5
c l a s s ( b u i l d l e x ” animal ” ) )
kn cat ” l i f e − r u l e .1” ))
( m126 ! ( f o r a l l v5 )
( ant ( p19 ( a c t ( m125 ( a c t i o n ( m124 ( l e x sleep ) ) ) ) ) ( a g e n t v5 ) ) )
( cq ( p18 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v5 ) ) ) ( k n c a t l i f e − r u l e . 1 ) )
( m126 ! )
CPU time : 0 . 0 2
∗
;;;
I f something ambles , then i t ’ s an animal
( describe
( assert f o r a l l ∗ v5
ant ( b u i l d p r o p e r t y ( b u i l d l e x ” ambling ” )
o b j e c t ∗ v5 )
cq ( b u i l d member ∗ v5
c l a s s ( b u i l d l e x ” animal ” ) )
kn cat ” l i f e − r u l e .1” ))
( m128 ! ( f o r a l l v5 ) ( ant ( p20 ( o b j e c t v5 ) ( p r o p e r t y ( m127 ( l e x ambling ) ) ) ) )
( cq ( p18 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v5 ) ) ) ( k n c a t l i f e − r u l e . 1 ) )
( m128 ! )
165
CPU time : 0 . 0 1
∗
;;;
;;;
I f something i s an animal and a member o f a n o t h e r c l a s s , then t h a t c l a s s
i s a s u b c l a s s o f animal
( describe
( as se r t f o r a l l ( ∗ v5 $v6 )
&ant ( ( b u i l d member ∗ v5
c l a s s ( b u i l d l e x ” animal ” ) )
( b u i l d member ∗ v5
c l a s s ∗ v6 ) )
cq ( b u i l d s u b c l a s s ∗ v6
s u p e r c l a s s ( b u i l d l e x ” animal ” ) )
kn cat ” l i f e − r u l e .1” ))
( m129 ! ( f o r a l l v6 v5 )
(& ant ( p21 ( c l a s s v6 ) ( member v5 ) )
( p18 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v5 ) ) )
( cq ( p22 ( s u b c l a s s v6 ) ( s u p e r c l a s s ( m18 ) ) ) ) ( k n c a t l i f e − r u l e . 1 ) )
( m129 ! )
CPU time : 0 . 0 0
∗
;;;
;;;
I f something i s presumed t o be an animal and a member o f a n o t h e r c l a s s ,
then presumably t h a t c l a s s i s a s u b c l a s s o f animal
( describe
( asse r t f o r a l l ( ∗ v5 ∗ v6 )
&ant ( ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d member ∗ v5
c l a s s ( b u i l d l e x ” animal ” ) ) )
( b u i l d member ∗ v5
c l a s s ∗ v6 ) )
cq ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d s u b c l a s s ∗ v6
s u p e r c l a s s ( b u i l d l e x ” animal ” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m130 ! ( f o r a l l v6 v5 )
(& ant
( p23 ( mode ( m115 ( l e x presumably ) ) )
( o b j e c t ( p18 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v5 ) ) ) )
( p21 ( c l a s s v6 ) ( member v5 ) ) )
( cq ( p24 ( mode ( m115 ) ) ( o b j e c t ( p22 ( s u b c l a s s v6 ) ( s u p e r c l a s s ( m18 ) ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m130 ! )
CPU time : 0 . 0 2
∗
;;;
;;;
I f something i s a mammal and a member o f a n o t h e r ( n o n − s u p e r o r d i n a t e ) c l a s s ,
then t h a t c l a s s i s a s u b c l a s s o f mammal
( describe
166
( a sse r t f o r a l l ( ∗ v5 ∗ v6 )
&ant ( ( b u i l d member ∗ v5
c l a s s ∗ v6 )
( b u i l d member ∗ v5
c l a s s ( b u i l d l e x ”mammal” )
))
cq ( ( b u i l d s u b c l a s s ∗ v6
s u p e r c l a s s ( b u i l d l e x ” animal ” ) )
( b u i l d s u b c l a s s ∗ v6
s u p e r c l a s s ( b u i l d l e x ”mammal” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m131 ! ( f o r a l l v6 v5 )
(& ant ( p25 ( c l a s s ( m10 ( l e x mammal ) ) ) ( member v5 ) )
( p21 ( c l a s s v6 ) ( member v5 ) ) )
( cq ( p26 ( s u b c l a s s v6 ) ( s u p e r c l a s s ( m10 ) ) )
( p22 ( s u b c l a s s v6 ) ( s u p e r c l a s s ( m18 ( l e x animal ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m131 ! )
CPU time : 0 . 0 2
∗
;;;
I f a p e r s o n can c a r r y an o b j e c t , then t h a t o b j e c t i s s m a l l
( describe
( ass ert f o r a l l ( $v13 ∗ v9 )
&ant ( ( b u i l d member ∗ v9
c l a s s ( build lex ” person ” ))
( b u i l d a g e n t ∗ v9
act ( build action ( build lex ” carry ” )
o b j e c t ∗ v13 ) ) )
cq ( b u i l d o b j e c t ∗ v13
property ( build lex ” small ” ))
kn cat ” l i f e − r u l e .2” ))
( m134 ! ( f o r a l l v7 )
(& ant ( p28 ( a c t ( p27 ( a c t i o n ( m133 ( l e x c a r r y ) ) ) ( o b j e c t v7 ) ) ) )
( m132 ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ) )
( cq ( p29 ( o b j e c t v7 ) ( p r o p e r t y ( m101 ( l e x s m a l l ) ) ) ) ) ( k n c a t l i f e − r u l e . 2 ) )
( m134 ! )
CPU time : 0 . 0 2
∗
; ; ; I f a p e r s o n wants something , then i t i s v a l u a b l e
; ; ; ( E h r l i c h doesn ’ t mention t h a t ∗ v9 must be a p e r s o n , s o I modify i t )
( describe
( assert f o r a l l ( ∗ v13 ∗ v9 )
ant ( b u i l d a g e n t ∗ v9
a c t ( b u i l d a c t i o n ( b u i l d l e x ”want” )
o b j e c t ∗ v13 ) )
cq ( b u i l d o b j e c t ∗ v13
property ( build lex ” valuable ” ))
kn cat ” l i f e − r u l e .2” ))
167
( m137 ! ( f o r a l l v7 )
( ant ( p31 ( a c t ( p30 ( a c t i o n ( m135 ( l e x want ) ) ) ( o b j e c t v7 ) ) ) ) )
( cq ( p32 ( o b j e c t v7 ) ( p r o p e r t y ( m136 ( l e x v a l u a b l e ) ) ) ) ) ( k n c a t l i f e − r u l e . 2 ) )
( m137 ! )
CPU time : 0 . 0 1
∗
; ; ; I f someone s a y s they want something , then they do
( describe
( assert f o r a l l ( $ t h i n g y $ p e r s o n )
ant ( b u i l d a g e n t ∗ p e r s o n a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( build agent ∗ person
a c t ( b u i l d a c t i o n ( b u i l d l e x ”want” )
object ∗ thingy ) ) ) )
cq ( b u i l d a g e n t ∗ p e r s o n
a c t ( b u i l d a c t i o n ( b u i l d l e x ”want” )
object ∗ thingy ))
kn cat ” l i f e − r u l e .2” ))
( m139 ! ( f o r a l l v9 v8 )
( ant
( p36
( a c t ( p35 ( a c t i o n ( m138 ( l e x say t h a t ) ) )
( object
( p34 ( a c t ( p33 ( a c t i o n ( m135 ( l e x want ) ) ) ( o b j e c t v8 ) ) )
( a g e n t v9 ) ) ) ) )
( a g e n t v9 ) ) )
( cq ( p34 ) ) ( k n c a t l i f e − r u l e . 2 ) )
( m139 ! )
CPU time : 0 . 0 3
∗
;;;
;;;
I f something has c o l o r and b e l o n g s t o some c l a s s , then t h a t c l a s s i s a
subclass of physical object
( describe
( a s s e r t f o r a l l ( $v14 $v15 $v16 )
&ant ( ( b u i l d member ∗ v15
class ( build lex ” color ” ))
( b u i l d o b j e c t ∗ v16
p r o p e r t y ∗ v15 )
( b u i l d member ∗ v16
c l a s s ∗ v14 ) )
cq ( b u i l d s u b c l a s s ∗ v14
s u p e r c l a s s ( b u i l d l e x ” phys o b j ” ) )
kn cat ” i n t r i n s i c ” ))
( m140 ! ( f o r a l l v12 v11 v10 )
(& ant ( p39 ( c l a s s v10 ) ( member v12 ) ) ( p38 ( o b j e c t v12 ) ( p r o p e r t y v11 ) )
( p37 ( c l a s s ( m97 ( l e x c o l o r ) ) ) ( member v11 ) ) )
( cq ( p40 ( s u b c l a s s v10 ) ( s u p e r c l a s s ( m37 ( l e x phys o b j ) ) ) ) )
( kn cat i n t r i n s i c ))
168
( m140 ! )
CPU time : 0 . 0 3
∗
;;;
;;;
I f something has s i z e and b e l o n g s t o some c l a s s , then t h a t c l a s s i s a
subclass of physical object
( describe
( a sse r t f o r a l l ( ∗ v14 ∗ v15 $v17 )
&ant ( ( b u i l d member ∗ v15
class ( build lex ” s ize ” ))
( b u i l d member ∗ v17
c l a s s ∗ v14 )
( b u i l d o b j e c t ∗ v17
p r o p e r t y ∗ v15 ) )
cq ( b u i l d s u b c l a s s ∗ v14
s u p e r c l a s s ( b u i l d l e x ” phys o b j ” ) )
kn cat ” i n t r i n s i c ” ))
( m141 ! ( f o r a l l v13 v11 v10 )
(& ant ( p43 ( o b j e c t v13 ) ( p r o p e r t y v11 ) ) ( p42 ( c l a s s v10 ) ( member v13 ) )
( p41 ( c l a s s ( m102 ( l e x s i z e ) ) ) ( member v11 ) ) )
( cq ( p40 ( s u b c l a s s v10 ) ( s u p e r c l a s s ( m37 ( l e x phys o b j ) ) ) ) )
( kn cat i n t r i n s i c ))
( m141 ! )
CPU time : 0 . 0 2
∗
;;;
;;;
I f a member o f some c l a s s has a p r o p e r t y , then i t i s p o s s i b l e f o r o t h e r
members o f t h a t c l a s s t o have t h a t p r o p e r t y
( describe
( a ss er t f o r a l l ( ∗ v14 ∗ v15 ∗ v17 $v18 )
&ant ( ( b u i l d o b j e c t ∗ v17
p r o p e r t y ∗ v15 )
( b u i l d member ∗ v17
c l a s s ∗ v14 )
( b u i l d member ∗ v18
c l a s s ∗ v14 ) )
cq ( b u i l d mode ( b u i l d l e x ” p o s s i b l y ” )
o b j e c t ( b u i l d o b j e c t ∗ v18
p r o p e r t y ∗ v15 ) )
kn cat ” l i f e − r u l e .1” ))
( m143 ! ( f o r a l l v14 v13 v11 v10 )
(& ant ( p44 ( c l a s s v10 ) ( member v14 ) ) ( p43 ( o b j e c t v13 ) ( p r o p e r t y v11 ) )
( p42 ( c l a s s v10 ) ( member v13 ) ) )
( cq
( p46 ( mode ( m142 ( l e x p o s s i b l y ) ) )
( o b j e c t ( p45 ( o b j e c t v14 ) ( p r o p e r t y v11 ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m143 ! )
CPU time : 0 . 0 3
169
∗
;;;
I f an animal a c t s , then t h e a c t pe r f o r m e d i s an a c t i o n
( describe
( as se r t f o r a l l ( $v19 $v20 )
&ant ( ( b u i l d member ∗ v20
c l a s s ( b u i l d l e x ” animal ” ) )
( b u i l d a c t ( b u i l d a c t i o n ∗ v19 )
a g e n t ∗ v20 ) )
cq ( b u i l d member ∗ v19
class ( build lex ” action ” ))
kn cat ” i n t r i n s i c ” ))
( m145 ! ( f o r a l l v16 v15 )
(& ant ( p49 ( a c t ( p48 ( a c t i o n v15 ) ) ) ( a g e n t v16 ) )
( p47 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v16 ) ) )
( cq ( p50 ( c l a s s ( m144 ( l e x a c t i o n ) ) ) ( member v15 ) ) ) ( k n c a t i n t r i n s i c ) )
( m145 ! )
CPU time : 0 . 0 3
∗
;;;
I f a p e r s o n a c t s , then t h e a c t p er f o r m e d i s an a c t i o n
( describe
( assert f o r a l l ( $v21 $v22 )
&ant ( ( b u i l d member ∗ v22
c l a s s ( build lex ” person ” ))
( b u i l d a c t ( b u i l d a c t i o n ∗ v21 )
a g e n t ∗ v22 ) )
cq ( b u i l d member ∗ v21
class ( build lex ” action ” ))
kn cat ” i n t r i n s i c ” ))
( m146 ! ( f o r a l l v18 v17 )
(& ant ( p53 ( a c t ( p52 ( a c t i o n v17 ) ) ) ( a g e n t v18 ) )
( p51 ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member v18 ) ) )
( cq ( p54 ( c l a s s ( m144 ( l e x a c t i o n ) ) ) ( member v17 ) ) ) ( k n c a t i n t r i n s i c ) )
( m146 ! )
CPU time : 0 . 2 0
∗
; ; ; S p e a r s a r e weapons
( describe
( assert s u b c l a s s ( b u i l d l e x ” s p e a r ” )
s u p e r c l a s s ( b u i l d l e x ”weapon” )
kn cat ” l i f e ” ))
( m149 ! ( k n c a t l i f e ) ( s u b c l a s s ( m147 ( l e x s p e a r ) ) )
( s u p e r c l a s s ( m148 ( l e x weapon ) ) ) )
( m149 ! )
170
CPU time : 0 . 0 1
∗
;;;
I f something i s a weapon , then i t s f u n c t i o n i s t o damage
( describe
( as se r t f o r a l l $v23
ant ( b u i l d member ∗ v23
c l a s s ( b u i l d l e x ”weapon” )
)
cq ( b u i l d o b j e c t 1 ∗ v23
o b j e c t 2 ( b u i l d l e x ”damage” )
r e l ( build lex ” function ” ))
kn cat ” l i f e − r u l e .1” ))
( m152 ! ( f o r a l l v19 ) ( ant ( p55 ( c l a s s ( m148 ( l e x weapon ) ) ) ( member v19 ) ) )
( cq
( p56 ( o b j e c t 1 v19 ) ( o b j e c t 2 ( m150 ( l e x damage ) ) )
( r e l ( m151 ( l e x f u n c t i o n ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m152 ! )
CPU time : 0 . 0 2
∗
; ; ; Kings a r e p e r s o n s
( describe
( ass ert s u b c l a s s ( b u i l d l e x ” k i n g ” )
s u p e r c l a s s ( build lex ” person ” )
kn cat ” l i f e ” ))
( m153 ! ( k n c a t l i f e ) ( s u b c l a s s ( m44 ( l e x k i n g ) ) )
( s u p e r c l a s s ( m24 ( l e x p e r s o n ) ) ) )
( m153 ! )
CPU time : 0 . 0 1
∗
; ; ; Squires are persons
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” s q u i r e ” )
s u p e r c l a s s ( build lex ” person ” )
kn cat ” l i f e ” ))
( m155 ! ( k n c a t l i f e ) ( s u b c l a s s ( m154 ( l e x s q u i r e ) ) )
( s u p e r c l a s s ( m24 ( l e x p e r s o n ) ) ) )
( m155 ! )
CPU time : 0 . 0 1
∗
; ; ; Yeomen a r e p e r s o n s
171
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ”yeoman” )
s u p e r c l a s s ( build lex ” person ” )
kn cat ” l i f e ” ))
( m157 ! ( k n c a t l i f e ) ( s u b c l a s s ( m156 ( l e x yeoman ) ) )
( s u p e r c l a s s ( m24 ( l e x p e r s o n ) ) ) )
( m157 ! )
CPU time : 0 . 0 2
∗
;;;
I f something i s a c a r n i v o r e , then i t e a t s meat
( describe
( as s ert f o r a l l $ c a r n i v o r e
ant ( b u i l d member ∗ c a r n i v o r e
class ( build lex ” carnivore ”)
)
cq ( b u i l d a g e n t ∗ c a r n i v o r e
act ( build action ( build lex ” eat ” )
o b j e c t ( b u i l d l e x ”meat” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m161 ! ( f o r a l l v20 ) ( ant ( p57 ( c l a s s ( m14 ( l e x c a r n i v o r e ) ) ) ( member v20 ) ) )
( cq
( p58 ( a c t ( m160 ( a c t i o n ( m158 ( l e x e a t ) ) ) ( o b j e c t ( m159 ( l e x meat ) ) ) ) )
( a g e n t v20 ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m161 ! )
CPU time : 0 . 0 1
∗
;;;
I f something i s an h e r b i v o r e , then i t e a t s p l a n t s
( describe
( ass ert f o r a l l $herb
ant ( b u i l d member ∗ herb
class ( build lex ” herbivore ”)
)
cq ( b u i l d a g e n t ∗ herb
act ( build action ( build lex ” eat ” )
object ( build lex ” plant ” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m164 ! ( f o r a l l v21 ) ( ant ( p59 ( c l a s s ( m28 ( l e x h e r b i v o r e ) ) ) ( member v21 ) ) )
( cq
( p60 ( a c t ( m163 ( a c t i o n ( m158 ( l e x e a t ) ) ) ( o b j e c t ( m162 ( l e x p l a n t ) ) ) ) )
( a g e n t v21 ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m164 ! )
CPU time : 0 . 0 1
172
∗
; ”mammals presumably b e a r l i v e young ”
( describe
( as se r t f o r a l l $animal1
ant ( b u i l d member ∗ animal1
c l a s s ( b u i l d l e x ”mammal” ) )
cq ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d a g e n t ∗ animal1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” b e a r ” )
o b j e c t ( b u i l d l e x ” l i v e young ” ) ) ) )
kn cat ” l i f e − r u l e .1” ))
( m168 ! ( f o r a l l v22 ) ( ant ( p61 ( c l a s s ( m10 ( l e x mammal ) ) ) ( member v22 ) ) )
( cq
( p63 ( mode ( m115 ( l e x presumably ) ) )
( object
( p62
( a c t ( m167 ( a c t i o n ( m165 ( l e x b e a r ) ) ) ( o b j e c t ( m166 ( l e x l i v e young ) ) ) ) )
( a g e n t v22 ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m168 ! )
CPU time : 0 . 0 4
∗
; ” i f something b e a r s something e l s e , i t i s an animal ”
( describe
( ass ert f o r a l l ( ∗ animal1 $animal2 )
ant ( b u i l d a g e n t ∗ animal1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” b e a r ” )
o b j e c t ∗ animal2 ) )
cq ( b u i l d member ∗ animal1 c l a s s ( b u i l d l e x ”mammal” ) )
kn cat ” l i f e − r u l e .1” ))
( m169 ! ( f o r a l l v23 v22 )
( ant ( p65 ( a c t ( p64 ( a c t i o n ( m165 ( l e x b e a r ) ) ) ( o b j e c t v23 ) ) ) ( a g e n t v22 ) ) )
( cq ( p61 ( c l a s s ( m10 ( l e x mammal ) ) ) ( member v22 ) ) ) ( k n c a t l i f e − r u l e . 1 ) )
( m169 ! )
CPU time : 0 . 0 2
∗
;;;
I f something i s a p r e d a t o r , then presumably i t hunts
( describe
( assert f o r a l l ∗ v5
ant ( b u i l d member ∗ v5
c l a s s ( build lex ” predator ” )
)
cq ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d a c t ( b u i l d a c t i o n ( b u i l d l e x ” hunt ” ) )
a g e n t ∗ v5 ) )
kn cat ” l i f e − r u l e .1” ))
( m172 ! ( f o r a l l v5 ) ( ant ( p66 ( c l a s s ( m16 ( l e x p r e d a t o r ) ) ) ( member v5 ) ) )
( cq
( p68 ( mode ( m115 ( l e x presumably ) ) )
( o b j e c t ( p67 ( a c t ( m171 ( a c t i o n ( m170 ( l e x hunt ) ) ) ) ) ( a g e n t v5 ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
173
( m172 ! )
CPU time : 0 . 0 2
∗
( describe
( a sse r t f o r a l l ( $v30 $v31 $v32 )
ant ( ( b u i l d a g e n t ∗ v30
p l a c e ∗ v31
time ∗ v32 )
( b u i l d o b j e c t ∗ v30
p l a c e ∗ v31
time ∗ v32 ) )
cq ( b u i l d o b j e c t 1 ∗ v30
o b j e c t 2 ∗ v31
r e l ( build l e x ” at ” )
time ∗ v32 )
kn cat ” l i f e − r u l e .1” ))
( m174 ! ( f o r a l l v26 v25 v24 )
( ant ( p70 ( o b j e c t v24 ) ( p l a c e v25 ) ( time v26 ) )
( p69 ( a g e n t v24 ) ( p l a c e v25 ) ( time v26 ) ) )
( cq ( p71 ( o b j e c t 1 v24 ) ( o b j e c t 2 v25 ) ( r e l ( m173 ( l e x a t ) ) ) ( time v26 ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m174 ! )
CPU time : 0 . 0 1
∗
( describe
( ass ert f o r a l l ( $v33 $v34 ∗ v5 ∗ v6 )
&ant ( ( b u i l d member ∗ v5
c l a s s ∗ v6 )
( b u i l d a g e n t ∗ v5
a c t ( b u i l d a c t i o n ∗ v34 ) )
( b u i l d f o r a l l ∗ v5
ant ( b u i l d a g e n t ∗ v5
a c t ( b u i l d a c t i o n ∗ v34 ) )
cq ( b u i l d member ∗ v5
c l a s s ∗ v33 ) ) )
cq ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d s u b c l a s s ∗ v6
s u p e r c l a s s ∗ v33 ) )
kn cat ” l i f e − r u l e .2” ))
( m175 ! ( f o r a l l v28 v27 v6 v5 )
(& ant
( p75 ( f o r a l l v5 ) ( ant ( p73 ( a c t ( p72 ( a c t i o n v28 ) ) ) ( a g e n t v5 ) ) )
( cq ( p74 ( c l a s s v27 ) ( member v5 ) ) ) )
( p73 ) ( p21 ( c l a s s v6 ) ( member v5 ) ) )
( cq
( p77 ( mode ( m115 ( l e x presumably ) ) )
( o b j e c t ( p76 ( s u b c l a s s v6 ) ( s u p e r c l a s s v27 ) ) ) ) )
( kn cat l i f e − r u l e . 2 ) )
174
( m175 ! )
CPU time : 0 . 0 3
∗
; ; ; ” K i l l ” and ” S l a y ” a r e synonyms
( describe
( a sse r t synonym ” k i l l ”
synonym ” s l a y ”
kn cat ” l i f e ” ))
( m176 ! ( k n c a t l i f e ) ( synonym s l a y k i l l ) )
( m176 ! )
CPU time : 0 . 0 1
∗
; ; ; I f x i s an e l d e r , then x has t h e p r o p e r t y ” o l d , ” and presumably x i s a
; ; ; person
( describe
( as s ert f o r a l l $v35
ant ( b u i l d member ∗ v35
class ( build lex ” elder ”)
)
cq ( ( b u i l d o b j e c t ∗ v35
property ( build lex ” old ” ))
( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d member ∗ v35
c l a s s ( build lex ” person ” ) ) ) )
kn cat ” l i f e − r u l e .1” ))
( m179 ! ( f o r a l l v29 ) ( ant ( p78 ( c l a s s ( m177 ( l e x e l d e r ) ) ) ( member v29 ) ) )
( cq
( p81 ( mode ( m115 ( l e x presumably ) ) )
( o b j e c t ( p80 ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member v29 ) ) ) )
( p79 ( o b j e c t v29 ) ( p r o p e r t y ( m178 ( l e x o l d ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m179 ! )
CPU time : 0 . 0 2
∗
; ; ; Dwarfs a r e p e r s o n s
( describe
( ass ert s u b c l a s s ( b u i l d l e x ” dwarf ” )
s u p e r c l a s s ( build lex ” person ” )
kn cat ” l i f e ” ))
( m181 ! ( k n c a t l i f e ) ( s u b c l a s s ( m180 ( l e x dwarf ) ) )
( s u p e r c l a s s ( m24 ( l e x p e r s o n ) ) ) )
( m181 ! )
175
CPU time : 0 . 0 1
∗
; ; ; Pavilions are tents
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” p a v i l i o n ” )
superclass ( build lex ” tent ”)
kn cat ” l i f e ” ))
( m184 ! ( k n c a t l i f e ) ( s u b c l a s s ( m182 ( l e x p a v i l i o n ) ) )
( s u p e r c l a s s ( m183 ( l e x t e n t ) ) ) )
( m184 ! )
CPU time : 0 . 0 1
∗
; ; ; For a l l x and y , i f t h e r e i s a z t h a t i s t h e ” r i d e r − o f ” x and z i s
; ; ; e q u i v a l e n t t o y , then y r i d e s x
( describe
( as s ert f o r a l l ( ∗ v2 $v38 )
ant ( b u i l d e q u i v ( b u i l d a2 ∗ v2
skf ” rider−of ”)
e q u i v ∗ v38 )
cq ( b u i l d a g e n t ∗ v38
act ( build action ( build lex ” ride ” )
o b j e c t ∗ v2 ) )
kn cat ” l i f e − r u l e .1” ))
( m185 ! ( f o r a l l v30 v2 ) ( ant ( p82 ( e q u i v v30 ( p10 ( a2 v2 ) ( s k f r i d e r − o f ) ) ) ) )
( cq ( p83 ( a c t ( p12 ( a c t i o n ( m116 ( l e x r i d e ) ) ) ( o b j e c t v2 ) ) ) ( a g e n t v30 ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m185 ! )
CPU time : 0 . 0 1
∗
; ; ; I f y r i d e s x , then t h e r e i s a z t h a t i s t h e ” r i d e r − o f ” x , and z , i s
; ; ; e q u i v a l e n t t o y and z r i d e s x
( describe
( a ss er t f o r a l l ( ∗ v2 ∗ v38 )
ant ( b u i l d a g e n t ∗ v38
act ( build action ( build lex ” ride ” )
o b j e c t ∗ v2 ) )
cq ( ( b u i l d e q u i v ( b u i l d a2 ∗ v2
skf ” rider−of ”)
e q u i v ∗ v38 )
( b u i l d a g e n t ( b u i l d a2 ∗ v2
skf ” rider−of ”)
act ( build action ( build lex ” ride ” )
o b j e c t ∗ v2 ) ) )
kn cat ” l i f e − r u l e .1” ))
( m186 ! ( f o r a l l v30 v2 )
176
( ant ( p83 ( a c t ( p12 ( a c t i o n ( m116 ( l e x r i d e ) ) ) ( o b j e c t v2 ) ) ) ( a g e n t v30 ) ) )
( cq ( p82 ( e q u i v v30 ( p10 ( a2 v2 ) ( s k f r i d e r − o f ) ) ) )
( p13 ( a c t ( p12 ) ) ( a g e n t ( p10 ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m186 ! )
CPU time : 0 . 0 3
∗
;;;
I f y mounts x , then presumably y r i d e s x
( describe
( as se rt f o r a l l ( ∗ v2 ∗ v38 )
ant ( b u i l d a g e n t ∗ v38
a c t ( b u i l d a c t i o n ( b u i l d l e x ”mount” )
o b j e c t ∗ v2 ) )
cq ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d a g e n t ∗ v38
act ( build action ( build lex ” ride ” )
o b j e c t ∗ v2 ) ) )
kn cat ” l i f e − r u l e .1” ))
( m188 ! ( f o r a l l v30 v2 )
( ant ( p85 ( a c t ( p84 ( a c t i o n ( m187 ( l e x mount ) ) ) ( o b j e c t v2 ) ) ) ( a g e n t v30 ) ) )
( cq
( p86 ( mode ( m115 ( l e x presumably ) ) )
( object
( p83 ( a c t ( p12 ( a c t i o n ( m116 ( l e x r i d e ) ) ) ( o b j e c t v2 ) ) ) ( a g e n t v30 ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m188 ! )
CPU time : 0 . 0 3
∗
; ; ; Horses are equines
( describe
( as se rt s u b c l a s s ( b u i l d l e x ” h o r s e ” )
s u p e r c l a s s ( build lex ” equine ” )
kn cat ” l i f e ” ))
( m189 ! ( k n c a t l i f e ) ( s u b c l a s s ( m82 ( l e x h o r s e ) ) )
( s u p e r c l a s s ( m118 ( l e x e q u i n e ) ) ) )
( m189 ! )
CPU time : 0 . 0 1
∗
; ; ; Equines a r e h e r b i v o r e s
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” e q u i n e ” )
superclass ( build lex ” herbivore ”)
kn cat ” l i f e ” ))
177
( m190 ! ( k n c a t l i f e ) ( s u b c l a s s ( m118 ( l e x e q u i n e ) ) )
( s u p e r c l a s s ( m28 ( l e x h e r b i v o r e ) ) ) )
( m190 ! )
CPU time : 0 . 0 0
∗
; ; ; Equines a r e mammals
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” e q u i n e ” )
s u p e r c l a s s ( b u i l d l e x ”mammal” )
kn cat ” l i f e ” ))
( m191 ! ( k n c a t l i f e ) ( s u b c l a s s ( m118 ( l e x e q u i n e ) ) )
( s u p e r c l a s s ( m10 ( l e x mammal ) ) ) )
( m191 ! )
CPU time : 0 . 0 1
∗
; ; ; Equines a r e quadrupeds
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” e q u i n e ” )
s u p e r c l a s s ( b u i l d l e x ” quadruped ” )
kn cat ” l i f e ” ))
( m192 ! ( k n c a t l i f e ) ( s u b c l a s s ( m118 ( l e x e q u i n e ) ) )
( s u p e r c l a s s ( m12 ( l e x quadruped ) ) ) )
( m192 ! )
CPU time : 0 . 0 1
∗
; ; ; Ponies are equines
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” pony ” )
s u p e r c l a s s ( build lex ” equine ” )
kn cat ” l i f e ” ))
( m194 ! ( k n c a t l i f e ) ( s u b c l a s s ( m193 ( l e x pony ) ) )
( s u p e r c l a s s ( m118 ( l e x e q u i n e ) ) ) )
( m194 ! )
CPU time : 0 . 0 2
∗
; ; ; Ponies are animals
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” pony ” )
s u p e r c l a s s ( b u i l d l e x ” animal ” )
178
kn cat ” l i f e ” ))
( m195 ! ( k n c a t l i f e ) ( s u b c l a s s ( m193 ( l e x pony ) ) )
( s u p e r c l a s s ( m18 ( l e x animal ) ) ) )
( m195 ! )
CPU time : 0 . 0 1
∗
; ; ; Misty i s a pony
( describe
( as s ert member #Misty
c l a s s ( b u i l d l e x ” pony ” )
kn cat ” l i f e ” ))
( m196 ! ( c l a s s ( m193 ( l e x pony ) ) ) ( k n c a t l i f e ) ( member b12 ) )
( m196 ! )
CPU time : 0 . 0 1
∗
( describe
( a sse r t o b j e c t ∗ Misty
proper−name ( b u i l d l e x ” Misty ” )
kn cat ” l i f e ” ))
( m198 ! ( k n c a t l i f e ) ( o b j e c t b12 ) ( proper−name ( m197 ( l e x Misty ) ) ) )
( m198 ! )
CPU time : 0 . 0 2
∗
; ; ; Misty i s owned by a p e r s o n
( describe
( as se r t o b j e c t ∗ Misty
p o s s e s s o r #APers
r e l ( b u i l d l e x ” pony ” ) ) )
( m199 ! ( o b j e c t b12 ) ( p o s s e s s o r b13 ) ( r e l ( m193 ( l e x pony ) ) ) )
( m199 ! )
CPU time : 0 . 0 1
∗
( describe
( as s ert member #APers
c l a s s ( build lex ” person ” )
kn cat ” l i f e ” ))
( m200 ! ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( k n c a t l i f e ) ( member b14 ) )
( m200 ! )
179
CPU time : 0 . 0 2
∗
; ; ; Mr . Ed i s a h o r s e
( describe
( as se r t member #MREd
c l a s s ( build lex ” horse ” )
kn cat ” l i f e ” ))
( m201 ! ( c l a s s ( m82 ( l e x h o r s e ) ) ) ( k n c a t l i f e ) ( member b15 ) )
( m201 ! )
CPU time : 0 . 0 1
∗
( describe
( a sse r t o b j e c t ∗MREd
proper−name ( b u i l d l e x ”Mr Ed” )
kn cat ” l i f e ” ))
( m203 ! ( k n c a t l i f e ) ( o b j e c t b15 ) ( proper−name ( m202 ( l e x Mr Ed ) ) ) )
( m203 ! )
CPU time : 0 . 0 2
∗
; ; ; Mr . Ed i s owned by a p e r s o n
( describe
( a sse r t o b j e c t ∗MREd
p o s s e s s o r #APers2
r e l ( build lex ” horse ” )
kn cat ” l i f e ” ))
( m204 ! ( k n c a t l i f e ) ( o b j e c t b15 ) ( p o s s e s s o r b16 ) ( r e l ( m82 ( l e x h o r s e ) ) ) )
( m204 ! )
CPU time : 0 . 0 1
∗
( describe
( as s ert member ∗ APers2
c l a s s ( build lex ” person ” )
kn cat ” l i f e ” ))
( m205 ! ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( k n c a t l i f e ) ( member b16 ) )
( m205 ! )
CPU time : 0 . 0 1
∗
180
;;;
I f x i s t h e y o f i t s p o s s e s s o r , then x i s a y
( describe
( ass er t f o r a l l ( ∗ v39 $v40 )
ant ( b u i l d o b j e c t ∗ v40
r e l ∗ v39 )
cq ( b u i l d member ∗ v40
c l a s s ∗ v39 )
kn cat ” i n t r i n s i c ” ))
( m206 ! ( f o r a l l v31 v4 ) ( ant ( p87 ( o b j e c t v31 ) ( r e l v4 ) ) )
( cq ( p88 ( c l a s s v4 ) ( member v31 ) ) ) ( k n c a t i n t r i n s i c ) )
( m206 ! )
CPU time : 0 . 0 1
∗
; ; ; I f x i s an e q u i n e , then t h e r e i s a y t h a t i s t h e b r e a s t
; ; ; of x
( describe
( a sse r t f o r a l l ∗ v4
ant ( b u i l d member ∗ v4
c l a s s ( build lex ” equine ” ))
cq ( b u i l d o b j e c t ( b u i l d a1 ∗ v4
skf ” breast−of ” )
p o s s e s s o r ∗ v4
r e l ( build lex ” breast ” ))
kn cat ” l i f e − r u l e .1” ))
( m211 ! ( ant ( m207 ( c l a s s ( m118 ( l e x e q u i n e ) ) ) ) )
( cq ( m210 ( o b j e c t ( m208 ( s k f b r e a s t − o f ) ) ) ( r e l ( m209 ( l e x b r e a s t ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m211 ! )
CPU time : 0 . 0 2
∗
; ; ; RULES CONCERNING LEAPING
;;;
;;;
I f an a g e n t l e a p s onto an o b j e c t a t time x , then t h e r e i s a time y when
t h e l e a p e r i s on t h e o b j e c t , and y i s a f t e r x
( describe
( ass ert f o r a l l ( $v25 $v26 $v27 )
ant ( b u i l d a g e n t ∗ v25
a c t ( b u i l d a c t i o n ( b u i l d l e x ” l e a p onto ” )
o b j e c t ∗ v26 )
time ∗ v27 )
cq ( ( b u i l d o b j e c t ∗ v25 l o c a t i o n
( b u i l d s p − r e l ( b u i l d l e x ” on ” ) o b j e c t ∗ v26 )
time ( b u i l d a3 ∗ v26
s k f ” time−at ” ) )
( b u i l d a f t e r ( b u i l d a3 ∗ v26
s k f ” time−at ” )
b e f o r e ∗ v27 ) )
181
kn cat ” l i f e − r u l e .1” ))
( m214 ! ( f o r a l l v34 v33 v32 )
( ant
( p90 ( a c t ( p89 ( a c t i o n ( m212 ( l e x l e a p onto ) ) ) ( o b j e c t v33 ) ) ) ( a g e n t v32 )
( time v34 ) ) )
( cq ( p94 ( a f t e r ( p92 ( a3 v33 ) ( s k f time−at ) ) ) ( b e f o r e v34 ) )
( p93 ( l o c a t i o n ( p91 ( o b j e c t v33 ) ( s p − r e l ( m213 ( l e x on ) ) ) ) ) ( o b j e c t v32 )
( time ( p92 ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m214 ! )
CPU time : 0 . 0 3
∗
;;;
;;;
I f an a g e n t l e a p s t o a g o a l a t time x , then t h e r e i s a time y when t h e
l e a p e r i s a t t h e g o a l , and y i s a f t e r x
( describe
( ass ert f o r a l l ( ∗ v25 ∗ v26 ∗ v27 )
ant ( b u i l d a g e n t ∗ v25
act ( build action ( build l e x ” leap to ” )
o b j e c t ∗ v26 )
time ∗ v27 )
cq ( ( b u i l d o b j e c t ∗ v25 l o c a t i o n
( b u i l d s p − r e l ( b u i l d l e x ” a t ” ) o b j e c t ∗ v26 )
time ( b u i l d a3 ∗ v26
s k f ” time−at ” ) )
( b u i l d a f t e r ( b u i l d a3 ∗ v26
s k f ” time−at ” )
b e f o r e ∗ v27 ) )
kn cat ” l i f e − r u l e .1” ))
( m216 ! ( f o r a l l v34 v33 v32 )
( ant
( p96 ( a c t ( p95 ( a c t i o n ( m215 ( l e x l e a p t o ) ) ) ( o b j e c t v33 ) ) ) ( a g e n t v32 )
( time v34 ) ) )
( cq
( p98 ( l o c a t i o n ( p97 ( o b j e c t v33 ) ( s p − r e l ( m173 ( l e x a t ) ) ) ) ) ( o b j e c t v32 )
( time ( p92 ( a3 v33 ) ( s k f time−at ) ) ) )
( p94 ( a f t e r ( p92 ) ) ( b e f o r e v34 ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m216 ! )
CPU time : 0 . 0 3
∗
;;;
;;;
I f an a g e n t l e a p s from an o b j e c t a t time x , then t h e r e i s a time y when
t h e l e a p e r i s on t h e o b j e c t , and y i s b e f o r e x
( describe
( ass ert f o r a l l ( ∗ v25 ∗ v26 $v28 $v29 )
ant ( b u i l d a g e n t ∗ v25
a c t ( b u i l d a c t i o n ( b u i l d l e x ” l e a p from ” )
o b j e c t ∗ v28 )
time ∗ v29 )
182
cq ( ( b u i l d o b j e c t ∗ v25 l o c a t i o n
( b u i l d s p − r e l ( b u i l d l e x ” on ” ) o b j e c t ∗ v28 )
time ( b u i l d a4 ∗ v28
s k f ” time−at ” ) )
( b u i l d a f t e r ∗ v29
b e f o r e ( b u i l d a4 ∗ v28
s k f ” time−at ” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m218 ! ( f o r a l l v36 v35 v33 v32 )
( ant
( p100 ( a c t ( p99 ( a c t i o n ( m217 ( l e x l e a p from ) ) ) ( o b j e c t v35 ) ) ) ( a g e n t v32 )
( time v36 ) ) )
( cq ( p104 ( a f t e r v36 ) ( b e f o r e ( p102 ( a4 v35 ) ( s k f time−at ) ) ) )
( p103 ( l o c a t i o n ( p101 ( o b j e c t v35 ) ( s p − r e l ( m213 ( l e x on ) ) ) ) ) ( o b j e c t v32 )
( time ( p102 ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m218 ! )
CPU time : 0 . 0 1
∗
; ; ; ; NEW RULES −− SN
; ; ; I f an a g e n t l e a p s onto an o b j e c t a t time S and
;;;
t h e same a g e n t l e a p s o f f o f a n o t h e r o b j e c t a t time T and
;;;
time S i s b e f o r e time T then
;;;
t h e two o b j e c t s a r e e q u i v a l e n t
; ; ; ( describe
; ; ; ( add f o r a l l ( $ l e a p e r $ t h i n g 1 $ t h i n g 2 $timeS $timeT $ c l s 1 $ c l s 2 )
;;;
&ant ( ( b u i l d a g e n t ∗ l e a p e r
;;;
a c t ( b u i l d a c t i o n ( b u i l d l e x ” l e a p onto ” )
;;;
object ∗ thing1 )
;;;
time ∗ timeS )
;;;
( build agent ∗ l e a p e r
;;;
a c t ( b u i l d a c t i o n ( b u i l d l e x ” l e a p from ” )
;;;
object ∗ thing2 )
;;;
time ∗ timeT )
;;;
( b u i l d b e f o r e ∗ timeS a f t e r ∗ timeT )
;;;
( b u i l d member ∗ t h i n g 1 c l a s s ∗ c l s 1 )
;;;
( b u i l d member ∗ t h i n g 2 c l a s s ∗ c l s 2 )
;;;
( b u i l d o b j e c t ∗ c l s 1 p r o p e r t y ( b u i l d l e x ”unknown ” ) ) )
;;;
cq ( ( b u i l d e q u i v ∗ t h i n g 1 e q u i v ∗ t h i n g 2 )
;;;
( build subclass ∗ cls1 superclass ∗ cls2 ) ) ) )
( describe
( add f o r a l l ( $ l e a p e r $ t h i n g 1 $ t h i n g 2 $timeS $timeT )
&ant ( ( b u i l d a g e n t ∗ l e a p e r
a c t ( b u i l d a c t i o n ( b u i l d l e x ” l e a p onto ” )
object ∗ thing1 )
time ∗ timeS )
( build agent ∗ l e a p e r
a c t ( b u i l d a c t i o n ( b u i l d l e x ” l e a p from ” )
object ∗ thing2 )
time ∗ timeT )
( b u i l d b e f o r e ∗ timeS a f t e r ∗ timeT ) )
cq ( b u i l d e q u i v ∗ t h i n g 1 e q u i v ∗ t h i n g 2 ) ) )
183
( m219 ! ( f o r a l l v41 v40 v39 v38 v37 )
(& ant ( p109 ( a f t e r v41 ) ( b e f o r e v40 ) )
( p108 ( a c t ( p107 ( a c t i o n ( m217 ( l e x l e a p from ) ) ) ( o b j e c t v39 ) ) ) ( a g e n t v37 )
( time v41 ) )
( p106 ( a c t ( p105 ( a c t i o n ( m212 ( l e x l e a p onto ) ) ) ( o b j e c t v38 ) ) ) ( a g e n t v37 )
( time v40 ) ) )
( cq ( p110 ( e q u i v v39 v38 ) ) ) )
( m219 ! )
CPU time : 0 . 4 5
∗
( describe
( add f o r a l l ( $eq1 $eq2 $ c l s 1 $ c l s 2 )
&ant ( ( b u i l d e q u i v ∗ eq1 e q u i v ∗ eq2 )
( b u i l d member ∗ eq1 c l a s s ∗ c l s 1 )
( b u i l d member ∗ eq2 c l a s s ∗ c l s 2 )
( b u i l d o b j e c t ∗ c l s 1 p r o p e r t y ( b u i l d l e x ”unknown” ) ) )
cq ( b u i l d s u b c l a s s ∗ c l s 1 s u p e r c l a s s ∗ c l s 2 ) ) )
( m293 !
( m292 !
( m291 !
( m290 !
( m289 !
( m288 !
( m287 !
( m285 !
( m284 !
( m283 !
( m282 !
( m281 !
( m280 !
( m279 !
( m278 !
( m277 !
( m276 !
( m275 !
( m274 !
( m273 !
( m272 !
( m271 !
( m270 !
( m269 !
( m268 !
( m267 !
( m266 !
( m265 !
( m264 !
( m263 !
( m262 !
( m261 !
( m260 !
( m259 !
( m258 !
( m257 !
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
c l a s s ( m209 ( l e x b r e a s t ) ) ) ( member ( m208 ( s k f b r e a s t − o f ) ) ) )
a c t ( m286 ( a c t i o n ( m158 ( l e x e a t ) ) ) ) ) ( a g e n t b12 ) )
a c t ( m286 ) ) ( a g e n t b15 ) )
a c t ( m163 ( a c t i o n ( m158 ) ) ( o b j e c t ( m162 ( l e x p l a n t ) ) ) ) ) ( a g e n t b12 ) )
a c t ( m163 ) ) ( a g e n t b15 ) )
c l a s s ( m144 ( l e x a c t i o n ) ) ) ( member ( m158 ) ) )
a c t ( m286 ) ) ( a g e n t b1 ) )
a c t ( m160 ( a c t i o n ( m158 ) ) ( o b j e c t ( m159 ( l e x meat ) ) ) ) ) ( a g e n t b1 ) )
o b j e c t b15 ) ( r e l ( m82 ( l e x h o r s e ) ) ) )
o b j e c t b12 ) ( r e l ( m193 ( l e x pony ) ) ) )
o b j e c t b4 ) ( r e l ( m49 ( l e x sword ) ) ) )
o b j e c t ( m39 ( l e x Round Table ) ) ) ( r e l ( m40 ( l e x t a b l e ) ) ) )
o b j e c t b1 ) ( r e l ( m8 ( l e x dog ) ) ) )
c l a s s ( m37 ( l e x phys o b j ) ) ) ( member b1 ) )
c l a s s ( m35 ( l e x v e r t e b r a t e ) ) ) ( member b1 ) )
c l a s s ( m18 ( l e x animal ) ) ) ( member b1 ) )
c l a s s ( m16 ( l e x p r e d a t o r ) ) ) ( member b1 ) )
c l a s s ( m14 ( l e x c a r n i v o r e ) ) ) ( member b1 ) )
c l a s s ( m12 ( l e x quadruped ) ) ) ( member b1 ) )
c l a s s ( m10 ( l e x mammal ) ) ) ( member b1 ) )
c l a s s ( m8 ) ) ( member b1 ) )
c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member b2 ) )
c l a s s ( m77 ( l e x f u r n i t u r e ) ) ) ( member ( m39 ) ) )
c l a s s ( m40 ) ) ( member ( m39 ) ) )
c l a s s ( m44 ( l e x k i n g ) ) ) ( member b3 ) )
c l a s s ( m24 ) ) ( member b3 ) )
c l a s s ( m49 ) ) ( member b4 ) )
c l a s s ( m54 ( l e x w i z a r d ) ) ) ( member b5 ) )
c l a s s ( m24 ) ) ( member b5 ) )
c l a s s ( m44 ) ) ( member b6 ) )
c l a s s ( m24 ) ) ( member b6 ) )
c l a s s ( m44 ) ) ( member b7 ) )
c l a s s ( m24 ) ) ( member b7 ) )
c l a s s ( m44 ) ) ( member b8 ) )
c l a s s ( m24 ) ) ( member b8 ) )
c l a s s ( m68 ( l e x k n i g h t ) ) ) ( member b9 ) )
184
( m256 ! ( c l a s s ( m24 ) ) ( member b9 ) )
( m255 ! ( c l a s s ( m68 ) ) ( member b10 ) )
( m254 ! ( c l a s s ( m24 ) ) ( member b10 ) )
( m253 ! ( c l a s s ( m68 ) ) ( member b11 ) )
( m252 ! ( c l a s s ( m24 ) ) ( member b11 ) )
( m251 ! ( c l a s s ( m89 ( l e x b a s i c c t g y ) ) ) ( member ( m24 ) ) )
( m250 ! ( c l a s s ( m89 ) ) ( member ( m8 ) ) )
( m249 ! ( c l a s s ( m89 ) ) ( member ( m82 ) ) )
( m248 ! ( c l a s s ( m89 ) ) ( member ( m2 ( l e x d e e r ) ) ) )
( m247 ! ( c l a s s ( m89 ) ) ( member ( m80 ( l e x c h a i r ) ) ) )
( m246 ! ( c l a s s ( m89 ) ) ( member ( m40 ) ) )
( m245 ! ( c l a s s ( m97 ( l e x c o l o r ) ) ) ( member ( m96 ( l e x w h i t e ) ) ) )
( m244 ! ( c l a s s ( m97 ) ) ( member ( m99 ( l e x b l a c k ) ) ) )
( m243 ! ( c l a s s ( m102 ( l e x s i z e ) ) ) ( member ( m101 ( l e x s m a l l ) ) ) )
( m242 ! ( c l a s s ( m102 ) ) ( member ( m106 ( l e x l a r g e ) ) ) )
( m241 ! ( c l a s s ( m111 ( l e x v a l u e ) ) ) ( member ( m110 ( l e x good ) ) ) )
( m240 ! ( c l a s s ( m111 ) ) ( member ( m113 ( l e x bad ) ) ) )
( m239 ! ( c l a s s ( m193 ) ) ( member b12 ) )
( m238 ! ( c l a s s ( m118 ( l e x e q u i n e ) ) ) ( member b12 ) )
( m237 ! ( c l a s s ( m37 ) ) ( member b12 ) )
( m236 ! ( c l a s s ( m35 ) ) ( member b12 ) )
( m235 ! ( c l a s s ( m28 ( l e x h e r b i v o r e ) ) ) ( member b12 ) )
( m234 ! ( c l a s s ( m18 ) ) ( member b12 ) )
( m233 ! ( c l a s s ( m12 ) ) ( member b12 ) )
( m232 ! ( c l a s s ( m10 ) ) ( member b12 ) )
( m231 ! ( c l a s s ( m24 ) ) ( member b14 ) )
( m230 ! ( c l a s s ( m118 ) ) ( member b15 ) )
( m229 ! ( c l a s s ( m82 ) ) ( member b15 ) )
( m228 ! ( c l a s s ( m37 ) ) ( member b15 ) )
( m227 ! ( c l a s s ( m35 ) ) ( member b15 ) )
( m226 ! ( c l a s s ( m28 ) ) ( member b15 ) )
( m225 ! ( c l a s s ( m18 ) ) ( member b15 ) )
( m224 ! ( c l a s s ( m12 ) ) ( member b15 ) )
( m223 ! ( c l a s s ( m10 ) ) ( member b15 ) )
( m222 ! ( c l a s s ( m24 ) ) ( member b16 ) )
( m221 ! ( f o r a l l v45 v44 v43 v42 )
(& ant ( p114 ( o b j e c t v44 ) ( p r o p e r t y ( m220 ( l e x unknown ) ) ) )
( p113 ( c l a s s v45 ) ( member v43 ) ) ( p112 ( c l a s s v44 ) ( member v42 ) )
( p111 ( e q u i v v43 v42 ) ) )
( cq ( p115 ( s u b c l a s s v44 ) ( s u p e r c l a s s v45 ) ) ) )
( m210 ! ( o b j e c t ( m208 ) ) ( r e l ( m209 ) ) )
( m207 ! ( c l a s s ( m118 ) ) )
( m293 !
m279 !
m266 !
m253 !
m240 !
m227 !
m292 !
m278 !
m265 !
m252 !
m239 !
m226 !
m291 !
m277 !
m264 !
m251 !
m238 !
m225 !
m290 !
m276 !
m263 !
m250 !
m237 !
m224 !
m289 !
m275 !
m262 !
m249 !
m236 !
m223 !
m288 !
m274 !
m261 !
m248 !
m235 !
m222 !
m287 !
m273 !
m260 !
m247 !
m234 !
m221 !
m285 !
m272 !
m259 !
m246 !
m233 !
m210 !
m284 ! m283 !
m271 ! m270 !
m258 ! m257 !
m245 ! m244 !
m232 ! m231 !
m207 ! )
CPU time : 5 . 4 1
∗
End o f / p r o j e c t s / s t n 2 /CVA/demos/ hackney . b a s e d e m o n s t r a t i o n .
CPU time : 8 . 2 5
185
m282 !
m269 !
m256 !
m243 !
m230 !
m281 !
m268 !
m255 !
m242 !
m229 !
m280 !
m267 !
m254 !
m241 !
m228 !
∗
; ; ; Begin Reading S t o r y
; ; ; When King Arthur and t h e two k i n g s saw them b e g i n t o wax wroth on
; ; ; both s i d e s , the y l e a p e d on s m a l l hackneys [ . . . ] [ p 1 6 ]
( clear−infer )
( Node a c t i v a t i o n c l e a r e d . Some r e g i s t e r i n f o r m a t i o n r e t a i n e d . )
CPU time : 0 . 0 6
∗
; ; ; King Arthur l e a p e d onto something
( describe
( add a g e n t ∗KA
a c t ( b u i l d a c t i o n ( b u i l d l e x ” l e a p onto ” )
o b j e c t #hack1 )
time #h0
kn cat ” story ” ))
( m318 ! ( f o r a l l v22 )
( ant ( p208 ( a c t ( m315 ( a c t i o n ( m165 ( l e x b e a r ) ) ) ) ) ( a g e n t v22 ) ) )
( cq ( p61 ( c l a s s ( m10 ( l e x mammal ) ) ) ( member v22 ) ) ) )
( m317 ! ( f o r a l l v22 ) ( ant ( p208 ) )
( cq ( p210 ( c l a s s ( m18 ( l e x animal ) ) ) ( member v22 ) ) ) )
( m316 ! ( f o r a l l v22 ) ( ant ( p208 ) )
( cq ( p209 ( c l a s s ( m37 ( l e x phys o b j ) ) ) ( member v22 ) ) ) )
( m314 ! ( c l a s s ( m144 ( l e x a c t i o n ) ) ) ( member ( m212 ( l e x l e a p onto ) ) ) )
( m302 ! ( l o c a t i o n ( m301 ( o b j e c t b17 ) ( s p − r e l ( m213 ( l e x on ) ) ) ) ) ( o b j e c t b3 )
( time ( m299 ( a3 b17 ) ( s k f time−at ) ) ) )
( m300 ! ( a f t e r ( m299 ) ) ( b e f o r e b18 ) )
( m298 ! ( a c t ( m294 ( a c t i o n ( m212 ) ) ( o b j e c t b17 ) ) ) ( a g e n t b3 ) ( time b18 ) )
( m297 ! ( a c t ( m296 ( a c t i o n ( m212 ) ) ) ) ( a g e n t b3 ) )
( m295 ! ( a c t ( m294 ) ) ( a g e n t b3 ) ( k n c a t s t o r y ) ( time b18 ) )
( m293 ! ( c l a s s ( m209 ( l e x b r e a s t ) ) ) ( member ( m208 ( s k f b r e a s t − o f ) ) ) )
( m292 ! ( a c t ( m286 ( a c t i o n ( m158 ( l e x e a t ) ) ) ) ) ( a g e n t b12 ) )
( m291 ! ( a c t ( m286 ) ) ( a g e n t b15 ) )
( m290 ! ( a c t ( m163 ( a c t i o n ( m158 ) ) ( o b j e c t ( m162 ( l e x p l a n t ) ) ) ) ) ( a g e n t b12 ) )
( m289 ! ( a c t ( m163 ) ) ( a g e n t b15 ) )
( m288 ! ( c l a s s ( m144 ) ) ( member ( m158 ) ) )
( m287 ! ( a c t ( m286 ) ) ( a g e n t b1 ) )
( m285 ! ( a c t ( m160 ( a c t i o n ( m158 ) ) ( o b j e c t ( m159 ( l e x meat ) ) ) ) ) ( a g e n t b1 ) )
( m284 ! ( o b j e c t b15 ) ( r e l ( m82 ( l e x h o r s e ) ) ) )
( m283 ! ( o b j e c t b12 ) ( r e l ( m193 ( l e x pony ) ) ) )
( m282 ! ( o b j e c t b4 ) ( r e l ( m49 ( l e x sword ) ) ) )
( m281 ! ( o b j e c t ( m39 ( l e x Round Table ) ) ) ( r e l ( m40 ( l e x t a b l e ) ) ) )
( m280 ! ( o b j e c t b1 ) ( r e l ( m8 ( l e x dog ) ) ) )
( m279 ! ( c l a s s ( m37 ) ) ( member b1 ) )
( m278 ! ( c l a s s ( m35 ( l e x v e r t e b r a t e ) ) ) ( member b1 ) )
( m277 ! ( c l a s s ( m18 ) ) ( member b1 ) )
( m276 ! ( c l a s s ( m16 ( l e x p r e d a t o r ) ) ) ( member b1 ) )
( m275 ! ( c l a s s ( m14 ( l e x c a r n i v o r e ) ) ) ( member b1 ) )
( m274 ! ( c l a s s ( m12 ( l e x quadruped ) ) ) ( member b1 ) )
( m273 ! ( c l a s s ( m10 ) ) ( member b1 ) )
( m272 ! ( c l a s s ( m8 ) ) ( member b1 ) )
( m271 ! ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member b2 ) )
( m270 ! ( c l a s s ( m77 ( l e x f u r n i t u r e ) ) ) ( member ( m39 ) ) )
186
( m269 !
( m268 !
( m267 !
( m266 !
( m265 !
( m264 !
( m263 !
( m262 !
( m261 !
( m260 !
( m259 !
( m258 !
( m257 !
( m256 !
( m255 !
( m254 !
( m253 !
( m252 !
( m251 !
( m250 !
( m249 !
( m248 !
( m247 !
( m246 !
( m245 !
( m244 !
( m243 !
( m242 !
( m241 !
( m240 !
( m239 !
( m238 !
( m237 !
( m236 !
( m235 !
( m234 !
( m233 !
( m232 !
( m231 !
( m230 !
( m229 !
( m228 !
( m227 !
( m226 !
( m225 !
( m224 !
( m223 !
( m222 !
( m210 !
( m132 !
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
c l a s s ( m40 ) ) ( member ( m39 ) ) )
c l a s s ( m44 ( l e x k i n g ) ) ) ( member b3 ) )
c l a s s ( m24 ) ) ( member b3 ) )
c l a s s ( m49 ) ) ( member b4 ) )
c l a s s ( m54 ( l e x w i z a r d ) ) ) ( member b5 ) )
c l a s s ( m24 ) ) ( member b5 ) )
c l a s s ( m44 ) ) ( member b6 ) )
c l a s s ( m24 ) ) ( member b6 ) )
c l a s s ( m44 ) ) ( member b7 ) )
c l a s s ( m24 ) ) ( member b7 ) )
c l a s s ( m44 ) ) ( member b8 ) )
c l a s s ( m24 ) ) ( member b8 ) )
c l a s s ( m68 ( l e x k n i g h t ) ) ) ( member b9 ) )
c l a s s ( m24 ) ) ( member b9 ) )
c l a s s ( m68 ) ) ( member b10 ) )
c l a s s ( m24 ) ) ( member b10 ) )
c l a s s ( m68 ) ) ( member b11 ) )
c l a s s ( m24 ) ) ( member b11 ) )
c l a s s ( m89 ( l e x b a s i c c t g y ) ) ) ( member ( m24 ) ) )
c l a s s ( m89 ) ) ( member ( m8 ) ) )
c l a s s ( m89 ) ) ( member ( m82 ) ) )
c l a s s ( m89 ) ) ( member ( m2 ( l e x d e e r ) ) ) )
c l a s s ( m89 ) ) ( member ( m80 ( l e x c h a i r ) ) ) )
c l a s s ( m89 ) ) ( member ( m40 ) ) )
c l a s s ( m97 ( l e x c o l o r ) ) ) ( member ( m96 ( l e x w h i t e ) ) ) )
c l a s s ( m97 ) ) ( member ( m99 ( l e x b l a c k ) ) ) )
c l a s s ( m102 ( l e x s i z e ) ) ) ( member ( m101 ( l e x s m a l l ) ) ) )
c l a s s ( m102 ) ) ( member ( m106 ( l e x l a r g e ) ) ) )
c l a s s ( m111 ( l e x v a l u e ) ) ) ( member ( m110 ( l e x good ) ) ) )
c l a s s ( m111 ) ) ( member ( m113 ( l e x bad ) ) ) )
c l a s s ( m193 ) ) ( member b12 ) )
c l a s s ( m118 ( l e x e q u i n e ) ) ) ( member b12 ) )
c l a s s ( m37 ) ) ( member b12 ) )
c l a s s ( m35 ) ) ( member b12 ) )
c l a s s ( m28 ( l e x h e r b i v o r e ) ) ) ( member b12 ) )
c l a s s ( m18 ) ) ( member b12 ) )
c l a s s ( m12 ) ) ( member b12 ) )
c l a s s ( m10 ) ) ( member b12 ) )
c l a s s ( m24 ) ) ( member b14 ) )
c l a s s ( m118 ) ) ( member b15 ) )
c l a s s ( m82 ) ) ( member b15 ) )
c l a s s ( m37 ) ) ( member b15 ) )
c l a s s ( m35 ) ) ( member b15 ) )
c l a s s ( m28 ) ) ( member b15 ) )
c l a s s ( m18 ) ) ( member b15 ) )
c l a s s ( m12 ) ) ( member b15 ) )
c l a s s ( m10 ) ) ( member b15 ) )
c l a s s ( m24 ) ) ( member b16 ) )
o b j e c t ( m208 ) ) ( r e l ( m209 ) ) )
c l a s s ( m24 ) ) )
( m318 !
m289 !
m275 !
m262 !
m249 !
m236 !
m223 !
m317 !
m288 !
m274 !
m261 !
m248 !
m235 !
m222 !
m316 !
m287 !
m273 !
m260 !
m247 !
m234 !
m210 !
m314 ! m302 !
m285 ! m284 !
m272 ! m271 !
m259 ! m258 !
m246 ! m245 !
m233 ! m232 !
m132 ! )
m300 !
m283 !
m270 !
m257 !
m244 !
m231 !
m298 !
m282 !
m269 !
m256 !
m243 !
m230 !
m297 !
m281 !
m268 !
m255 !
m242 !
m229 !
187
m295 !
m280 !
m267 !
m254 !
m241 !
m228 !
m293 !
m279 !
m266 !
m253 !
m240 !
m227 !
m292 !
m278 !
m265 !
m252 !
m239 !
m226 !
m291 !
m277 !
m264 !
m251 !
m238 !
m225 !
m290 !
m276 !
m263 !
m250 !
m237 !
m224 !
CPU time : 1 9 . 0 8
∗
; ; ; The t h i n g he l e a p e d onto i s a hackney
( describe
( as se r t member ∗ hack1
c l a s s ( b u i l d l e x ” hackney ” )
kn cat ” story ” ))
( m382 ! ( c l a s s ( m381 ( l e x hackney ) ) ) ( k n c a t s t o r y ) ( member b17 ) )
( m382 ! )
CPU time : 0 . 0 1
∗
; ; ; The hackney i s s m a l l
( describe
( a sse r t o b j e c t ∗ hack1
property ( build lex ” small ” )
kn cat ” story ” ))
( m383 ! ( k n c a t s t o r y ) ( o b j e c t b17 ) ( p r o p e r t y ( m101 ( l e x s m a l l ) ) ) )
( m383 ! )
CPU time : 0 . 0 0
∗
; ; ; Hackney i s an unknown word
( describe
( as s ert o b j e c t ( b u i l d l e x ” hackney ” )
p r o p e r t y ( b u i l d l e x ”unknown” ) ) )
( m384 ! ( o b j e c t ( m381 ( l e x hackney ) ) ) ( p r o p e r t y ( m220 ( l e x unknown ) ) ) )
( m384 ! )
CPU time : 0 . 0 1
∗
; ; ; A k i n g l e a p s on a s m a l l hackney
( describe
( a sse r t a g e n t # k i n g 1
a c t ( b u i l d a c t i o n ( b u i l d l e x ” l e a p onto ” )
o b j e c t #hack2 )
time ∗ h0
kn cat ” story ” ))
( m386 ! ( a c t ( m385 ( a c t i o n ( m212 ( l e x l e a p onto ) ) ) ( o b j e c t b20 ) ) ) ( a g e n t b19 )
( k n c a t s t o r y ) ( time b18 ) )
( m386 ! )
CPU time : 0 . 0 2
∗
188
( describe
( a sse r t o b j e c t ∗ hack2
property ( build lex ” small ” )
kn cat ” story ” ))
( m387 ! ( k n c a t s t o r y ) ( o b j e c t b20 ) ( p r o p e r t y ( m101 ( l e x s m a l l ) ) ) )
( m387 ! )
CPU time : 0 . 0 2
∗
( describe
( as s ert member ∗ k i n g 1
c l a s s ( build lex ” king ” )
kn cat ” story ” ))
( m388 ! ( c l a s s ( m44 ( l e x k i n g ) ) ) ( k n c a t s t o r y ) ( member b19 ) )
( m388 ! )
CPU time : 0 . 0 1
∗
( describe
( a sse r t member ∗ hack2
c l a s s ( b u i l d l e x ” hackney ” )
kn cat ” story ” ))
( m389 ! ( c l a s s ( m381 ( l e x hackney ) ) ) ( k n c a t s t o r y ) ( member b20 ) )
( m389 ! )
CPU time : 0 . 0 1
∗
; ; ; A( n o t h e r ) k i n g l e a p s on a s m a l l hackney
( describe
( a sse r t a g e n t # k i n g 2
a c t ( b u i l d a c t i o n ( b u i l d l e x ” l e a p onto ” )
o b j e c t #hack3 )
time ∗ h0
kn cat ” story ” ))
( m391 ! ( a c t ( m390 ( a c t i o n ( m212 ( l e x l e a p onto ) ) ) ( o b j e c t b22 ) ) ) ( a g e n t b21 )
( k n c a t s t o r y ) ( time b18 ) )
( m391 ! )
CPU time : 0 . 0 1
∗
( describe
( a ss er t member ∗ k i n g 2
c l a s s ( build lex ” king ” )
kn cat ” story ” ))
189
( m392 ! ( c l a s s ( m44 ( l e x k i n g ) ) ) ( k n c a t s t o r y ) ( member b21 ) )
( m392 ! )
CPU time : 0 . 0 2
∗
( describe
( a sse r t member ∗ hack3
c l a s s ( b u i l d l e x ” hackney ” )
kn cat ” story ” ))
( m393 ! ( c l a s s ( m381 ( l e x hackney ) ) ) ( k n c a t s t o r y ) ( member b22 ) )
( m393 ! )
CPU time : 0 . 0 1
∗
( describe
( a sse r t o b j e c t ∗ hack3
property ( build lex ” small ” )
kn cat ” story ” ))
( m394 ! ( k n c a t s t o r y ) ( o b j e c t b22 ) ( p r o p e r t y ( m101 ( l e x s m a l l ) ) ) )
( m394 ! )
CPU time : 0 . 0 1
∗
; ; ; What i s a hackney ?
ˆ(
−−> defineNoun ’ hackney )
D e f i n i t i o n o f hackney :
A c t i o n s pe r fo r me d on a hackney : k i n g l e a p onto ,
Possible Properties : small ,
nil
CPU time : 8 . 5 0
∗
; ; ; [ . . . ] S i r P e r s a u n t mounted an ambling hackney , conveyed them
; ; ; on t h e i r way and then commended them t o G−d . [ p 1 8 8 ]
; ; ; S i r P e r s a u n t mounted an ambling hackney
( describe
( as s ert a g e n t # P e r s a u n t
a c t ( b u i l d a c t i o n ( b u i l d l e x ”mount” )
o b j e c t #hack4 )
kn cat ” story ” ))
( m453 ! ( a c t ( m452 ( a c t i o n ( m187 ( l e x mount ) ) ) ( o b j e c t b24 ) ) ) ( a g e n t b23 )
( kn cat story ))
( m453 ! )
190
CPU time : 0 . 0 1
∗
( describe
( as se r t o b j e c t ∗ P e r s a u n t
proper−name ( b u i l d l e x ” S i r P e r s a u n t ” )
kn cat ” story ” ))
( m455 ! ( k n c a t s t o r y ) ( o b j e c t b23 ) ( proper−name ( m454 ( l e x S i r P e r s a u n t ) ) ) )
( m455 ! )
CPU time : 0 . 0 1
∗
( describe
( a sse r t member ∗ P e r s a u n t
c l a s s ( build lex ” knight ” )
k n c a t ” story−comp ” ) )
( m456 ! ( c l a s s ( m68 ( l e x k n i g h t ) ) ) ( k n c a t story−comp ) ( member b23 ) )
( m456 ! )
CPU time : 0 . 0 2
∗
( describe
( a sse r t member ∗ hack4
c l a s s ( b u i l d l e x ” hackney ” )
kn cat ” story ” ))
( m457 ! ( c l a s s ( m381 ( l e x hackney ) ) ) ( k n c a t s t o r y ) ( member b24 ) )
( m457 ! )
CPU time : 0 . 0 2
∗
( describe
( a sse r t o b j e c t ∗ hack4
p r o p e r t y ( b u i l d l e x ” ambling ” )
kn cat ” story ” ))
( m458 ! ( k n c a t s t o r y ) ( o b j e c t b24 ) ( p r o p e r t y ( m127 ( l e x ambling ) ) ) )
( m458 ! )
CPU time : 0 . 0 0
∗
( describe
( as s ert e q u i v ( b u i l d s k f ” r i d e r − o f ”
a2 ∗ hack4 )
equiv ∗ Persaunt
k n c a t ” story−comp ” ) )
191
( m460 ! ( e q u i v ( m459 ( a2 b24 ) ( s k f r i d e r − o f ) ) b23 ) ( k n c a t story−comp ) )
( m460 ! )
CPU time : 0 . 0 1
∗
; ; ; What i s a hackney ?
ˆ(
−−> defineNoun ’ hackney )
D e f i n i t i o n o f hackney :
A c t i o n s p e r f o r m e d on a hackney : k n i g h t mount , k i n g l e a p onto ,
P o s s i b l e P r o p e r t i e s : ambling , s m a l l ,
nil
CPU time : 2 . 7 9
∗
; ; ; So t h e k i n g took a l i t t l e hackney and [ . . . ] came unto S i r T r i s t r a m ’ s
; ; ; p a v i l i o n . When S i r T r i s t r a m saw t h e k i n g he ran t o him and would have
; ; ; h e l d h i s s t i r r u p , but t h e k i n g l e a p t from h i s h o r s e q u i c k l y [ . . . ] [ p . 2 4 8 ]
; ; ; King Arthur took a l i t t l e hackney
( describe
( assert a g e n t ∗KA
act ( build action ( build lex ” take ” )
o b j e c t #hack5 )
time #h1 k n c a t ” s t o r y ” ) )
( m482 ! ( a c t ( m481 ( a c t i o n ( m480 ( l e x t a k e ) ) ) ( o b j e c t b25 ) ) ) ( a g e n t b3 )
( k n c a t s t o r y ) ( time b26 ) )
( m482 ! )
CPU time : 0 . 0 1
∗
( describe
( as se rt b e f o r e ∗ h0
a f t e r ∗ h1 ) )
( m483 ! ( a f t e r b26 ) ( b e f o r e b18 ) )
( m483 ! )
CPU time : 0 . 0 1
∗
( describe
( as se r t member ∗ hack5
c l a s s ( b u i l d l e x ” hackney ” )
kn cat ” story ” ))
( m484 ! ( c l a s s ( m381 ( l e x hackney ) ) ) ( k n c a t s t o r y ) ( member b25 ) )
192
( m484 ! )
CPU time : 0 . 0 1
∗
( describe
( a sse r t o b j e c t ∗ hack5
property ( build lex ” l i t t l e ” )
kn cat ” story ” ))
( m485 ! ( k n c a t s t o r y ) ( o b j e c t b25 ) ( p r o p e r t y ( m104 ( l e x l i t t l e ) ) ) )
( m485 ! )
CPU time : 0 . 0 2
∗
; ; ; King Arthur a r r i v e d a t S i r T r i s t r a m ’ s p a v i l i o n .
( describe
( as s ert a g e n t ∗KA
act ( build action ( build lex ” ar r iv e ” )
place #pavilion2
time #h2 )
kn cat ” story ” ))
( m488 ! ( a c t ( m487 ( a c t i o n ( m486 ( l e x a r r i v e ) ) ) ( p l a c e b27 ) ( time b28 ) ) )
( a g e n t b3 ) ( k n c a t s t o r y ) )
( m488 ! )
CPU time : 0 . 0 2
∗
( describe
( a s s e r t member ∗ p a v i l i o n 2
class ( build lex ” pavilion ”)
kn cat ” story ” ))
( m489 ! ( c l a s s ( m182 ( l e x p a v i l i o n ) ) ) ( k n c a t s t o r y ) ( member b27 ) )
( m489 ! )
CPU time : 0 . 0 1
∗
( describe
( a sse r t o b j e c t ∗ p a v i l i o n 2
r e l ( build lex ” pavilion ”)
possessor ∗ Tris
kn cat ” story ” ))
( m490 ! ( k n c a t s t o r y ) ( o b j e c t b27 ) ( p o s s e s s o r b11 ) ( r e l ( m182 ( l e x p a v i l i o n ) ) ) )
( m490 ! )
CPU time : 0 . 0 1
193
∗
( describe
( as se r t b e f o r e ∗ h1
a f t e r ∗ h2
k n c a t ” story−comp ” ) )
( m491 ! ( a f t e r b28 ) ( b e f o r e b26 ) ( k n c a t story−comp ) )
( m491 ! )
CPU time : 0 . 0 2
∗
; ; ; S i r T r i s t r a m t r i e d t o h o l d King Arthur ’ s s t i r r u p , but King Arthur
; ; ; l e a p e d from h i s h o r s e t o t h e ground q u i c k l y .
( describe
( a sse r t a g e n t ∗ T r i s
act ( build action ( build lex ” try ” )
o b j e c t ( build agent ∗ Tris
act ( build a c ti o n ( build l e x ” hold ” )
object #stirrup1 )))
time ∗ h2
kn cat ” story ” ))
( m497 !
( a c t ( m496 ( a c t i o n ( m492 ( l e x t r y ) ) )
( object
( m495 ( a c t ( m494 ( a c t i o n ( m493 ( l e x h o l d ) ) ) ( o b j e c t b29 ) ) )
( a g e n t b11 ) ) ) ) )
( a g e n t b11 ) ( k n c a t s t o r y ) ( time b28 ) )
( m497 ! )
CPU time : 0 . 0 2
∗
( describe
( a s s e r t member ∗ s t i r r u p 1
class ( build lex ” stirrup ”)
kn cat ” story ” ))
( m499 ! ( c l a s s ( m498 ( l e x s t i r r u p ) ) ) ( k n c a t s t o r y ) ( member b29 ) )
( m499 ! )
CPU time : 0 . 0 2
∗
( describe
( assert o b j e c t ∗ s t i r r u p 1
r e l ( build lex ” stirrup ”)
p o s s e s s o r ∗KA
kn cat ” story ” ))
( m500 ! ( k n c a t s t o r y ) ( o b j e c t b29 ) ( p o s s e s s o r b3 ) ( r e l ( m498 ( l e x s t i r r u p ) ) ) )
( m500 ! )
194
CPU time : 0 . 0 1
∗
( describe
( as se r t min 0
max 0
arg ( build agent ∗ Tris
act ( build a c ti o n ( build l e x ” hold ” )
object ∗ stirrup1 ))
k n c a t ” story−comp ” ) )
( m501 ! ( min 0 ) (max 0 )
( a r g ( m495 ( a c t ( m494 ( a c t i o n ( m493 ( l e x h o l d ) ) ) ( o b j e c t b29 ) ) ) ( a g e n t b11 ) ) )
( k n c a t story−comp ) )
( m501 ! )
CPU time : 0 . 0 1
∗
( clear−infer )
( Node a c t i v a t i o n c l e a r e d . Some r e g i s t e r i n f o r m a t i o n r e t a i n e d . )
CPU time : 0 . 3 3
∗
; ; King Arthur l e a p s from h i s h o r s e
( describe
( add
a g e n t ∗KA
a c t ( b u i l d a c t i o n ( b u i l d l e x ” l e a p from ” )
o b j e c t #horsx )
time ∗ h2
kn cat ” story ” ))
8 5 2 8 7 3 6 b y t e s have been t e n u r e d , next gc w i l l be g l o b a l .
See t h e documentation f o r v a r i a b l e e x c l : ∗ g l o b a l − g c − b e h a v i o r ∗ f o r more i n f o r m a t i o n .
( m707 ! ( c l a s s ( m144 ( l e x a c t i o n ) ) ) ( member ( m116 ( l e x r i d e ) ) ) )
( m706 ! ( a c t ( m703 ( a c t i o n ( m116 ) ) ) ) ( a g e n t ( m459 ( a2 b24 ) ( s k f r i d e r − o f ) ) ) )
( m705 ! ( a c t ( m701 ( a c t i o n ( m116 ) ) ( o b j e c t b24 ) ) ) ( a g e n t ( m459 ) ) )
( m704 ! ( a c t ( m703 ) ) ( a g e n t b23 ) )
( m702 ! ( a c t ( m701 ) ) ( a g e n t b23 ) )
( m700 ! ( a f t e r ( m699 ( a3 b20 ) ( s k f time−at ) ) ) ( b e f o r e b18 ) )
( m698 ! ( e q u i v ( m459 ) b23 ) )
( m688 ! ( min 0 ) (max 0 )
( a r g ( m687 ( a c t ( m686 ( a c t i o n ( m493 ( l e x h o l d ) ) ) ) ) ( a g e n t b11 ) ) ) )
( m685 ! ( min 0 ) (max 0 )
( a r g ( m495 ( a c t ( m494 ( a c t i o n ( m493 ) ) ( o b j e c t b29 ) ) ) ( a g e n t b11 ) ) ) )
( m684 ! ( c l a s s ( m37 ( l e x phys o b j ) ) ) ( member b24 ) )
( m683 ! ( c l a s s ( m18 ( l e x animal ) ) ) ( member b24 ) )
( m652 ! ( c l a s s ( m144 ) ) ( member ( m492 ( l e x t r y ) ) ) )
( m651 ! ( a c t ( m650 ( a c t i o n ( m492 ) ) ) ) ( a g e n t b11 ) )
( m649 ! ( c l a s s ( m144 ) ) ( member ( m486 ( l e x a r r i v e ) ) ) )
( m648 ! ( a c t ( m647 ( a c t i o n ( m486 ) ) ) ) ( a g e n t b3 ) )
( m646 ! ( c l a s s ( m144 ) ) ( member ( m480 ( l e x t a k e ) ) ) )
( m645 ! ( a c t ( m644 ( a c t i o n ( m480 ) ) ) ) ( a g e n t b3 ) )
( m643 ! ( c l a s s ( m144 ) ) ( member ( m187 ( l e x mount ) ) ) )
195
( m642 ! ( a c t ( m641 ( a c t i o n ( m187 ) ) ) ) ( a g e n t b23 ) )
( m640 ! ( a c t ( m385 ( a c t i o n ( m212 ( l e x l e a p onto ) ) ) ( o b j e c t b20 ) ) ) ( a g e n t b19 )
( time b18 ) )
( m639 ! ( o b j e c t b29 ) ( r e l ( m498 ( l e x s t i r r u p ) ) ) )
( m638 ! ( o b j e c t b27 ) ( r e l ( m182 ( l e x p a v i l i o n ) ) ) )
( m602 ! ( o b j e c t b25 ) ( p r o p e r t y ( m104 ( l e x l i t t l e ) ) ) )
( m601 ! ( o b j e c t b24 ) ( p r o p e r t y ( m127 ( l e x ambling ) ) ) )
( m600 ! ( o b j e c t b22 ) ( p r o p e r t y ( m101 ( l e x s m a l l ) ) ) )
( m599 ! ( o b j e c t b20 ) ( p r o p e r t y ( m101 ) ) )
( m598 ! ( o b j e c t b17 ) ( p r o p e r t y ( m101 ) ) )
( m556 ! ( c l a s s ( m44 ( l e x k i n g ) ) ) ( member b19 ) )
( m555 ! ( c l a s s ( m24 ( l e x p e r s o n ) ) ) ( member b19 ) )
( m554 ! ( c l a s s ( m44 ) ) ( member b21 ) )
( m553 ! ( c l a s s ( m24 ) ) ( member b21 ) )
( m552 ! ( c l a s s ( m381 ( l e x hackney ) ) ) ( member b30 ) )
( m551 ! ( c l a s s ( m68 ( l e x k n i g h t ) ) ) ( member ( m459 ) ) )
( m550 ! ( c l a s s ( m24 ) ) ( member ( m459 ) ) )
( m549 ! ( c l a s s ( m68 ) ) ( member b23 ) )
( m548 ! ( c l a s s ( m24 ) ) ( member b23 ) )
( m547 ! ( c l a s s ( m381 ) ) ( member b24 ) )
( m546 ! ( c l a s s ( m381 ) ) ( member b25 ) )
( m545 ! ( c l a s s ( m183 ( l e x t e n t ) ) ) ( member b27 ) )
( m544 ! ( c l a s s ( m182 ) ) ( member b27 ) )
( m543 ! ( c l a s s ( m498 ) ) ( member b29 ) )
( m526 ! ( e q u i v b30 b17 ) )
( m525 ! ( c l a s s ( m144 ) ) ( member ( m217 ( l e x l e a p from ) ) ) )
( m512 ! ( a f t e r b28 ) ( b e f o r e b26 ) )
( m511 ! ( a f t e r b28 ) ( b e f o r e b18 ) )
( m510 ! ( l o c a t i o n ( m509 ( o b j e c t b30 ) ( s p − r e l ( m213 ( l e x on ) ) ) ) ) ( o b j e c t b3 )
( time ( m507 ( a4 b30 ) ( s k f time−at ) ) ) )
( m508 ! ( a f t e r b28 ) ( b e f o r e ( m507 ) ) )
( m506 ! ( a c t ( m502 ( a c t i o n ( m217 ) ) ( o b j e c t b30 ) ) ) ( a g e n t b3 ) ( time b28 ) )
( m505 ! ( a c t ( m504 ( a c t i o n ( m217 ) ) ) ) ( a g e n t b3 ) )
( m503 ! ( a c t ( m502 ) ) ( a g e n t b3 ) ( k n c a t s t o r y ) ( time b28 ) )
( m483 ! ( a f t e r b26 ) ( b e f o r e b18 ) )
( m451 ! ( a f t e r ( m450 ( a3 b22 ) ( s k f time−at ) ) ) ( b e f o r e b18 ) )
( m449 ! ( a c t ( m390 ( a c t i o n ( m212 ) ) ( o b j e c t b22 ) ) ) ( a g e n t b21 ) ( time b18 ) )
( m401 ! ( a c t ( m296 ( a c t i o n ( m212 ) ) ) ) ( a g e n t b21 ) )
( m400 ! ( a c t ( m296 ) ) ( a g e n t b19 ) )
( m399 ! ( c l a s s ( m381 ) ) ( member b17 ) )
( m398 ! ( c l a s s ( m381 ) ) ( member b20 ) )
( m397 ! ( c l a s s ( m381 ) ) ( member b22 ) )
( m384 ! ( o b j e c t ( m381 ) ) ( p r o p e r t y ( m220 ( l e x unknown ) ) ) )
( m316 ! ( f o r a l l v22 )
( ant ( p208 ( a c t ( m315 ( a c t i o n ( m165 ( l e x b e a r ) ) ) ) ) ( a g e n t v22 ) ) )
( cq ( p209 ( c l a s s ( m37 ) ) ( member v22 ) ) ) )
( m314 ! ( c l a s s ( m144 ) ) ( member ( m212 ) ) )
( m300 ! ( a f t e r ( m299 ( a3 b17 ) ( s k f time−at ) ) ) ( b e f o r e b18 ) )
( m298 ! ( a c t ( m294 ( a c t i o n ( m212 ) ) ( o b j e c t b17 ) ) ) ( a g e n t b3 ) ( time b18 ) )
( m297 ! ( a c t ( m296 ) ) ( a g e n t b3 ) )
( m293 ! ( c l a s s ( m209 ( l e x b r e a s t ) ) ) ( member ( m208 ( s k f b r e a s t − o f ) ) ) )
( m292 ! ( a c t ( m286 ( a c t i o n ( m158 ( l e x e a t ) ) ) ) ) ( a g e n t b12 ) )
( m291 ! ( a c t ( m286 ) ) ( a g e n t b15 ) )
( m290 ! ( a c t ( m163 ( a c t i o n ( m158 ) ) ( o b j e c t ( m162 ( l e x p l a n t ) ) ) ) ) ( a g e n t b12 ) )
( m289 ! ( a c t ( m163 ) ) ( a g e n t b15 ) )
( m288 ! ( c l a s s ( m144 ) ) ( member ( m158 ) ) )
( m287 ! ( a c t ( m286 ) ) ( a g e n t b1 ) )
( m285 ! ( a c t ( m160 ( a c t i o n ( m158 ) ) ( o b j e c t ( m159 ( l e x meat ) ) ) ) ) ( a g e n t b1 ) )
196
( m284 !
( m283 !
( m282 !
( m281 !
( m280 !
( m279 !
( m278 !
( m277 !
( m276 !
( m275 !
( m274 !
( m273 !
( m272 !
( m271 !
( m270 !
( m269 !
( m268 !
( m267 !
( m266 !
( m265 !
( m264 !
( m263 !
( m262 !
( m261 !
( m260 !
( m259 !
( m258 !
( m257 !
( m256 !
( m255 !
( m254 !
( m253 !
( m252 !
( m251 !
( m250 !
( m249 !
( m248 !
( m247 !
( m246 !
( m245 !
( m244 !
( m243 !
( m242 !
( m241 !
( m240 !
( m239 !
( m238 !
( m237 !
( m236 !
( m235 !
( m234 !
( m233 !
( m232 !
( m231 !
( m230 !
( m229 !
( m228 !
( m227 !
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
o b j e c t b15 ) ( r e l ( m82 ( l e x h o r s e ) ) ) )
o b j e c t b12 ) ( r e l ( m193 ( l e x pony ) ) ) )
o b j e c t b4 ) ( r e l ( m49 ( l e x sword ) ) ) )
o b j e c t ( m39 ( l e x Round Table ) ) ) ( r e l ( m40 ( l e x t a b l e ) ) ) )
o b j e c t b1 ) ( r e l ( m8 ( l e x dog ) ) ) )
c l a s s ( m37 ) ) ( member b1 ) )
c l a s s ( m35 ( l e x v e r t e b r a t e ) ) ) ( member b1 ) )
c l a s s ( m18 ) ) ( member b1 ) )
c l a s s ( m16 ( l e x p r e d a t o r ) ) ) ( member b1 ) )
c l a s s ( m14 ( l e x c a r n i v o r e ) ) ) ( member b1 ) )
c l a s s ( m12 ( l e x quadruped ) ) ) ( member b1 ) )
c l a s s ( m10 ( l e x mammal ) ) ) ( member b1 ) )
c l a s s ( m8 ) ) ( member b1 ) )
c l a s s ( m24 ) ) ( member b2 ) )
c l a s s ( m77 ( l e x f u r n i t u r e ) ) ) ( member ( m39 ) ) )
c l a s s ( m40 ) ) ( member ( m39 ) ) )
c l a s s ( m44 ) ) ( member b3 ) )
c l a s s ( m24 ) ) ( member b3 ) )
c l a s s ( m49 ) ) ( member b4 ) )
c l a s s ( m54 ( l e x w i z a r d ) ) ) ( member b5 ) )
c l a s s ( m24 ) ) ( member b5 ) )
c l a s s ( m44 ) ) ( member b6 ) )
c l a s s ( m24 ) ) ( member b6 ) )
c l a s s ( m44 ) ) ( member b7 ) )
c l a s s ( m24 ) ) ( member b7 ) )
c l a s s ( m44 ) ) ( member b8 ) )
c l a s s ( m24 ) ) ( member b8 ) )
c l a s s ( m68 ) ) ( member b9 ) )
c l a s s ( m24 ) ) ( member b9 ) )
c l a s s ( m68 ) ) ( member b10 ) )
c l a s s ( m24 ) ) ( member b10 ) )
c l a s s ( m68 ) ) ( member b11 ) )
c l a s s ( m24 ) ) ( member b11 ) )
c l a s s ( m89 ( l e x b a s i c c t g y ) ) ) ( member ( m24 ) ) )
c l a s s ( m89 ) ) ( member ( m8 ) ) )
c l a s s ( m89 ) ) ( member ( m82 ) ) )
c l a s s ( m89 ) ) ( member ( m2 ( l e x d e e r ) ) ) )
c l a s s ( m89 ) ) ( member ( m80 ( l e x c h a i r ) ) ) )
c l a s s ( m89 ) ) ( member ( m40 ) ) )
c l a s s ( m97 ( l e x c o l o r ) ) ) ( member ( m96 ( l e x w h i t e ) ) ) )
c l a s s ( m97 ) ) ( member ( m99 ( l e x b l a c k ) ) ) )
c l a s s ( m102 ( l e x s i z e ) ) ) ( member ( m101 ) ) )
c l a s s ( m102 ) ) ( member ( m106 ( l e x l a r g e ) ) ) )
c l a s s ( m111 ( l e x v a l u e ) ) ) ( member ( m110 ( l e x good ) ) ) )
c l a s s ( m111 ) ) ( member ( m113 ( l e x bad ) ) ) )
c l a s s ( m193 ) ) ( member b12 ) )
c l a s s ( m118 ( l e x e q u i n e ) ) ) ( member b12 ) )
c l a s s ( m37 ) ) ( member b12 ) )
c l a s s ( m35 ) ) ( member b12 ) )
c l a s s ( m28 ( l e x h e r b i v o r e ) ) ) ( member b12 ) )
c l a s s ( m18 ) ) ( member b12 ) )
c l a s s ( m12 ) ) ( member b12 ) )
c l a s s ( m10 ) ) ( member b12 ) )
c l a s s ( m24 ) ) ( member b14 ) )
c l a s s ( m118 ) ) ( member b15 ) )
c l a s s ( m82 ) ) ( member b15 ) )
c l a s s ( m37 ) ) ( member b15 ) )
c l a s s ( m35 ) ) ( member b15 ) )
197
( m226 !
( m225 !
( m224 !
( m223 !
( m222 !
( m210 !
(
(
(
(
(
(
c l a s s ( m28 ) ) ( member b15 ) )
c l a s s ( m18 ) ) ( member b15 ) )
c l a s s ( m12 ) ) ( member b15 ) )
c l a s s ( m10 ) ) ( member b15 ) )
c l a s s ( m24 ) ) ( member b16 ) )
o b j e c t ( m208 ) ) ( r e l ( m209 ) ) )
( m707 !
m649 !
m598 !
m544 !
m449 !
m292 !
m278 !
m265 !
m252 !
m239 !
m226 !
m706 !
m648 !
m556 !
m543 !
m401 !
m291 !
m277 !
m264 !
m251 !
m238 !
m225 !
m705 !
m646 !
m555 !
m526 !
m400 !
m290 !
m276 !
m263 !
m250 !
m237 !
m224 !
m704 !
m645 !
m554 !
m525 !
m399 !
m289 !
m275 !
m262 !
m249 !
m236 !
m223 !
m702 !
m643 !
m553 !
m512 !
m398 !
m288 !
m274 !
m261 !
m248 !
m235 !
m222 !
m700 ! m698 !
m642 ! m640 !
m552 ! m551 !
m511 ! m510 !
m397 ! m384 !
m287 ! m285 !
m273 ! m272 !
m260 ! m259 !
m247 ! m246 !
m234 ! m233 !
m210 ! )
m688 !
m639 !
m550 !
m508 !
m316 !
m284 !
m271 !
m258 !
m245 !
m232 !
m685 !
m638 !
m549 !
m506 !
m314 !
m283 !
m270 !
m257 !
m244 !
m231 !
m684 !
m602 !
m548 !
m505 !
m300 !
m282 !
m269 !
m256 !
m243 !
m230 !
m683 !
m601 !
m547 !
m503 !
m298 !
m281 !
m268 !
m255 !
m242 !
m229 !
m652 !
m600 !
m546 !
m483 !
m297 !
m280 !
m267 !
m254 !
m241 !
m228 !
m651 !
m599 !
m545 !
m451 !
m293 !
m279 !
m266 !
m253 !
m240 !
m227 !
CPU time : 4 7 . 5 9
∗
; ; King Arthur l e a p s onto t h e ground
( describe
( add a g e n t ∗KA
a c t ( b u i l d a c t i o n ( b u i l d l e x ” l e a p onto ” )
o b j e c t ( b u i l d l e x ” ground ” ) )
time ∗ h2
kn cat ” story ” ))
( m760 !
( m758 !
( time
( m757 !
( m297 !
( a f t e r ( m759 ( a3 ( m755 ( l e x ground ) ) ) ( s k f time−at ) ) ) ( b e f o r e b28 ) )
( a c t ( m756 ( a c t i o n ( m212 ( l e x l e a p onto ) ) ) ( o b j e c t ( m755 ) ) ) ) ( a g e n t b3 )
b28 ) )
( a c t ( m756 ) ) ( a g e n t b3 ) ( k n c a t s t o r y ) ( time b28 ) )
( a c t ( m296 ( a c t i o n ( m212 ) ) ) ) ( a g e n t b3 ) )
( m760 ! m758 ! m757 ! m297 ! )
CPU time : 0 . 4 0
∗
( describe
( a sse r t member ∗ h o r s x
c l a s s ( build lex ” horse ” )
kn cat ” story ” ))
( m761 ! ( c l a s s ( m82 ( l e x h o r s e ) ) ) ( k n c a t s t o r y ) ( member b30 ) )
( m761 ! )
CPU time : 0 . 0 1
∗
( describe
( a sse r t o b j e c t ∗ h o r s x
p o s s e s s o r ∗KA
r e l ( build lex ” horse ” )
kn cat ” story ” ))
198
( m762 ! ( k n c a t s t o r y ) ( o b j e c t b30 ) ( p o s s e s s o r b3 ) ( r e l ( m82 ( l e x h o r s e ) ) ) )
( m762 ! )
CPU time : 0 . 0 0
∗
( describe
( as s ert e q u i v ( b u i l d s k f ” r i d e r − o f ”
a2 ∗ h o r s x )
e q u i v ∗KA k n c a t ” story−comp ” ) )
( m764 ! ( e q u i v ( m763 ( a2 b30 ) ( s k f r i d e r − o f ) ) b3 ) ( k n c a t story−comp ) )
( m764 ! )
CPU time : 0 . 0 1
∗
( describe
( assert c a u s e ( b u i l d a g e n t ∗KA
a c t ( b u i l d a c t i o n ( b u i l d l e x ” l e a p onto ” )
o b j e c t ( b u i l d l e x ” ground ” ) )
time ∗ h2 )
e f f e c t ( b u i l d min 0
max 0
arg ( build agent ∗ Tris
act ( build a c t i o n ( build l e x ” hold ” )
object ∗ stirrup1 )))
k n c a t ” story−comp ” ) )
( m765 !
( cause
( m758 !
( a c t ( m756 ( a c t i o n ( m212 ( l e x l e a p onto ) ) ) ( o b j e c t ( m755 ( l e x ground ) ) ) ) )
( a g e n t b3 ) ( time b28 ) ) )
( effect
( m685 ! ( min 0 ) (max 0 )
( arg
( m495 ( a c t ( m494 ( a c t i o n ( m493 ( l e x h o l d ) ) ) ( o b j e c t b29 ) ) ) ( a g e n t b11 ) ) ) ) )
( k n c a t story−comp ) )
( m765 ! )
CPU time : 0 . 0 2
∗
; ; ; What i s a hackney ?
ˆ(
−−> defineNoun ’ hackney )
D e f i n i t i o n o f hackney :
P o s s i b l e C l a s s I n c l u s i o n s : mammal , h o r s e ,
Possible Actions : eat plant ,
P o s s i b l e P r o p e r t i e s : ambling , l i t t l e , s m a l l ,
P o s s e s s i v e : person horse , king horse ,
nil
199
CPU time : 3 7 . 4 8
∗
; ; ; Then t h e o l d k n i g h t to ok a l i t t l e hackney and r o d e f o r S i r Palomides
; ; ; and brought him t o h i s own manor . [ p . 3 2 7 ]
; ; ; The o l d k n i g h t too k a l i t t l e hackney .
( describe
( as se r t a g e n t #hkn1
act ( build action ( build lex ” take ” )
o b j e c t #hack6 )
time #h3
kn cat ” story ” ))
( m846 ! ( a c t ( m845 ( a c t i o n ( m480 ( l e x t a k e ) ) ) ( o b j e c t b32 ) ) ) ( a g e n t b31 )
( k n c a t s t o r y ) ( time b33 ) )
( m846 ! )
CPU time : 0 . 0 0
∗
( describe
( as se r t member ∗ hkn1
c l a s s ( build lex ” knight ” )
kn cat ” story ” ))
( m847 ! ( c l a s s ( m68 ( l e x k n i g h t ) ) ) ( k n c a t s t o r y ) ( member b31 ) )
( m847 ! )
CPU time : 0 . 0 2
∗
( describe
( a sse r t o b j e c t ∗ hkn1
property ( build lex ” old ” )
kn cat ” story ” ))
( m848 ! ( k n c a t s t o r y ) ( o b j e c t b31 ) ( p r o p e r t y ( m178 ( l e x o l d ) ) ) )
( m848 ! )
CPU time : 0 . 0 1
∗
( describe
( as s ert o b j e c t ∗ hack6
property ( build lex ” l i t t l e ” )
kn cat ” story ” ))
( m849 ! ( k n c a t s t o r y ) ( o b j e c t b32 ) ( p r o p e r t y ( m104 ( l e x l i t t l e ) ) ) )
( m849 ! )
200
CPU time : 0 . 0 0
∗
( describe
( as se r t member ∗ hack6
c l a s s ( b u i l d l e x ” hackney ” )
kn cat ” story ” ))
( m850 ! ( c l a s s ( m381 ( l e x hackney ) ) ) ( k n c a t s t o r y ) ( member b32 ) )
( m850 ! )
CPU time : 0 . 0 2
∗
; ; ; The o l d k n i g h t r o d e t o S i r Palomides .
( describe
( a sse r t a g e n t ∗ hkn1
act ( build action ( build lex ” ride ” )
t o # Palomides
time #h4 )
kn cat ” story ” ))
( m852 ! ( a c t ( m851 ( a c t i o n ( m116 ( l e x r i d e ) ) ) ( time b35 ) ( t o b34 ) ) ) ( a g e n t b31 )
( kn cat story ))
( m852 ! )
CPU time : 0 . 0 1
∗
( describe
( a ss er t e q u i v ( b u i l d s k f ” r i d e r − o f ”
a2 ∗ hack6 )
e q u i v ∗ hkn1
k n c a t ” story−comp ” ) )
( m854 ! ( e q u i v ( m853 ( a2 b32 ) ( s k f r i d e r − o f ) ) b31 ) ( k n c a t story−comp ) )
( m854 ! )
CPU time : 0 . 0 1
∗
( describe
( assert b e f o r e ∗ h2
a f t e r ∗ h3
k n c a t ” story−comp ” ) )
( m855 ! ( a f t e r b33 ) ( b e f o r e b28 ) ( k n c a t story−comp ) )
( m855 ! )
CPU time : 0 . 0 0
∗
201
( describe
( a sse r t b e f o r e ∗ h3
a f t e r ∗ h4
k n c a t ” story−comp ” ) )
( m856 ! ( a f t e r b35 ) ( b e f o r e b33 ) ( k n c a t story−comp ) )
( m856 ! )
CPU time : 0 . 0 1
∗
( describe
( a sse r t o b j e c t ∗ Palomides
proper−name ( b u i l d l e x ” S i r Palomides ” )
kn cat ” story ” ))
( m858 ! ( k n c a t s t o r y ) ( o b j e c t b34 ) ( proper−name ( m857 ( l e x S i r Palomides ) ) ) )
( m858 ! )
CPU time : 0 . 0 1
∗
( describe
( a sse r t member ∗ Palomides
c l a s s ( build lex ” knight ” )
k n c a t ” story−comp ” ) )
( m859 ! ( c l a s s ( m68 ( l e x k n i g h t ) ) ) ( k n c a t story−comp ) ( member b34 ) )
( m859 ! )
CPU time : 0 . 0 1
∗
; ; ; What i s a hackney ?
ˆ(
−−> defineNoun ’ hackney )
D e f i n i t i o n o f hackney :
Possible Class In clus io ns : horse ,
Possible Actions : eat plant ,
P o s s i b l e P r o p e r t i e s : ambling , l i t t l e , s m a l l ,
P os s e s s iv e : person horse , king horse ,
nil
CPU time : 2 9 9 . 5 0
∗
; ; ; As soon a s t h e s q u i r e heard t h e s e words , he a l i g h t e d from h i s hackney
; ; ; and k n e e l e d down a t Galahad ’ s f e e t , and prayed him t h a t he might go with
; ; ; him t i l he had made him a k n i g h t . [ p . 3 3 5 ]
; ; ; The s q u i r e a l i g h e d from h i s hackney .
( describe
202
( a sse r t a g e n t # s q u i r e 1
act ( build action ( build lex ” a l i g h t ” )
from #hack7 )
kn cat ” story ” ))
( m944 ! ( a c t ( m943 ( a c t i o n ( m942 ( l e x a l i g h t ) ) ) ( from b37 ) ) ) ( a g e n t b36 )
( kn cat story ))
( m944 ! )
CPU time : 0 . 0 3
∗
( describe
( a ss er t member ∗ s q u i r e 1
class ( build lex ” squire ”)
kn cat ” story ” ))
( m945 ! ( c l a s s ( m154 ( l e x s q u i r e ) ) ) ( k n c a t s t o r y ) ( member b36 ) )
( m945 ! )
CPU time : 0 . 0 2
∗
( describe
( a sse r t member ∗ hack7
c l a s s ( b u i l d l e x ” hackney ” )
kn cat ” story ” ))
( m946 ! ( c l a s s ( m381 ( l e x hackney ) ) ) ( k n c a t s t o r y ) ( member b37 ) )
( m946 ! )
CPU time : 0 . 0 2
∗
( describe
( a sse r t o b j e c t ∗ hack7
possessor ∗ squire1
r e l ( b u i l d l e x ” hackney ” )
kn cat ” story ” ))
( m947 ! ( k n c a t s t o r y ) ( o b j e c t b37 ) ( p o s s e s s o r b36 ) ( r e l ( m381 ( l e x hackney ) ) ) )
( m947 ! )
CPU time : 0 . 0 1
∗
; ; ; What i s a hackney ?
ˆ(
−−> defineNoun ’ hackney )
D e f i n i t i o n o f hackney :
Class Inclu sion s : horse ,
Possible Actions : eat plant ,
203
P o s s i b l e P r o p e r t i e s : ambling , l i t t l e , s m a l l ,
P os s e s s iv e : person horse , king horse , s q u i r e ,
P o s s i b l y S i m i l a r Items : pony ,
nil
CPU time : 6 4 . 8 7
∗
; ; ; [ S i r P e r c i v a l ] met a yeoman r i d i n g upon a hackney who l e d i n h i s hand
; ; ; a g r e a t s t e e d , b l a c k e r than any b e r r y .
( describe
( as ser t a g e n t # P e r c i
a c t ( b u i l d a c t i o n ( b u i l d l e x ” meet ” )
o b j e c t #hyeo1 )
time #h5
kn cat ” story ” ))
( m986 ! ( a c t ( m985 ( a c t i o n ( m984 ( l e x meet ) ) ) ( o b j e c t b39 ) ) ) ( a g e n t b38 )
( k n c a t s t o r y ) ( time b40 ) )
( m986 ! )
CPU time : 0 . 0 5
∗
( describe
( a ss er t member ∗ P e r c i
c l a s s ( build lex ” knight ” )
k n c a t ” story−comp ” ) )
( m987 ! ( c l a s s ( m68 ( l e x k n i g h t ) ) ) ( k n c a t story−comp ) ( member b38 ) )
( m987 ! )
CPU time : 0 . 0 1
∗
( describe
( a sse r t o b j e c t ∗ P e r c i
proper−name ( b u i l d l e x ” S i r P e r c i v a l ” )
kn cat ” story ” ))
( m989 ! ( k n c a t s t o r y ) ( o b j e c t b38 ) ( proper−name ( m988 ( l e x S i r P e r c i v a l ) ) ) )
( m989 ! )
CPU time : 0 . 0 2
∗
( describe
( a sse r t member ∗ hyeo1
c l a s s ( b u i l d l e x ”yeoman” )
kn cat ” story ” ))
( m990 ! ( c l a s s ( m156 ( l e x yeoman ) ) ) ( k n c a t s t o r y ) ( member b39 ) )
204
( m990 ! )
CPU time : 0 . 0 1
∗
( describe ( a s s e r t b e f o r e ∗ h4
a f t e r ∗ h5
k n c a t ” story−comp ” ) )
( m991 ! ( a f t e r b40 ) ( b e f o r e b35 ) ( k n c a t story−comp ) )
( m991 ! )
CPU time : 0 . 0 2
∗
; ; ; The yeoman was r i d i n g a hackney
( describe
( a sse r t a g e n t ∗ hyeo1
act ( build action ( build lex ” ride ” )
o b j e c t #hack8 )
time ∗ h5
kn cat ” story ” ))
( m993 ! ( a c t ( m992 ( a c t i o n ( m116 ( l e x r i d e ) ) ) ( o b j e c t b41 ) ) ) ( a g e n t b39 )
( k n c a t s t o r y ) ( time b40 ) )
( m993 ! )
CPU time : 0 . 0 2
∗
( describe
( a ss er t member ∗ hack8
c l a s s ( b u i l d l e x ” hackney ” )
kn cat ” story ” ))
( m994 ! ( c l a s s ( m381 ( l e x hackney ) ) ) ( k n c a t s t o r y ) ( member b41 ) )
( m994 ! )
CPU time : 0 . 0 2
∗
; ; ; The yeoman was l e a d i n g a g r e a t b l a c k s t e e d .
( describe
( a sse r t a g e n t ∗ hyeo1
act ( build action ( build lex ” lead ” )
object #blksteed1 )
time ∗ h5
kn cat ” story ” ))
( m997 ! ( a c t ( m996 ( a c t i o n ( m995 ( l e x l e a d ) ) ) ( o b j e c t b42 ) ) ) ( a g e n t b39 )
( k n c a t s t o r y ) ( time b40 ) )
205
( m997 ! )
CPU time : 0 . 0 3
∗
( describe
( a sse r t member ∗ b l k s t e e d 1
class ( build lex ” steed ”)
kn cat ” story ” ))
( m999 ! ( c l a s s ( m998 ( l e x s t e e d ) ) ) ( k n c a t s t o r y ) ( member b42 ) )
( m999 ! )
CPU time : 0 . 0 2
∗
( describe
( a sse r t o b j e c t ∗ b l k s t e e d 1
property ( build lex ” great ” )
property ( build lex ” black ” )
kn cat ” story ” ))
( m1001 ! ( k n c a t s t o r y ) ( o b j e c t b42 )
( p r o p e r t y ( m1000 ( l e x g r e a t ) ) ( m99 ( l e x b l a c k ) ) ) )
( m1001 ! )
CPU time : 0 . 0 2
∗
; ; ; [ A knight s t o l e the steed ]
( describe
( a sse r t a g e n t # t h f k n t
act ( build action ( build lex ” s t e a l ” )
object ∗ blksteed1 )
time #h6
kn cat ” story ” ))
( m1004 ! ( a c t ( m1003 ( a c t i o n ( m1002 ( l e x s t e a l ) ) ) ( o b j e c t b42 ) ) ) ( a g e n t b43 )
( k n c a t s t o r y ) ( time b44 ) )
( m1004 ! )
CPU time : 0 . 0 2
∗
( describe ( a s s er t b e f o r e ∗ h5
a f t e r ∗ h6
k n c a t ” story−comp ” ) )
( m1005 ! ( a f t e r b44 ) ( b e f o r e b40 ) ( k n c a t story−comp ) )
( m1005 ! )
CPU time : 0 . 0 2
206
∗
( describe
( as se r t member ∗ t h f k n t
c l a s s ( build lex ” knight ” )
kn cat ” story ” ))
( m1006 ! ( c l a s s ( m68 ( l e x k n i g h t ) ) ) ( k n c a t s t o r y ) ( member b43 ) )
( m1006 ! )
CPU time : 0 . 0 0
∗
;;;
;;;
;;;
;;;
’ Well , ’ s a i d S i r P e r c i v a l , ’ what w o u l d s t thou t h a t I d i d ? Thou s e e s t
w e l l t h a t I am on f o o t , but i f I had a good h o r s e I s h o u l d soon b r i n g
him back . ’ ; S i r , ’ s a i d t h e yeoman , ’ t a k e my hackney and do t h e b e s t ye
can , and I s h a l l f o l l o w you on f o o t t o know how ye s h a l l s p e e d . ’
( describe
( a sse r t a g e n t ∗ hyeo1
act ( build action ( build lex ” address ” )
object ∗ Perci )
time #h7
k n c a t ” story−comp ” ) )
( m1009 ! ( a c t ( m1008 ( a c t i o n ( m1007 ( l e x a d d r e s s ) ) ) ( o b j e c t b38 ) ) ) ( a g e n t b39 )
( k n c a t story−comp ) ( time b45 ) )
( m1009 ! )
CPU time : 0 . 0 4
∗
; ; ; The yeoman asked t h a t S i r P e r c i v a l t a k e t h e hackney and t h a t he t r y
; ; ; to catch the knight .
( describe
( as se rt a g e n t ∗ hyeo1
a c t ( b u i l d a c t i o n ( b u i l d l e x ” ask t h a t ” )
o b j e c t ( build agent ∗ Perci
act ( build action
object
o b j e c t ( build agent ∗ Perci
act ( build action
object
time ∗ h7
kn cat ” story ” ))
( m1019 !
( a c t ( m1018 ( a c t i o n ( m1010 ( l e x ask t h a t ) ) )
( object
( m1017
( a c t ( m1016 ( a c t i o n ( m492 ( l e x t r y ) ) )
( object
207
( build lex ” take ” )
∗ hack8 ) )
( build lex ” try ”)
( build agent ∗ Perci
act ( build action
( build lex ” catch ” )
object ∗ thf knt ) ) ) ) )
( m1015 ( a c t ( m1014 ( a c t i o n ( m1013 ( l e x c a t c h ) ) ) ( o b j e c t b43 ) ) )
( a g e n t b38 ) ) ) ) )
( a g e n t b38 ) )
( m1012 ( a c t ( m1011 ( a c t i o n ( m480 ( l e x t a k e ) ) ) ( o b j e c t b41 ) ) )
( a g e n t b38 ) ) ) ) )
( a g e n t b39 ) ( k n c a t s t o r y ) ( time b45 ) )
( m1019 ! )
CPU time : 0 . 0 7
∗
( describe
( a s s e r t b e f o r e ∗ h6
a f t e r ∗ h7
k n c a t ” story−comp ” ) )
( m1020 ! ( a f t e r b45 ) ( b e f o r e b44 ) ( k n c a t story−comp ) )
( m1020 ! )
CPU time : 0 . 0 2
∗
;;;
;;;
;;;
;;;
;;;
Then S i r P e r c i v a l b e s t r o d e t h e hackney and r o d e a s f a s t a s he might ,
and a t l a s t he saw t h e k n i g h t . Then he c r i e d , ’ Knight , t u r n back ! ’
He t u r n e d and s e t h i s s p e a r toward S i r P e r c i v a l , and smote t h e hackney
i n t h e middle o f t h e b r e a s t , s o t h a t i t f e l l down dead t o t h e e a r t h .
[ pp . 5 5 2 − 5 5 3 ]
; ; ; S i r P e r c i v a l b e s t r o d e t h e hackney
( describe
( a sse r t a g e n t ∗ P e r c i
act ( build action ( build lex ” bestride ” )
o b j e c t ∗ hack8 )
time #h8
kn cat ” story ” ))
( m1023 ! ( a c t ( m1022 ( a c t i o n ( m1021 ( l e x b e s t r i d e ) ) ) ( o b j e c t b41 ) ) ) ( a g e n t b38 )
( k n c a t s t o r y ) ( time b46 ) )
( m1023 ! )
CPU time : 0 . 0 3
∗
( describe
( a ss er t b e f o r e ∗ h7
a f t e r ∗ h8
k n c a t ” story−comp ” ) )
( m1024 ! ( a f t e r b46 ) ( b e f o r e b45 ) ( k n c a t story−comp ) )
( m1024 ! )
CPU time : 0 . 0 1
208
∗
( describe
( as se r t a g e n t ∗ P e r c i
act ( build action ( build lex ” ride ” )
o b j e c t ∗ hack8 )
manner ( b u i l d l e x ” f a s t ” )
time ∗ h8
kn cat ” story ” ))
( m1026 ! ( a c t ( m992 ( a c t i o n ( m116 ( l e x r i d e ) ) ) ( o b j e c t b41 ) ) ) ( a g e n t b38 )
( k n c a t s t o r y ) ( manner ( m1025 ( l e x f a s t ) ) ) ( time b46 ) )
( m1026 ! )
CPU time : 0 . 0 2
∗
; ; ; The t h i e v i n g k n i g h t s e t h i s s p e a r toward S i r P e r c i v a l .
( describe
( ass ert a g e n t ∗ t h f k n t
act ( build action ( build lex ” set ” )
object #aspear )
direction ∗ Perci
time #h9
kn cat ” story ” ))
( m1029 ! ( a c t ( m1028 ( a c t i o n ( m1027 ( l e x set ) ) ) ( o b j e c t b47 ) ) ) ( a g e n t b43 )
( d i r e c t i o n b38 ) ( k n c a t s t o r y ) ( time b48 ) )
( m1029 ! )
CPU time : 0 . 0 6
∗
( describe
( a s s e r t b e f o r e ∗ h8
a f t e r ∗ h9
k n c a t ” story−comp ” ) )
( m1030 ! ( a f t e r b48 ) ( b e f o r e b46 ) ( k n c a t story−comp ) )
( m1030 ! )
CPU time : 0 . 0 2
∗
( describe
( a sse r t member ∗ a s p e a r
c l a s s ( build lex ” spear ” )
kn cat ” story ” ))
( m1031 ! ( c l a s s ( m147 ( l e x s p e a r ) ) ) ( k n c a t s t o r y ) ( member b47 ) )
( m1031 ! )
CPU time : 0 . 0 2
209
∗
( describe
( as se r t o b j e c t ∗ a s p e a r
possessor ∗ thf knt
r e l ( build lex ” spear ” )
kn cat ” story ” ))
( m1032 ! ( k n c a t s t o r y ) ( o b j e c t b47 ) ( p o s s e s s o r b43 ) ( r e l ( m147 ( l e x s p e a r ) ) ) )
( m1032 ! )
CPU time : 0 . 0 2
∗
; ; ; The k n i g h t smote t h e hackney i n t h e b r e a s t
( describe
( a sse r t a g e n t ∗ t h f k n t
act ( build action ( build lex ” smite ” )
o b j e c t ∗ hack8 )
location #loc1
time #h10
kn cat ” story ” ))
( m1035 ! ( a c t ( m1034 ( a c t i o n ( m1033 ( l e x s m i t e ) ) ) ( o b j e c t b41 ) ) ) ( a g e n t b43 )
( k n c a t s t o r y ) ( l o c a t i o n b49 ) ( time b50 ) )
( m1035 ! )
CPU time : 0 . 0 4
∗
( describe
( as se r t member ∗ l o c 1
class ( build lex ” breast ”)
kn cat ” story ” ))
( m1036 ! ( c l a s s ( m209 ( l e x b r e a s t ) ) ) ( k n c a t s t o r y ) ( member b49 ) )
( m1036 ! )
CPU time : 0 . 0 2
∗
( describe
( a sse r t o b j e c t ∗ l o c 1
p o s s e s s o r ∗ hack8
r e l ( build lex ” breast ”)
kn cat ” story ” ))
( m1037 ! ( k n c a t s t o r y ) ( o b j e c t b49 ) ( p o s s e s s o r b41 ) ( r e l ( m209 ( l e x b r e a s t ) ) ) )
( m1037 ! )
CPU time : 0 . 0 3
∗
( describe
210
( a sse r t p a r t ∗ l o c 1
whole ∗ hack8
k n c a t ” story−comp ” ) )
( m1038 ! ( k n c a t story−comp ) ( p a r t b49 ) ( whole b41 ) )
( m1038 ! )
CPU time : 0 . 0 2
∗
( describe
( as se r t b e f o r e ∗ h9
a f t e r ∗ h10
k n c a t ” story−comp ” ) )
( m1039 ! ( a f t e r b50 ) ( b e f o r e b48 ) ( k n c a t story−comp ) )
( m1039 ! )
CPU time : 0 . 0 2
∗
; ; ; The hackney f e l l t o t h e e a r t h
( describe
( a sse r t o b j e c t ∗ hack8
act ( build action ( build lex ” f a l l ” )
to ( build l e x ” earth ” )
time ∗ h10 )
kn cat ” story ” ))
( m1043 !
( a c t ( m1042 ( a c t i o n ( m1040 ( l e x f a l l ) ) ) ( time b50 ) ( t o ( m1041 ( l e x e a r t h ) ) ) ) )
( k n c a t s t o r y ) ( o b j e c t b41 ) )
( m1043 ! )
CPU time : 0 . 0 3
∗
;;;
I t was dead
( describe
( as se rt o b j e c t ∗ hack8
p r o p e r t y ( b u i l d l e x ” dead ” )
time ∗ h10
kn cat ” story ” ))
( m1045 ! ( k n c a t s t o r y ) ( o b j e c t b41 ) ( p r o p e r t y ( m1044 ( l e x dead ) ) ) ( time b50 ) )
( m1045 ! )
CPU time : 0 . 0 3
∗
; ; ; What i s a hackney ?
211
ˆ(
−−> defineNoun ’ hackney )
D e f i n i t i o n o f hackney :
Class Inclus ion s : horse ,
Possible Structure : breast ,
Possible Actions : eat plant ,
P o s s i b l e P r o p e r t i e s : dead , ambling , l i t t l e , s m a l l ,
P os s e s s iv e : person horse , king horse , s q u i r e ,
P o s s i b l y S i m i l a r Items : pony ,
nil
CPU time : 5 1 . 5 1
∗
End o f / p r o j e c t s / s t n 2 /CVA/demos/ hackney . demo d e m o n s t r a t i o n .
CPU time : 5 4 2 . 4 4
∗
B.4
Joust
==============================================================
S t a r t i n g image ‘ / u t i l / a c l 6 2 / composer ’
with no arguments
i n directory ‘ / p r o j e c t s / s t n 2 /CVA/ ’
on machine ‘ l o c a l h o s t ’ .
I n t e r n a t i o n a l A l l e g r o CL E n t e r p r i s e E d i t i o n
6 . 2 [ S o l a r i s ] ( Aug 1 5 , 2 0 0 2 1 4 : 2 4 )
C o p y r ig h t ( C) 1 9 8 5 − 2 0 0 2 , Franz I n c . , B e r k e l e y , CA , USA .
A l l R i g h t s Reserved .
This development copy o f A l l e g r o CL i s l i c e n s e d t o :
[ 4 5 4 9 ] SUNY/ B u f f a l o , N . Campus
; ; O p t i m i z a t i o n s e t t i n g s : s a f e t y 1 , s p a c e 1 , s p e e d 1 , debug 2 .
; ; For a c o m p l e t e d e s c r i p t i o n o f a l l c o m p i l e r s w i t c h e s g i v e n t h e c u r r e n t
; ; optimization s e t t i n g s evaluate ( explain−compiler−settings ) .
;;−−−
; ; Current r e a d e r c a s e mode : : c a s e − s e n s i t i v e − l o w e r
cl−user ( 1 ) : : ld lna
; Loading / p r o j e c t s / s t n 2 /CVA/ l n a . c l
;
Loading / p r o j e c t s / s n w i z / b i n / s n e p s . l i s p
Loading system SNePS...10% 20% 30% 40% 50% 60% 70% 80% 90% 100%
SNePS−2 . 6 [ PL : 0 a 2 0 0 2 / 0 9 / 3 0 2 2 : 3 7 : 4 6 ] l o a d e d .
Type ‘ ( s n e p s ) ’ or ‘ ( s n e p s l o g ) ’ t o get s t a r t e d .
;
Loading / p r o j e c t s / s t n 2 /CVA/ defun noun . c l
;
Loading / p r o j e c t s / s t n 2 /CVA/ d e f u n v e r b . c l
Welcome t o SNePS−2 . 6 [ PL : 0 a 2 0 0 2 / 0 9 / 3 0 2 2 : 3 7 : 4 6 ]
C o p y r i g h t ( C) 1984−−2002 by R e s e a r c h Foundation o f
S t a t e U n i v e r s i t y o f New York . SNePS comes with ABSOLUTELY NO WARRANTY!
Type ‘ ( c o p y r i g h t ) ’ f o r d e t a i l e d c o p y r i g h t i n f o r m a t i o n .
Type ‘ ( demo ) ’ f o r a l i s t o f example a p p l i c a t i o n s .
4/21/2003 10:49:52
212
∗ ( demo ”demos/ j o u s t . demo” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ j o u s t . demo i s now t h e s o u r c e o f i n p u t .
CPU time : 0 . 0 1
∗ ; ; J o u s t Demo − o r i g i n a l l y c r e a t e d by K . E h r l i c h
;;
− m o d i f i e d by S . N a p i e r a l s k i
; ; clear all info
( resetnet t )
Net r e s e t
CPU time : 0 . 0 0
∗
; ; t u r n o f f s i n g u l a r path i n f e r e n c e
ˆ(
−−> in−package s n i p )
#<The s n i p package>
CPU time : 0 . 0 1
∗
; ; ; r e d e f i n e function to return n i l
; ; ; s o t h a t f o r w a r d i n f e r e n c e w i l l not be l i m i t e d
ˆ(
−−> defun b r o a d ca s t− o n e − re p or t ( r e p )
( let ( anysent )
( do . c h s e t ( ch ∗OUTGOING−CHANNELS∗ a n y s e n t )
(when ( i s o p e n . ch ch )
( s e t q a n y s e n t ( or ( try−to−send−report r e p ch ) a n y s e n t ) ) ) ) )
nil )
br oa d cas t− o n e − re p o r t
CPU time : 0 . 0 0
∗
; ; ; r e t u r n t o s n e p s package
ˆ(
−−> in−package s n e p s )
#<The s n e p s package>
CPU time : 0 . 0 0
∗
ˆ
−−> ( s e t f s n e p s u l : : ∗ i n f e r t r a c e ∗ n i l )
nil
CPU time : 0 . 0 1
∗
; ; ; l o a d background knowledge
( i n t e x t ”/ p r o j e c t s / s t n 2 /CVA/demos/ r e l s ” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ r e l s i s now t h e s o u r c e o f i n p u t .
213
CPU time : 0 . 0 0
∗
( a1 a2 a3 a4 a f t e r a g e n t a g a i n s t antonym a s s o c i a t e d b e f o r e c a u s e c l a s s
d i r e c t i o n e q u i v e t i m e e v e n t from i n i n d o b j i n s t r i n t o l e x l o c a t i o n manner
member mode o b j e c t on onto p a r t p l a c e p o s s e s s o r proper−name p r o p e r t y r e l s k f
s p − r e l s t i m e s u b c l a s s s u p e r c l a s s s u b s e t s u p e r s e t synonym time t o whole k n c a t )
CPU time : 0 . 0 4
∗
End o f f i l e / p r o j e c t s / s t n 2 /CVA/demos/ r e l s
CPU time : 0 . 0 5
∗ ( demo ”/ p r o j e c t s / s t n 2 /CVA/demos/ p a t h s ” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ p a t h s i s now t h e s o u r c e o f i n p u t .
CPU time : 0 . 0 0
∗ ; ; ; Composition o f c e r t a i n p a t h s
; ; ; Make B e f o r e T r a n s i t i v e
( d e f i n e − p a t h b e f o r e ( compose b e f o r e ( k s t a r ( compose a f t e r − ! b e f o r e ) ) ) )
b e f o r e i m p l i e d by t h e path ( compose b e f o r e ( k s t a r ( compose a f t e r − ! b e f o r e ) ) )
b e fore − i m p l i e d by t h e path ( compose ( k s t a r ( compose be f o re − ! a f t e r ) ) bef o re − )
CPU time : 0 . 0 0
∗
; ; ; Make A f t e r T r a n s i t i v e
( d e f i n e − p a t h a f t e r ( compose a f t e r ( k s t a r ( compose b ef o re − ! a f t e r ) ) ) )
a f t e r i m p l i e d by t h e path ( compose a f t e r ( k s t a r ( compose bef o r e − ! a f t e r ) ) )
a f t e r − i m p l i e d by t h e path ( compose ( k s t a r ( compose a f t e r − ! b e f o r e ) ) a f t e r − )
CPU time : 0 . 0 0
∗
; ; I f X i s a member o f t h e c l a s s Y and Y i s a s u b c l a s s o f Z then
;;
X i s a member o f t h e c l a s s Z .
; ; Example :
I f Fido i s a b r a c h e t and a l l b r a c h e t s a r e hounds then
;;;
Fido i s a hound .
( d e f i n e − p a t h c l a s s ( compose c l a s s ( k s t a r ( compose s u b c l a s s − ! s u p e r c l a s s ) ) ) )
c l a s s i m p l i e d by t h e path ( compose c l a s s
( k s t a r ( compose s u b c l a s s − ! s u p e r c l a s s ) ) )
c l a s s − i m p l i e d by t h e path ( compose ( k s t a r ( compose s u p e r c l a s s − ! s u b c l a s s ) )
class− )
CPU time : 0 . 0 0
∗
; ; Make s u b c l a s s t r a n s i t i v e
( d e f i n e − p a t h s u b c l a s s ( compose s u b c l a s s ( k s t a r ( compose s u p e r c l a s s − ! s u b c l a s s ) ) ) )
s u b c l a s s i m p l i e d by t h e path ( compose s u b c l a s s
( k s t a r ( compose s u p e r c l a s s − ! s u b c l a s s ) ) )
214
s u b c l a s s − i m p l i e d by t h e path ( compose
( k s t a r ( compose s u b c l a s s − ! s u p e r c l a s s ) )
subclass− )
CPU time : 0 . 0 0
∗
; ; Make member move o v e r e q u i v a r c s
( d e f i n e − p a t h member ( compose member ( k s t a r ( compose equiv− ! e q u i v ) ) ) )
member i m p l i e d by t h e path ( compose member ( k s t a r ( compose equiv− ! e q u i v ) ) )
member− i m p l i e d by t h e path ( compose ( k s t a r ( compose equiv− ! e q u i v ) ) member−)
CPU time : 0 . 0 0
∗
End o f / p r o j e c t s / s t n 2 /CVA/demos/ p a t h s d e m o n s t r a t i o n .
CPU time : 0 . 0 2
∗ ( demo ”/ p r o j e c t s / s t n 2 /CVA/demos/ j o u s t . b a s e ” )
F i l e / p r o j e c t s / s t n 2 /CVA/demos/ j o u s t . b a s e i s now t h e s o u r c e o f i n p u t .
CPU time : 0 . 0 0
∗ ; ; ; This i s t h e s e t o f a s s e r t i o n s which b u i l d t h e b a s e network which
; ; ; c o r r e s p o n d s t o Karen E h r l i c h ’ s v o c a b u l a r y a c q u i s i t i o n p r o j e c t .
; ; ; Commented and made a c c e s s i b l e by Alan Hunt and G e o f f r e y Koplas , ’ 9 7
; ; ; The f o l l o w i n g i s t h e i n f o r m a t i o n t h a t n e e d s t o g e t f e d i n t o t h e network
; ; ; f o r t h e N a r r a t i v e A c q u i s i t i o n demos ; namely t h e background knowledge
; ; ; on t h e words o t h e r than t h e one b e i n g a c q u i r e d .
; Animals a r e p h y s i c a l o b j e c t s
( describe
( a s s e r t s u b c l a s s ( b u i l d l e x ” animal ” ) s u p e r c l a s s ( b u i l d l e x ” phys o b j ” )
kn cat ” l i f e ” ))
(m3 ! ( k n c a t l i f e ) ( s u b c l a s s ( m1 ( l e x animal ) ) )
( s u p e r c l a s s ( m2 ( l e x phys o b j ) ) ) )
(m3 ! )
CPU time : 0 . 0 0
∗
; Quadrupeds a r e v e r t e b r a t e s
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” quadruped ” ) s u p e r c l a s s ( b u i l d l e x ” v e r t e b r a t e ” )
kn cat ” l i f e ” ))
(m6 ! ( k n c a t l i f e ) ( s u b c l a s s ( m4 ( l e x quadruped ) ) )
( s u p e r c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) )
(m6 ! )
CPU time : 0 . 0 0
215
∗
; Ungulates are h e r b i v o r e s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” u n g u l a t e ” ) s u p e r c l a s s ( b u i l d l e x ” h e r b i v o r e ” )
kn cat ” l i f e ” ))
(m9 ! ( k n c a t l i f e ) ( s u b c l a s s ( m7 ( l e x u n g u l a t e ) ) )
( s u p e r c l a s s ( m8 ( l e x h e r b i v o r e ) ) ) )
(m9 ! )
CPU time : 0 . 0 0
∗
; H e r b i v o r e and c a r n i v o r e a r e antonyms
( describe
( a sse r t antonym ( b u i l d l e x ” h e r b i v o r e ” ) antonym ( b u i l d l e x ” c a r n i v o r e ” ) ) )
(m11 ! ( antonym ( m10 ( l e x c a r n i v o r e ) ) ( m8 ( l e x h e r b i v o r e ) ) ) )
(m11 ! )
CPU time : 0 . 0 0
∗
; Mammals a r e a n i m a l s
( describe
( as s ert s u b c l a s s ( b u i l d l e x ”mammal” ) s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
(m13 ! ( k n c a t l i f e ) ( s u b c l a s s ( m12 ( l e x mammal ) ) )
( s u p e r c l a s s ( m1 ( l e x animal ) ) ) )
( m13 ! )
CPU time : 0 . 0 1
∗
; Mammals a r e v e r t e b r a t e s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ”mammal” ) s u p e r c l a s s ( b u i l d l e x ” v e r t e b r a t e ” )
kn cat ” l i f e ” ))
(m14 ! ( k n c a t l i f e ) ( s u b c l a s s ( m12 ( l e x mammal ) ) )
( s u p e r c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) )
( m14 ! )
CPU time : 0 . 0 1
∗
; Deer a r e mammals
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” d e e r ” ) s u p e r c l a s s ( b u i l d l e x ”mammal” )
kn cat ” l i f e ” ))
(m16 ! ( k n c a t l i f e ) ( s u b c l a s s ( m15 ( l e x d e e r ) ) )
( s u p e r c l a s s ( m12 ( l e x mammal ) ) ) )
216
( m16 ! )
CPU time : 0 . 0 0
∗
; Deer a r e quadrupeds
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” d e e r ” ) s u p e r c l a s s ( b u i l d l e x ” quadruped ” )
kn cat ” l i f e ” ))
(m17 ! ( k n c a t l i f e ) ( s u b c l a s s ( m15 ( l e x d e e r ) ) )
( s u p e r c l a s s ( m4 ( l e x quadruped ) ) ) )
( m17 ! )
CPU time : 0 . 0 0
∗
; Deer a r e h e r b i v o r e s
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” d e e r ” ) s u p e r c l a s s ( b u i l d l e x ” h e r b i v o r e ” )
kn cat ” l i f e ” ))
(m18 ! ( k n c a t l i f e ) ( s u b c l a s s ( m15 ( l e x d e e r ) ) )
( s u p e r c l a s s ( m8 ( l e x h e r b i v o r e ) ) ) )
( m18 ! )
CPU time : 0 . 0 0
∗
; Deer a r e a n i m a l s
( describe ( as s er t s u b c l a s s ( b u i l d l e x ” d e e r ” ) s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
( m19 ! ( k n c a t l i f e ) ( s u b c l a s s ( m15 ( l e x d e e r ) ) ) ( s u p e r c l a s s ( m1 ( l e x animal ) ) ) )
( m19 ! )
CPU time : 0 . 0 0
∗
; Deer i s a b a s i c l e v e l c a t e g o r y
( describe
( as s ert member ( b u i l d l e x ” d e e r ” )
kn cat ” l i f e ” ))
c l a s s ( build lex ” basic ctgy ” )
(m21 ! ( c l a s s ( m20 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m15 ( l e x d e e r ) ) ) )
( m21 ! )
CPU time : 0 . 0 0
∗
; H o r s e s a r e quadrupeds
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” h o r s e ” ) s u p e r c l a s s ( b u i l d l e x ” quadruped ” )
217
kn cat ” l i f e ” ))
(m23 ! ( k n c a t l i f e ) ( s u b c l a s s ( m22 ( l e x h o r s e ) ) )
( s u p e r c l a s s ( m4 ( l e x quadruped ) ) ) )
( m23 ! )
CPU time : 0 . 0 0
∗
; Horses are h e r b i v o r e s
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” h o r s e ” ) s u p e r c l a s s ( b u i l d l e x ” h e r b i v o r e ” )
kn cat ” l i f e ” ))
(m24 ! ( k n c a t l i f e ) ( s u b c l a s s ( m22 ( l e x h o r s e ) ) )
( s u p e r c l a s s ( m8 ( l e x h e r b i v o r e ) ) ) )
( m24 ! )
CPU time : 0 . 0 0
∗
; Horses are animals
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” h o r s e ” ) s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
(m25 ! ( k n c a t l i f e ) ( s u b c l a s s ( m22 ( l e x h o r s e ) ) )
( s u p e r c l a s s ( m1 ( l e x animal ) ) ) )
( m25 ! )
CPU time : 0 . 0 1
∗
; Horse i s a b a s i c l e v e l c a t e g o r y
( describe
( as s ert member ( b u i l d l e x ” h o r s e ” )
kn cat ” l i f e ” ))
c l a s s ( build lex ” basic ctgy ” )
(m26 ! ( c l a s s ( m20 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m22 ( l e x h o r s e ) ) ) )
( m26 ! )
CPU time : 0 . 0 0
∗
; Ponies are animals
( describe ( a s s e r t s u b c l a s s ( b u i l d l e x ” pony ” ) s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
( m28 ! ( k n c a t l i f e ) ( s u b c l a s s ( m27 ( l e x pony ) ) ) ( s u p e r c l a s s ( m1 ( l e x animal ) ) ) )
( m28 ! )
CPU time : 0 . 0 1
218
∗
; ” Dogs a r e mammals”
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” dog ” ) s u p e r c l a s s ( b u i l d l e x ”mammal” )
kn cat ” l i f e ” ))
(m30 ! ( k n c a t l i f e ) ( s u b c l a s s ( m29 ( l e x dog ) ) ) ( s u p e r c l a s s ( m12 ( l e x mammal ) ) ) )
( m30 ! )
CPU time : 0 . 0 0
∗
; ” Dogs a r e quadrupeds ”
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” dog ” ) s u p e r c l a s s ( b u i l d l e x ” quadruped ” )
kn cat ” l i f e ” ))
(m31 ! ( k n c a t l i f e ) ( s u b c l a s s ( m29 ( l e x dog ) ) )
( s u p e r c l a s s ( m4 ( l e x quadruped ) ) ) )
( m31 ! )
CPU time : 0 . 0 0
∗
; ” Dogs a r e c a r n i v o r e s ”
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” dog ” ) s u p e r c l a s s ( b u i l d l e x ” c a r n i v o r e ” ) ) )
( m32 ! ( s u b c l a s s ( m29 ( l e x dog ) ) ) ( s u p e r c l a s s ( m10 ( l e x c a r n i v o r e ) ) ) )
( m32 ! )
CPU time : 0 . 0 0
∗
; ” Dogs a r e a n i m a l s ”
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” dog ” ) s u p e r c l a s s ( b u i l d l e x ” animal ” )
kn cat ” l i f e ” ))
(m33 ! ( k n c a t l i f e ) ( s u b c l a s s ( m29 ( l e x dog ) ) ) ( s u p e r c l a s s ( m1 ( l e x animal ) ) ) )
( m33 ! )
CPU time : 0 . 0 0
∗
; Dog i s a b a s i c l e v e l c a t e g o r y
( describe
( as se r t member ( b u i l d l e x ” dog ” )
kn cat ” l i f e ” ))
c l a s s ( build lex ” basic ctgy ” )
(m34 ! ( c l a s s ( m20 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m29 ( l e x dog ) ) ) )
( m34 ! )
219
CPU time : 0 . 0 0
∗
; ”Hounds a r e dogs ”
( describe
( as se r t s u b c l a s s ( b u i l d l e x ”hound” ) s u p e r c l a s s ( b u i l d l e x ” dog ” )
kn cat ” l i f e ” ))
(m36 ! ( k n c a t l i f e ) ( s u b c l a s s ( m35 ( l e x hound ) ) ) ( s u p e r c l a s s ( m29 ( l e x dog ) ) ) )
( m36 ! )
CPU time : 0 . 0 0
∗
; ” Something i s a member o f t h e c l a s s dog ”
( describe
( as se r t member # r e x c l a s s ( b u i l d l e x ” dog ” ) ) )
(m37 ! ( c l a s s ( m29 ( l e x dog ) ) ) ( member b1 ) )
( m37 ! )
CPU time : 0 . 0 0
∗
; ”The dog i s p o s s e s e d by something ”
( describe
( a sse r t o b j e c t ∗ r e x r e l ( b u i l d l e x ” dog ” ) p o s s e s s o r # r e x b o s s ) )
(m38 ! ( o b j e c t b1 ) ( p o s s e s s o r b2 ) ( r e l ( m29 ( l e x dog ) ) ) )
(m38 ! )
CPU time : 0 . 0 0
∗
; ”The t h i n g t h a t owns t h e dog i s a p e r s o n ”
( describe
( as s ert member ∗ r e x b o s s c l a s s ( b u i l d l e x ” p e r s o n ” ) ) )
(m40 ! ( c l a s s ( m39 ( l e x p e r s o n ) ) ) ( member b2 ) )
( m40 ! )
CPU time : 0 . 0 0
∗
; Kings a r e p e r s o n s
( describe
( add s u b c l a s s ( b u i l d l e x ” k i n g ” ) s u p e r c l a s s ( b u i l d l e x ” p e r s o n ” )
kn cat ” l i f e ” ))
(m42 ! ( k n c a t l i f e ) ( s u b c l a s s ( m41 ( l e x k i n g ) ) )
( s u p e r c l a s s ( m39 ( l e x p e r s o n ) ) ) )
( m42 ! )
220
CPU time : 0 . 0 1
∗
; Wizards a r e p e r s o n s .
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” w i z a r d ” ) s u p e r c l a s s ( b u i l d l e x ” p e r s o n ” )
kn cat ” l i f e ” ))
(m44 ! ( k n c a t l i f e ) ( s u b c l a s s ( m43 ( l e x w i z a r d ) ) )
( s u p e r c l a s s ( m39 ( l e x p e r s o n ) ) ) )
( m44 ! )
CPU time : 0 . 0 1
∗
; Barons a r e p e r s o n s .
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” baron ” ) s u p e r c l a s s ( b u i l d l e x ” p e r s o n ” )
kn cat ” l i f e ” ))
(m46 ! ( k n c a t l i f e ) ( s u b c l a s s ( m45 ( l e x baron ) ) )
( s u p e r c l a s s ( m39 ( l e x p e r s o n ) ) ) )
( m46 ! )
CPU time : 0 . 0 1
∗
; Knights a r e p e r s o n s .
( describe
( as se r t s u b c l a s s ( b u i l d l e x ” k n i g h t ” ) s u p e r c l a s s ( b u i l d l e x ” p e r s o n ” )
kn cat ” l i f e ” ))
(m48 ! ( k n c a t l i f e ) ( s u b c l a s s ( m47 ( l e x k n i g h t ) ) )
( s u p e r c l a s s ( m39 ( l e x p e r s o n ) ) ) )
( m48 ! )
CPU time : 0 . 0 0
∗
; Person i s a b a s i c l e v e l c a t e g o r y
( describe
( as s ert member ( b u i l d l e x ” p e r s o n ” )
kn cat ” l i f e ” ))
c l a s s ( build lex ” basic ctgy ” )
(m49 ! ( c l a s s ( m20 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m39 ( l e x p e r s o n ) ) ) )
( m49 ! )
CPU time : 0 . 0 1
∗
; Something i s named ’ King Arthur ’
( describe
( a sse r t o b j e c t #KA proper−name ( b u i l d l e x ” King Arthur ” )
kn cat ” l i f e ” ))
221
( m51 ! ( k n c a t l i f e ) ( o b j e c t b3 ) ( proper−name ( m50 ( l e x King Arthur ) ) ) )
( m51 ! )
CPU time : 0 . 0 1
∗
; King Arthur i s a k i n g
( describe
( as se r t member ∗KA c l a s s ( b u i l d l e x ” k i n g ” )
kn cat ” l i f e ” ))
(m52 ! ( c l a s s ( m41 ( l e x k i n g ) ) ) ( k n c a t l i f e ) ( member b3 ) )
( m52 ! )
CPU time : 0 . 0 0
∗
; The Round Table i s a t a b l e
( describe
( a sse r t member ( b u i l d l e x ”Round Table ” ) c l a s s ( b u i l d l e x ” t a b l e ” )
kn cat ” l i f e ” ))
(m55 ! ( c l a s s ( m54 ( l e x t a b l e ) ) ) ( k n c a t l i f e ) ( member ( m53 ( l e x Round Table ) ) ) )
( m55 ! )
CPU time : 0 . 0 1
∗
; King Arthur owns t h e Round Table
( describe
( a sse r t p o s s e s s o r ∗KA o b j e c t ( b u i l d l e x ”Round Table ” ) r e l ( b u i l d l e x ” t a b l e ” )
kn cat ” l i f e ” ))
(m56 ! ( k n c a t l i f e ) ( o b j e c t ( m53 ( l e x Round Table ) ) ) ( p o s s e s s o r b3 )
( r e l ( m54 ( l e x t a b l e ) ) ) )
( m56 ! )
CPU time : 0 . 0 1
∗
; There i s something named ’ E x c a l i b u r ’
( describe
( as s ert o b j e c t # E x c a l i b u r proper−name ( b u i l d l e x ” E x c a l i b u r ” )
kn cat ” l i f e ” ))
(m58 ! ( k n c a t l i f e ) ( o b j e c t b4 ) ( proper−name ( m57 ( l e x E x c a l i b u r ) ) ) )
( m58 ! )
CPU time : 0 . 0 0
∗
; E x c a l i b u r i s a sword
222
( describe
( a sse r t member ∗ E x c a l i b u r c l a s s ( b u i l d l e x ” sword ” )
kn cat ” l i f e ” ))
(m60 ! ( c l a s s ( m59 ( l e x sword ) ) ) ( k n c a t l i f e ) ( member b4 ) )
( m60 ! )
CPU time : 0 . 0 0
∗
; King Arthur owns E x c a l i b u r
( describe
( a sse r t o b j e c t ∗ E x c a l i b u r r e l ( b u i l d l e x ” sword ” ) p o s s e s s o r ∗KA
kn cat ” l i f e ” ))
(m61 ! ( k n c a t l i f e ) ( o b j e c t b4 ) ( p o s s e s s o r b3 ) ( r e l ( m59 ( l e x sword ) ) ) )
( m61 ! )
CPU time : 0 . 0 0
∗
; Something i s named ’ M e r l i n ’
( describe
( as s ert o b j e c t #Mer proper−name ( b u i l d l e x ” M e r l i n ” )
kn cat ” l i f e ” ))
(m63 ! ( k n c a t l i f e ) ( o b j e c t b5 ) ( proper−name ( m62 ( l e x M e r l i n ) ) ) )
( m63 ! )
CPU time : 0 . 0 1
∗
; Merlin i s a wizard .
( describe
( as s ert member ∗ Mer c l a s s ( b u i l d l e x ” w i z a r d ” )
kn cat ” l i f e ” ))
(m64 ! ( c l a s s ( m43 ( l e x w i z a r d ) ) ) ( k n c a t l i f e ) ( member b5 ) )
( m64 ! )
CPU time : 0 . 0 0
∗
; Something i s named ’ S i r Galahad ’
( describe
( a sse r t o b j e c t #Galahad proper−name ( b u i l d l e x ” S i r Galahad ” )
kn cat ” l i f e ” ))
( m66 ! ( k n c a t l i f e ) ( o b j e c t b6 ) ( proper−name ( m65 ( l e x S i r Galahad ) ) ) )
( m66 ! )
CPU time : 0 . 0 0
223
∗
; S i r Galahad i s a k n i g h t
( describe
( as se r t member ∗ Galahad c l a s s ( b u i l d l e x ” k n i g h t ” )
kn cat ” l i f e ” ))
(m67 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( k n c a t l i f e ) ( member b6 ) )
( m67 ! )
CPU time : 0 . 0 1
∗
; Something i s named ’ S i r T r i s t r a m ’
( describe
( a sse r t o b j e c t # T r i s proper−name ( b u i l d l e x ” S i r T r i s t r a m ” )
kn cat ” l i f e ” ))
(m69 ! ( k n c a t l i f e ) ( o b j e c t b7 ) ( proper−name ( m68 ( l e x S i r T r i s t r a m ) ) ) )
( m69 ! )
CPU time : 0 . 0 1
∗
; S i r Tristram i s a knight
( describe
( as se r t member ∗ T r i s
c l a s s ( build lex ” knight ” )
kn cat ” l i f e ” ))
(m70 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( k n c a t l i f e ) ( member b7 ) )
( m70 ! )
CPU time : 0 . 0 1
∗
; Something i s named ’ S i r Gawain ’
( describe
( a sse r t o b j e c t #SG proper−name ( b u i l d l e x ” S i r Gawain” )
kn cat ” l i f e ” ))
(m72 ! ( k n c a t l i f e ) ( o b j e c t b8 ) ( proper−name ( m71 ( l e x S i r Gawain ) ) ) )
( m72 ! )
CPU time : 0 . 0 0
∗
; S i r Gawain i s a k n i g h t
( describe
( as s ert member ∗SG c l a s s ( b u i l d l e x ” k n i g h t ” )
kn cat ” l i f e ” ))
(m73 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( k n c a t l i f e ) ( member b8 ) )
( m73 ! )
224
CPU time : 0 . 0 0
∗
; Something i s named ’ King Ban ’
( describe
( as se r t o b j e c t #Ban proper−name ( b u i l d l e x ” King Ban” )
kn cat ” l i f e ” ))
(m75 ! ( k n c a t l i f e ) ( o b j e c t b9 ) ( proper−name ( m74 ( l e x King Ban ) ) ) )
( m75 ! )
CPU time : 0 . 0 1
∗
; King Ban i s a k i n g
( describe
( a sse r t member ∗ Ban c l a s s ( b u i l d l e x ” k i n g ” )
kn cat ” l i f e ” ))
(m76 ! ( c l a s s ( m41 ( l e x k i n g ) ) ) ( k n c a t l i f e ) ( member b9 ) )
( m76 ! )
CPU time : 0 . 0 1
∗
; Something i s named ’ King Bors ’
( describe
( a sse r t o b j e c t #Bors proper−name ( b u i l d l e x ” King Bors ” )
kn cat ” l i f e ” ))
(m78 ! ( k n c a t l i f e ) ( o b j e c t b10 ) ( proper−name ( m77 ( l e x King Bors ) ) ) )
( m78 ! )
CPU time : 0 . 0 1
∗
; King Bors i s a k i n g
( describe
( as se r t member ∗ Bors c l a s s ( b u i l d l e x ” k i n g ” )
kn cat ” l i f e ” ))
(m79 ! ( c l a s s ( m41 ( l e x k i n g ) ) ) ( k n c a t l i f e ) ( member b10 ) )
( m79 ! )
CPU time : 0 . 0 0
∗
; Something i s named ’ King Lot ’
( describe
( a sse r t o b j e c t #Lot proper−name ( b u i l d l e x ” King Lot ” )
kn cat ” l i f e ” ))
(m81 ! ( k n c a t l i f e ) ( o b j e c t b11 ) ( proper−name ( m80 ( l e x King Lot ) ) ) )
225
( m81 ! )
CPU time : 0 . 0 0
∗
; King Lot i s a k i n g
( describe
( a sse r t member ∗ Lot c l a s s ( b u i l d l e x ” k i n g ” )
kn cat ” l i f e ” ))
(m82 ! ( c l a s s ( m41 ( l e x k i n g ) ) ) ( k n c a t l i f e ) ( member b11 ) )
( m82 ! )
CPU time : 0 . 0 0
∗
; Sideboards are f u r n i t u r e
( describe
( a sse r t s u b c l a s s ( b u i l d l e x ” s i d e b o a r d ” ) s u p e r c l a s s ( b u i l d l e x ” f u r n i t u r e ” )
kn cat ” l i f e ” ))
(m85 ! ( k n c a t l i f e ) ( s u b c l a s s ( m83 ( l e x s i d e b o a r d ) ) )
( s u p e r c l a s s ( m84 ( l e x f u r n i t u r e ) ) ) )
( m85 ! )
CPU time : 0 . 0 1
∗
; Tables are f u r n i t u r e
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” t a b l e ” ) s u p e r c l a s s ( b u i l d l e x ” f u r n i t u r e ” )
kn cat ” l i f e ” ))
(m86 ! ( k n c a t l i f e ) ( s u b c l a s s ( m54 ( l e x t a b l e ) ) )
( s u p e r c l a s s ( m84 ( l e x f u r n i t u r e ) ) ) )
( m86 ! )
CPU time : 0 . 0 0
∗
; Chairs are f u r n i t u r e
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” c h a i r ” ) s u p e r c l a s s ( b u i l d l e x ” f u r n i t u r e ” )
kn cat ” l i f e ” ))
(m88 ! ( k n c a t l i f e ) ( s u b c l a s s ( m87 ( l e x c h a i r ) ) )
( s u p e r c l a s s ( m84 ( l e x f u r n i t u r e ) ) ) )
( m88 ! )
CPU time : 0 . 0 0
∗
; Chair i s a b a s i c l e v e l c a t e g o r y
( describe
226
( a sse r t member ( b u i l d l e x ” c h a i r ” )
kn cat ” l i f e ” ))
c l a s s ( build lex ” basic ctgy ” )
(m89 ! ( c l a s s ( m20 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m87 ( l e x c h a i r ) ) ) )
( m89 ! )
CPU time : 0 . 0 1
∗
; Table i s a b a s i c l e v e l c a t e g o r y
( describe
( a sse r t member ( b u i l d l e x ” t a b l e ” )
kn cat ” l i f e ” ))
c l a s s ( build lex ” basic ctgy ” )
(m90 ! ( c l a s s ( m20 ( l e x b a s i c c t g y ) ) ) ( k n c a t l i f e ) ( member ( m54 ( l e x t a b l e ) ) ) )
( m90 ! )
CPU time : 0 . 0 1
∗
; White i s a c o l o r
( describe
( a sse r t member ( b u i l d l e x ” w h i t e ” ) c l a s s ( b u i l d l e x ” c o l o r ” )
kn cat ” l i f e ” ))
(m93 ! ( c l a s s ( m92 ( l e x c o l o r ) ) ) ( k n c a t l i f e ) ( member ( m91 ( l e x w h i t e ) ) ) )
( m93 ! )
CPU time : 0 . 0 0
∗
; Black i s a c o l o r
( describe
( a sse r t member ( b u i l d l e x ” b l a c k ” ) c l a s s ( b u i l d l e x ” c o l o r ” )
kn cat ” l i f e ” ))
(m95 ! ( c l a s s ( m92 ( l e x c o l o r ) ) ) ( k n c a t l i f e ) ( member ( m94 ( l e x b l a c k ) ) ) )
( m95 ! )
CPU time : 0 . 0 1
∗
; Small i s a s i z e
( describe
( a sse r t member ( b u i l d l e x ” s m a l l ” ) c l a s s ( b u i l d l e x ” s i z e ” )
kn cat ” l i f e ” ))
(m98 ! ( c l a s s ( m97 ( l e x s i z e ) ) ) ( k n c a t l i f e ) ( member ( m96 ( l e x s m a l l ) ) ) )
( m98 ! )
CPU time : 0 . 0 1
∗
227
; ” Small ” and ” l i t t l e ” a r e synonyms
( describe
( ass er t synonym ( b u i l d l e x ” s m a l l ” ) synonym ( b u i l d l e x ” l i t t l e ” )
kn cat ” l i f e ” ))
( m100 ! ( k n c a t l i f e ) ( synonym ( m99 ( l e x l i t t l e ) ) ( m96 ( l e x s m a l l ) ) ) )
( m100 ! )
CPU time : 0 . 0 1
∗
; Large i s a s i z e
( describe
( as s ert member ( b u i l d l e x ” l a r g e ” ) c l a s s ( b u i l d l e x ” s i z e ” )
kn cat ” l i f e ” ))
( m102 ! ( c l a s s ( m97 ( l e x s i z e ) ) ) ( k n c a t l i f e ) ( member ( m101 ( l e x l a r g e ) ) ) )
( m102 ! )
CPU time : 0 . 0 1
∗
; ” Large ” and ” b i g ” a r e synonyms
( describe
( a sse r t synonym ( b u i l d l e x ” l a r g e ” ) synonym ( b u i l d l e x ” b i g ” )
kn cat ” l i f e ” ))
( m104 ! ( k n c a t l i f e ) ( synonym ( m103 ( l e x b i g ) ) ( m101 ( l e x l a r g e ) ) ) )
( m104 ! )
CPU time : 0 . 0 0
∗
; S p e a r s a r e weapons
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” s p e a r ” ) s u p e r c l a s s ( b u i l d l e x ”weapon” )
kn cat ” l i f e ” ))
( m107 ! ( k n c a t l i f e ) ( s u b c l a s s ( m105 ( l e x s p e a r ) ) )
( s u p e r c l a s s ( m106 ( l e x weapon ) ) ) )
( m107 ! )
CPU time : 0 . 0 0
∗
; J o u s t s a r e t y p e s o f combat
;( describe
; ( a s s e r t s u b c l a s s ( b u i l d l e x ” j o u s t ” ) s u p e r c l a s s ( b u i l d l e x ” combat ” )
;
kn cat ” l i f e ”))
; Tourneys a r e t y p e s o f combat
( describe
( as s ert s u b c l a s s ( b u i l d l e x ” t o u r n e y ” ) s u p e r c l a s s ( b u i l d l e x ” combat ” )
kn cat ” l i f e ” ))
228
( m110 ! ( k n c a t l i f e ) ( s u b c l a s s ( m108 ( l e x t o u r n e y ) ) )
( s u p e r c l a s s ( m109 ( l e x combat ) ) ) )
( m110 ! )
CPU time : 0 . 0 0
∗
; Combat i s a type o f e v e n t
( describe
( a ss er t s u b c l a s s ( b u i l d l e x ” combat ” ) s u p e r c l a s s ( b u i l d l e x ” e v e n t ” )
kn cat ” l i f e ” ))
( m112 ! ( k n c a t l i f e ) ( s u b c l a s s ( m109 ( l e x combat ) ) )
( s u p e r c l a s s ( m111 ( l e x e v e n t ) ) ) )
( m112 ! )
CPU time : 0 . 0 0
∗
; Tourney i s a n o t h e r word f o r Tournament
( describe
( a ss er t synonym ( b u i l d l e x ” t o u r n e y ” ) synonym ( b u i l d l e x ” tournament ” )
kn cat ” l i f e ” ))
( m114 ! ( k n c a t l i f e ) ( synonym ( m113 ( l e x tournament ) ) ( m108 ( l e x t o u r n e y ) ) ) )
( m114 ! )
CPU time : 0 . 0 0
∗
; ” K i l l ” and ” S l a y ” a r e synonyms
( describe
( a ss er t synonym ( b u i l d l e x ” k i l l ” ) synonym ( b u i l d l e x ” s l a y ” ) k n c a t ” l i f e ” ) )
( m117 ! ( k n c a t l i f e ) ( synonym ( m116 ( l e x s l a y ) ) ( m115 ( l e x k i l l ) ) ) )
( m117 ! )
CPU time : 0 . 0 1
∗
;;######################
;;
RULES
;;######################
; Tourneys and J o u s t s a r e f o r m a l , mock t h i n g s
( describe
( add f o r a l l $ e v e n t
ant ( ; ; ( b u i l d member ∗ e v e n t c l a s s ( b u i l d l e x ” j o u s t ” ) )
( b u i l d member ∗ e v e n t c l a s s ( b u i l d l e x ” t o u r n e y ” ) ) )
cq ( ( b u i l d o b j e c t ∗ e v e n t p r o p e r t y ( b u i l d l e x ” f o r m a l ” ) )
( b u i l d o b j e c t ∗ e v e n t p r o p e r t y ( b u i l d l e x ”mock” ) ) )
kn cat ” l i f e − r u l e .2” ))
229
( m120 ! ( f o r a l l v1 ) ( ant ( p1 ( c l a s s ( m108 ( l e x t o u r n e y ) ) ) ( member v1 ) ) )
( cq ( p3 ( o b j e c t v1 ) ( p r o p e r t y ( m119 ( l e x mock ) ) ) )
( p2 ( o b j e c t v1 ) ( p r o p e r t y ( m118 ( l e x f o r m a l ) ) ) ) )
( kn cat l i f e − r u l e . 2 ) )
( m120 ! )
CPU time : 0 . 1 3
∗
; I f an e v e n t i s f o r m a l then t h e r e i s some e n t i t y t h a t a r r a n g e s
; the event .
( describe
( add f o r a l l $ e v e n t
ant ( ( b u i l d o b j e c t ∗ e v e n t p r o p e r t y ( b u i l d l e x ” f o r m a l ” ) )
( b u i l d member ∗ e v e n t c l a s s ( b u i l d l e x ” e v e n t ” ) ) )
cq ( b u i l d a g e n t ( b u i l d s k f ” a r r a n g e r − o f ” a1 ∗ e v e n t )
act ( build action ( build lex ” arrange ” )
object ∗ event ) )
kn cat ” l i f e − r u l e .1” ))
( m122 ! ( f o r a l l v2 )
( ant ( p5 ( c l a s s ( m111 ( l e x e v e n t ) ) ) ( member v2 ) )
( p4 ( o b j e c t v2 ) ( p r o p e r t y ( m118 ( l e x f o r m a l ) ) ) ) )
( cq
( p8 ( a c t ( p7 ( a c t i o n ( m121 ( l e x a r r a n g e ) ) ) ( o b j e c t v2 ) ) )
( a g e n t ( p6 ( a1 v2 ) ( s k f a r r a n g e r − o f ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m122 ! )
CPU time : 0 . 0 5
∗
; I f something i s a hound then t h a t t h i n g hunts .
( describe
( add f o r a l l $hound1
ant ( b u i l d member ∗ hound1 c l a s s ( b u i l d l e x ”hound” ) )
cq ( b u i l d a g e n t ∗ hound1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” hunt ” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m125 ! ( f o r a l l v3 ) ( ant ( p9 ( c l a s s ( m35 ( l e x hound ) ) ) ( member v3 ) ) )
( cq ( p10 ( a c t ( m124 ( a c t i o n ( m123 ( l e x hunt ) ) ) ) ) ( a g e n t v3 ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m125 ! )
CPU time : 0 . 0 2
∗
; ; I f something bays and i t i s a member o f some c l a s s then
;;
t h a t c l a s s i s a s u b c l a s s o f hound
( describe
( add f o r a l l ( $ ba y e r $ c a t e g )
&ant ( ( b u i l d a g e n t ∗ ba yer a c t ( b u i l d a c t i o n ( b u i l d l e x ” bay ” ) ) )
( b u i l d member ∗ ba yer c l a s s ∗ c a t e g ) )
cq ( b u i l d s u b c l a s s ∗ c a t e g s u p e r c l a s s ( b u i l d l e x ”hound” ) ) ) )
230
( m163 ! ( c l a s s ( m20 ( l e x b a s i c c t g y ) ) ) ( member ( m15 ( l e x d e e r ) ) ) )
( m162 ! ( c l a s s ( m20 ) ) ( member ( m22 ( l e x h o r s e ) ) ) )
( m161 ! ( c l a s s ( m20 ) ) ( member ( m29 ( l e x dog ) ) ) )
( m160 ! ( c l a s s ( m12 ( l e x mammal ) ) ) ( member b1 ) )
( m159 ! ( c l a s s ( m10 ( l e x c a r n i v o r e ) ) ) ( member b1 ) )
( m158 ! ( c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) ( member b1 ) )
( m157 ! ( c l a s s ( m4 ( l e x quadruped ) ) ) ( member b1 ) )
( m156 ! ( c l a s s ( m2 ( l e x phys o b j ) ) ) ( member b1 ) )
( m155 ! ( c l a s s ( m1 ( l e x animal ) ) ) ( member b1 ) )
( m154 ! ( c l a s s ( m20 ) ) ( member ( m39 ( l e x p e r s o n ) ) ) )
( m153 ! ( c l a s s ( m41 ( l e x k i n g ) ) ) ( member b3 ) )
( m152 ! ( c l a s s ( m39 ) ) ( member b3 ) )
( m151 ! ( c l a s s ( m84 ( l e x f u r n i t u r e ) ) ) ( member ( m53 ( l e x Round Table ) ) ) )
( m150 ! ( c l a s s ( m54 ( l e x t a b l e ) ) ) ( member ( m53 ) ) )
( m149 ! ( c l a s s ( m59 ( l e x sword ) ) ) ( member b4 ) )
( m148 ! ( c l a s s ( m43 ( l e x w i z a r d ) ) ) ( member b5 ) )
( m147 ! ( c l a s s ( m39 ) ) ( member b5 ) )
( m146 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( member b6 ) )
( m145 ! ( c l a s s ( m39 ) ) ( member b6 ) )
( m144 ! ( c l a s s ( m47 ) ) ( member b7 ) )
( m143 ! ( c l a s s ( m39 ) ) ( member b7 ) )
( m142 ! ( c l a s s ( m47 ) ) ( member b8 ) )
( m141 ! ( c l a s s ( m39 ) ) ( member b8 ) )
( m140 ! ( c l a s s ( m41 ) ) ( member b9 ) )
( m139 ! ( c l a s s ( m39 ) ) ( member b9 ) )
( m138 ! ( c l a s s ( m41 ) ) ( member b10 ) )
( m137 ! ( c l a s s ( m39 ) ) ( member b10 ) )
( m136 ! ( c l a s s ( m41 ) ) ( member b11 ) )
( m135 ! ( c l a s s ( m39 ) ) ( member b11 ) )
( m134 ! ( c l a s s ( m20 ) ) ( member ( m87 ( l e x c h a i r ) ) ) )
( m133 ! ( c l a s s ( m20 ) ) ( member ( m54 ) ) )
( m132 ! ( c l a s s ( m92 ( l e x c o l o r ) ) ) ( member ( m91 ( l e x w h i t e ) ) ) )
( m131 ! ( c l a s s ( m92 ) ) ( member ( m94 ( l e x b l a c k ) ) ) )
( m130 ! ( c l a s s ( m97 ( l e x s i z e ) ) ) ( member ( m96 ( l e x s m a l l ) ) ) )
( m129 ! ( c l a s s ( m97 ) ) ( member ( m101 ( l e x l a r g e ) ) ) )
( m128 ! ( f o r a l l v5 v4 )
(& ant ( p12 ( c l a s s v5 ) ( member v4 ) )
( p11 ( a c t ( m127 ( a c t i o n ( m126 ( l e x bay ) ) ) ) ) ( a g e n t v4 ) ) )
( cq ( p13 ( s u b c l a s s v5 ) ( s u p e r c l a s s ( m35 ( l e x hound ) ) ) ) ) )
( m40 ! ( c l a s s ( m39 ) ) ( member b2 ) )
( m37 ! ( c l a s s ( m29 ) ) ( member b1 ) )
( m163 ! m162 ! m161 ! m160 ! m159 ! m158 ! m157 ! m156 ! m155 ! m154 ! m153 ! m152 ! m151 !
m150 ! m149 ! m148 ! m147 ! m146 ! m145 ! m144 ! m143 ! m142 ! m141 ! m140 ! m139 ! m138 !
m137 ! m136 ! m135 ! m134 ! m133 ! m132 ! m131 ! m130 ! m129 ! m128 ! m40 ! m37 ! )
CPU time : 0 . 1 7
∗
;;
;;
;;
;;
;;
;;
;;
;;
;;
Newly i n f e r r e d i n f o r m a t i o n :
” Deer ” i s a b a s i c c a t e g o r y
” Horse ” i s a b a s i c c a t e g o r y
”Dog ” i s a b a s i c c a t e g o r y
The dog ( b1 ) i s a quadruped
The dog ( b1 ) i s a mammal
The dog ( b1 ) i s a v e r t e b r a t e
The dog ( b1 ) i s a p h y s i c a l o b j e c t
231
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
The dog ( b1 ) i s a animal
” Person ” i s a b a s i c c a t e g o r y
King Arthur i s a k i n g
King Arthur i s a p e r s o n
The Round Table i s a p i e c e o f f u r n i t u r e
The Round Table i s a t a b l e
E x c a l i b u r i s a sword
Merlin i s a wizard
Merlin i s a person
S i r Galahad i s a k n i g h t
S i r Galahad i s a p e r s o n
S i r Tristram i s a knight
S i r Tristram i s a person
S i r Gawain i s a k n i g h t
S i r Gawain i s a p e r s o n
King Ban i s a k i n g
King Ban i s a p e r s o n
King Bors i s a k i n g
King Bors i s a p e r s o n
King Lot i s a k i n g
King Lot i s a p e r s o n
” Chair ” i s a b a s i c c a t e g o r y
” Table ” i s a b a s i c c a t e g o r y
White i s a c o l o r
Black i s a c o l o r
Small i s a s i z e
Large i s a s i z e
; ; I f one t h i n g b i t e s a n o t h e r and t h e b i t e r i s a member o f some
;;
c l a s s then t h a t c l a s s i s a s u b c l a s s o f animal
( describe
( add f o r a l l ( $animal1 $ b i t t e n ∗ c a t e g )
&ant ( ( b u i l d a g e n t ∗ animal1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” b i t e ” )
object ∗ bitten ))
( b u i l d member ∗ animal1 c l a s s ∗ c a t e g ) )
cq ( b u i l d s u b c l a s s ∗ c a t e g s u p e r c l a s s ( b u i l d l e x ” animal ” ) )
kn cat ” l i f e − r u l e .1” ))
( m165 ! ( f o r a l l v7 v6 v5 )
(& ant ( p16 ( c l a s s v5 ) ( member v6 ) )
( p15 ( a c t ( p14 ( a c t i o n ( m164 ( l e x b i t e ) ) ) ( o b j e c t v7 ) ) ) ( a g e n t v6 ) ) )
( cq ( p17 ( s u b c l a s s v5 ) ( s u p e r c l a s s ( m1 ( l e x animal ) ) ) ) ) ( k n c a t l i f e − r u l e . 1 ) )
( m163 ! ( c l a s s ( m20 ( l e x b a s i c c t g y ) ) ) ( member ( m15 ( l e x d e e r ) ) ) )
( m162 ! ( c l a s s ( m20 ) ) ( member ( m22 ( l e x h o r s e ) ) ) )
( m161 ! ( c l a s s ( m20 ) ) ( member ( m29 ( l e x dog ) ) ) )
( m160 ! ( c l a s s ( m12 ( l e x mammal ) ) ) ( member b1 ) )
( m159 ! ( c l a s s ( m10 ( l e x c a r n i v o r e ) ) ) ( member b1 ) )
( m158 ! ( c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) ( member b1 ) )
( m157 ! ( c l a s s ( m4 ( l e x quadruped ) ) ) ( member b1 ) )
( m156 ! ( c l a s s ( m2 ( l e x phys o b j ) ) ) ( member b1 ) )
( m155 ! ( c l a s s ( m1 ) ) ( member b1 ) )
( m154 ! ( c l a s s ( m20 ) ) ( member ( m39 ( l e x p e r s o n ) ) ) )
( m153 ! ( c l a s s ( m41 ( l e x k i n g ) ) ) ( member b3 ) )
( m152 ! ( c l a s s ( m39 ) ) ( member b3 ) )
( m151 ! ( c l a s s ( m84 ( l e x f u r n i t u r e ) ) ) ( member ( m53 ( l e x Round Table ) ) ) )
( m150 ! ( c l a s s ( m54 ( l e x t a b l e ) ) ) ( member ( m53 ) ) )
( m149 ! ( c l a s s ( m59 ( l e x sword ) ) ) ( member b4 ) )
( m148 ! ( c l a s s ( m43 ( l e x w i z a r d ) ) ) ( member b5 ) )
232
( m147 ! ( c l a s s ( m39 ) ) ( member b5 ) )
( m146 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( member b6 ) )
( m145 ! ( c l a s s ( m39 ) ) ( member b6 ) )
( m144 ! ( c l a s s ( m47 ) ) ( member b7 ) )
( m143 ! ( c l a s s ( m39 ) ) ( member b7 ) )
( m142 ! ( c l a s s ( m47 ) ) ( member b8 ) )
( m141 ! ( c l a s s ( m39 ) ) ( member b8 ) )
( m140 ! ( c l a s s ( m41 ) ) ( member b9 ) )
( m139 ! ( c l a s s ( m39 ) ) ( member b9 ) )
( m138 ! ( c l a s s ( m41 ) ) ( member b10 ) )
( m137 ! ( c l a s s ( m39 ) ) ( member b10 ) )
( m136 ! ( c l a s s ( m41 ) ) ( member b11 ) )
( m135 ! ( c l a s s ( m39 ) ) ( member b11 ) )
( m134 ! ( c l a s s ( m20 ) ) ( member ( m87 ( l e x c h a i r ) ) ) )
( m133 ! ( c l a s s ( m20 ) ) ( member ( m54 ) ) )
( m132 ! ( c l a s s ( m92 ( l e x c o l o r ) ) ) ( member ( m91 ( l e x w h i t e ) ) ) )
( m131 ! ( c l a s s ( m92 ) ) ( member ( m94 ( l e x b l a c k ) ) ) )
( m130 ! ( c l a s s ( m97 ( l e x s i z e ) ) ) ( member ( m96 ( l e x s m a l l ) ) ) )
( m129 ! ( c l a s s ( m97 ) ) ( member ( m101 ( l e x l a r g e ) ) ) )
( m40 ! ( c l a s s ( m39 ) ) ( member b2 ) )
( m37 ! ( c l a s s ( m29 ) ) ( member b1 ) )
( m165 ! m163 ! m162 ! m161 ! m160 ! m159 ! m158 ! m157 ! m156 ! m155 ! m154 ! m153 ! m152 !
m151 ! m150 ! m149 ! m148 ! m147 ! m146 ! m145 ! m144 ! m143 ! m142 ! m141 ! m140 ! m139 !
m138 ! m137 ! m136 ! m135 ! m134 ! m133 ! m132 ! m131 ! m130 ! m129 ! m40 ! m37 ! )
CPU time : 0 . 3 3
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None
; ; I f something i s an animal and p a r t o f a n o t h e r c l a s s then
;;
presumably , t h a t c l a s s i s a s u b c l a s s o f animal
( describe
( add f o r a l l ( ∗ animal1 $ c l a s s 2 )
&ant ( ( b u i l d member ∗ animal1 c l a s s ( b u i l d l e x ” animal ” ) )
( b u i l d member ∗ animal1 c l a s s ∗ c l a s s 2 ) )
cq ( b u i l d mode
( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d s u b c l a s s ∗ c l a s s 2 s u p e r c l a s s ( b u i l d l e x ” animal ” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m189 ! ( mode ( m166 ( l e x presumably ) ) )
( object
( m188 ( s u b c l a s s ( m10 ( l e x c a r n i v o r e ) ) ) ( s u p e r c l a s s ( m1 ( l e x animal ) ) ) ) ) )
( m187 ! ( mode ( m166 ) )
( o b j e c t ( m186 ( s u b c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m185 ! ( mode ( m166 ) )
( o b j e c t ( m184 ( s u b c l a s s ( m4 ( l e x quadruped ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m181 ! ( mode ( m166 ) )
( o b j e c t ( m180 ( s u b c l a s s ( m12 ( l e x mammal ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m179 ! ( mode ( m166 ) )
( o b j e c t ( m178 ( s u b c l a s s ( m15 ( l e x d e e r ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m177 ! ( mode ( m166 ) )
( o b j e c t ( m176 ( s u b c l a s s ( m22 ( l e x h o r s e ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m173 ! ( mode ( m166 ) )
( o b j e c t ( m172 ( s u b c l a s s ( m29 ( l e x dog ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
233
( m171 ! ( mode ( m166 ) )
( o b j e c t ( m170 ( s u b c l a s s ( m35 ( l e x hound ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m169 ! ( mode ( m166 ) )
( o b j e c t ( m168 ( s u b c l a s s ( m2 ( l e x phys o b j ) ) ) ( s u p e r c l a s s ( m1 ) ) ) ) )
( m167 ! ( f o r a l l v8 v6 )
(& ant ( p19 ( c l a s s v8 ) ( member v6 ) ) ( p18 ( c l a s s ( m1 ) ) ( member v6 ) ) )
( cq ( p21 ( mode ( m166 ) ) ( o b j e c t ( p20 ( s u b c l a s s v8 ) ( s u p e r c l a s s ( m1 ) ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m163 ! ( c l a s s ( m20 ( l e x b a s i c c t g y ) ) ) ( member ( m15 ) ) )
( m162 ! ( c l a s s ( m20 ) ) ( member ( m22 ) ) )
( m161 ! ( c l a s s ( m20 ) ) ( member ( m29 ) ) )
( m160 ! ( c l a s s ( m12 ) ) ( member b1 ) )
( m159 ! ( c l a s s ( m10 ) ) ( member b1 ) )
( m158 ! ( c l a s s ( m5 ) ) ( member b1 ) )
( m157 ! ( c l a s s ( m4 ) ) ( member b1 ) )
( m156 ! ( c l a s s ( m2 ) ) ( member b1 ) )
( m155 ! ( c l a s s ( m1 ) ) ( member b1 ) )
( m154 ! ( c l a s s ( m20 ) ) ( member ( m39 ( l e x p e r s o n ) ) ) )
( m153 ! ( c l a s s ( m41 ( l e x k i n g ) ) ) ( member b3 ) )
( m152 ! ( c l a s s ( m39 ) ) ( member b3 ) )
( m151 ! ( c l a s s ( m84 ( l e x f u r n i t u r e ) ) ) ( member ( m53 ( l e x Round Table ) ) ) )
( m150 ! ( c l a s s ( m54 ( l e x t a b l e ) ) ) ( member ( m53 ) ) )
( m149 ! ( c l a s s ( m59 ( l e x sword ) ) ) ( member b4 ) )
( m148 ! ( c l a s s ( m43 ( l e x w i z a r d ) ) ) ( member b5 ) )
( m147 ! ( c l a s s ( m39 ) ) ( member b5 ) )
( m146 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( member b6 ) )
( m145 ! ( c l a s s ( m39 ) ) ( member b6 ) )
( m144 ! ( c l a s s ( m47 ) ) ( member b7 ) )
( m143 ! ( c l a s s ( m39 ) ) ( member b7 ) )
( m142 ! ( c l a s s ( m47 ) ) ( member b8 ) )
( m141 ! ( c l a s s ( m39 ) ) ( member b8 ) )
( m140 ! ( c l a s s ( m41 ) ) ( member b9 ) )
( m139 ! ( c l a s s ( m39 ) ) ( member b9 ) )
( m138 ! ( c l a s s ( m41 ) ) ( member b10 ) )
( m137 ! ( c l a s s ( m39 ) ) ( member b10 ) )
( m136 ! ( c l a s s ( m41 ) ) ( member b11 ) )
( m135 ! ( c l a s s ( m39 ) ) ( member b11 ) )
( m134 ! ( c l a s s ( m20 ) ) ( member ( m87 ( l e x c h a i r ) ) ) )
( m133 ! ( c l a s s ( m20 ) ) ( member ( m54 ) ) )
( m132 ! ( c l a s s ( m92 ( l e x c o l o r ) ) ) ( member ( m91 ( l e x w h i t e ) ) ) )
( m131 ! ( c l a s s ( m92 ) ) ( member ( m94 ( l e x b l a c k ) ) ) )
( m130 ! ( c l a s s ( m97 ( l e x s i z e ) ) ) ( member ( m96 ( l e x s m a l l ) ) ) )
( m129 ! ( c l a s s ( m97 ) ) ( member ( m101 ( l e x l a r g e ) ) ) )
( m40 ! ( c l a s s ( m39 ) ) ( member b2 ) )
( m37 ! ( c l a s s ( m29 ) ) ( member b1 ) )
( m189 !
m160 !
m147 !
m134 !
m187 !
m159 !
m146 !
m133 !
m185 !
m158 !
m145 !
m132 !
m181 !
m157 !
m144 !
m131 !
m179 !
m156 !
m143 !
m130 !
m177 !
m155 !
m142 !
m129 !
m173 ! m171 ! m169 ! m167 ! m163 ! m162 ! m161 !
m154 ! m153 ! m152 ! m151 ! m150 ! m149 ! m148 !
m141 ! m140 ! m139 ! m138 ! m137 ! m136 ! m135 !
m40 ! m37 ! )
CPU time : 0 . 4 7
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; Presumably , quadruped i s a s u b c l a s s o f animal
; ; Presumably , v e r t e b r a t e i s a s u b c l a s s o f animal
234
;;
;;
;;
;;
;;
;;
;;
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
mammal i s a s u b c l a s s o f animal
d e e r i s a s u b c l a s s o f animal
h a r t i s a s u b c l a s s o f animal
h o r s e i s a s u b c l a s s o f animal
dog i s a s u b c l a s s o f animal
hound i s a s u b c l a s s o f animal
p h y s i c a l o b j e c t i s a s u b c l a s s o f animal
; ; I f something i s presumably an animal and i s a member o f a n o t h e r c l a s s then
;;
presumably , t h a t c l a s s i s a s u b c l a s s o f animal
( describe
( add f o r a l l ( ∗ animal1 ∗ c l a s s 2 )
&ant ( ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d member ∗ animal1 c l a s s ( b u i l d l e x ” animal ” ) ) )
( b u i l d member ∗ animal1
class ∗ class2 ))
cq ( b u i l d mode ( b u i l d l e x ” presumably ” )
object ( build subclass ∗ class2
s u p e r c l a s s ( b u i l d l e x ” animal ” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m190 ! ( f o r a l l v8 v6 )
(& ant
( p23 ( mode ( m166 ( l e x presumably ) ) )
( o b j e c t ( p18 ( c l a s s ( m1 ( l e x animal ) ) ) ( member v6 ) ) ) )
( p19 ( c l a s s v8 ) ( member v6 ) ) )
( cq ( p21 ( mode ( m166 ) ) ( o b j e c t ( p20 ( s u b c l a s s v8 ) ( s u p e r c l a s s ( m1 ) ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m190 ! )
CPU time : 0 . 1 4
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None
; ; I f something i s a mammal and a member o f a n o t h e r c l a s s then
; ; presumably , t h a t c l a s s i s a s u b c l a s s o f mammal
( describe
( add f o r a l l ( ∗ animal1 ∗ c l a s s 2 )
&ant ( ( b u i l d member ∗ animal1
c l a s s ( b u i l d l e x ”mammal” ) )
( b u i l d member ∗ animal1
class ∗ class2 ))
cq ( b u i l d mode
( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d s u b c l a s s ∗ c l a s s 2 s u p e r c l a s s ( b u i l d l e x ”mammal” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m213 ! ( mode ( m166 ( l e x presumably ) ) )
( o b j e c t ( m212 ( s u b c l a s s ( m12 ( l e x mammal ) ) ) ( s u p e r c l a s s ( m12 ) ) ) ) )
( m211 ! ( mode ( m166 ) )
( o b j e c t ( m210 ( s u b c l a s s ( m15 ( l e x d e e r ) ) ) ( s u p e r c l a s s ( m12 ) ) ) ) )
( m209 ! ( mode ( m166 ) )
( o b j e c t ( m208 ( s u b c l a s s ( m22 ( l e x h o r s e ) ) ) ( s u p e r c l a s s ( m12 ) ) ) ) )
( m207 ! ( mode ( m166 ) )
( o b j e c t ( m206 ( s u b c l a s s ( m27 ( l e x pony ) ) ) ( s u p e r c l a s s ( m12 ) ) ) ) )
( m205 ! ( mode ( m166 ) )
( o b j e c t ( m204 ( s u b c l a s s ( m35 ( l e x hound ) ) ) ( s u p e r c l a s s ( m12 ) ) ) ) )
( m203 ! ( mode ( m166 ) )
235
( o b j e c t ( m202 ( s u b c l a s s ( m1 ( l e x animal ) ) ) ( s u p e r c l a s s ( m12 ) ) ) ) )
( m201 ! ( mode ( m166 ) )
( o b j e c t ( m200 ( s u b c l a s s ( m4 ( l e x quadruped ) ) ) ( s u p e r c l a s s ( m12 ) ) ) ) )
( m199 ! ( mode ( m166 ) )
( o b j e c t ( m198 ( s u b c l a s s ( m10 ( l e x c a r n i v o r e ) ) ) ( s u p e r c l a s s ( m12 ) ) ) ) )
( m197 ! ( mode ( m166 ) )
( o b j e c t ( m196 ( s u b c l a s s ( m29 ( l e x dog ) ) ) ( s u p e r c l a s s ( m12 ) ) ) ) )
( m195 ! ( mode ( m166 ) )
( o b j e c t ( m194 ( s u b c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) ( s u p e r c l a s s ( m12 ) ) ) ) )
( m193 ! ( mode ( m166 ) )
( o b j e c t ( m192 ( s u b c l a s s ( m2 ( l e x phys o b j ) ) ) ( s u p e r c l a s s ( m12 ) ) ) ) )
( m191 ! ( f o r a l l v8 v6 )
(& ant ( p24 ( c l a s s ( m12 ) ) ( member v6 ) ) ( p19 ( c l a s s v8 ) ( member v6 ) ) )
( cq ( p26 ( mode ( m166 ) ) ( o b j e c t ( p25 ( s u b c l a s s v8 ) ( s u p e r c l a s s ( m12 ) ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m160 ! ( c l a s s ( m12 ) ) ( member b1 ) )
( m213 ! m211 ! m209 ! m207 ! m205 ! m203 ! m201 ! m199 ! m197 ! m195 ! m193 ! m191 ! m160 ! )
CPU time : 0 . 3 8
∗
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
;;
Newly i n f e r r e d i n f o r m a t i o n :
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
Presumably ,
mammal i s a s u b c l a s s o f mammal
d e e r i s a s u b c l a s s o f mammal
h a r t i s a s u b c l a s s o f mammal
h o r s e i s a s u b c l a s s o f mammal
pony i s a s u b c l a s s o f mammal
hound i s a s u b c l a s s o f mammal
animal i s a s u b c l a s s o f mammal
v e r t e b r a t e i s a s u b c l a s s o f mammal
quadruped i s a s u b c l a s s o f mammal
dog i s a s u b c l a s s o f mammal
p h y s i c a l o b j e c t i s a s u b c l a s s o f mammal
; ; I f something i s a mammal , then i t presumably b e a r s l i v e young
( describe
( add f o r a l l ∗ animal1
ant ( b u i l d member ∗ animal1
c l a s s ( b u i l d l e x ”mammal” ) )
cq ( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d a g e n t ∗ animal1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” b e a r ” )
o b j e c t ( b u i l d l e x ” l i v e young ” ) ) ) )
kn cat ” l i f e − r u l e .1” ))
( m219 ! ( mode ( m166 ( l e x presumably ) ) )
( object
( m218
( a c t ( m216 ( a c t i o n ( m214 ( l e x b e a r ) ) ) ( o b j e c t ( m215 ( l e x l i v e young ) ) ) ) )
( a g e n t b1 ) ) ) )
( m217 ! ( f o r a l l v6 ) ( ant ( p24 ( c l a s s ( m12 ( l e x mammal ) ) ) ( member v6 ) ) )
( cq ( p29 ( mode ( m166 ) ) ( o b j e c t ( p28 ( a c t ( m216 ) ) ( a g e n t v6 ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m219 ! m217 ! )
CPU time : 0 . 0 5
236
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; The dog ( b1 ) b e a r s l i v e young
; ” I f something b e a r s something e l s e , t h e b e a r e r i s an animal ”
( describe
( add f o r a l l ( ∗ animal1 $animal2 )
ant ( b u i l d a g e n t ∗ animal1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” b e a r ” )
o b j e c t ∗ animal2 ) )
cq ( b u i l d member ∗ animal1
c l a s s ( b u i l d l e x ”mammal” ) )
kn cat ” l i f e − r u l e .1” ))
( m220 ! ( f o r a l l v9 v6 )
( ant ( p31 ( a c t ( p30 ( a c t i o n ( m214 ( l e x b e a r ) ) ) ( o b j e c t v9 ) ) ) ( a g e n t v6 ) ) )
( cq ( p24 ( c l a s s ( m12 ( l e x mammal ) ) ) ( member v6 ) ) ) ( k n c a t l i f e − r u l e . 1 ) )
( m220 ! )
CPU time : 0 . 0 5
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None
; I f t h e r e i s a p e r s o n and t h a t p e r s o n can c a r r y something , then t h e
; t h i n g t h a t can be c a r r i e d has t h e p r o p e r t y ” s m a l l ” .
( describe
( add f o r a l l ( $ t h i n g y $ p e r s o n )
&ant ( ( b u i l d member ∗ p e r s o n c l a s s ( b u i l d l e x ” p e r s o n ” ) )
( build agent ∗ person act ( build a c t i o n ( build l e x ” carry ” ) o b j e c t ∗ thingy ) ) )
cq ( b u i l d o b j e c t ∗ t h i n g y p r o p e r t y ( b u i l d l e x ” s m a l l ” ) )
kn cat ” l i f e − r u l e .2” ))
( m222 ! ( f o r a l l v11 v10 )
(& ant ( p34 ( a c t ( p33 ( a c t i o n ( m221 ( l e x c a r r y ) ) ) ( o b j e c t v10 ) ) ) ( a g e n t v11 ) )
( p32 ( c l a s s ( m39 ( l e x p e r s o n ) ) ) ( member v11 ) ) )
( cq ( p35 ( o b j e c t v10 ) ( p r o p e r t y ( m96 ( l e x s m a l l ) ) ) ) ) ( k n c a t l i f e − r u l e . 2 ) )
( m152 ! ( c l a s s ( m39 ) ) ( member b3 ) )
( m147 ! ( c l a s s ( m39 ) ) ( member b5 ) )
( m145 ! ( c l a s s ( m39 ) ) ( member b6 ) )
( m143 ! ( c l a s s ( m39 ) ) ( member b7 ) )
( m141 ! ( c l a s s ( m39 ) ) ( member b8 ) )
( m139 ! ( c l a s s ( m39 ) ) ( member b9 ) )
( m137 ! ( c l a s s ( m39 ) ) ( member b10 ) )
( m135 ! ( c l a s s ( m39 ) ) ( member b11 ) )
( m40 ! ( c l a s s ( m39 ) ) ( member b2 ) )
( m222 ! m152 ! m147 ! m145 ! m143 ! m141 ! m139 ! m137 ! m135 ! m40 ! )
CPU time : 0 . 3 1
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None
237
; I f something wants something then t h e t h i n g t h a t i s wanted i s v a l u a b l e
( describe
( add f o r a l l ( ∗ t h i n g y ∗ p e r s o n )
ant ( b u i l d a g e n t ∗ p e r s o n a c t ( b u i l d a c t i o n ( b u i l d l e x ”want” ) o b j e c t ∗ t h i n g y ) )
cq ( b u i l d o b j e c t ∗ t h i n g y p r o p e r t y ( b u i l d l e x ” v a l u a b l e ” ) )
kn cat ” l i f e − r u l e .2” ))
( m225 ! ( f o r a l l v11 v10 )
( ant ( p39 ( a c t ( p38 ( a c t i o n ( m223 ( l e x want ) ) ) ( o b j e c t v10 ) ) ) ( a g e n t v11 ) ) )
( cq ( p40 ( o b j e c t v10 ) ( p r o p e r t y ( m224 ( l e x v a l u a b l e ) ) ) ) ) ( k n c a t l i f e − r u l e . 2 ) )
( m225 ! )
CPU time : 0 . 0 4
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None
; I f something s a y s t h a t i t wants a n o t h e r t h i n g , then i t a c t u a l l y
; d o e s want t h a t t h i n g
( describe
( add f o r a l l ( ∗ t h i n g y ∗ p e r s o n )
ant ( b u i l d a g e n t ∗ p e r s o n a c t ( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( build agent ∗ person
a c t ( b u i l d a c t i o n ( b u i l d l e x ”want” )
object ∗ thingy ) ) ) )
cq ( b u i l d a g e n t ∗ p e r s o n
a c t ( b u i l d a c t i o n ( b u i l d l e x ”want” )
object ∗ thingy ))
kn cat ” l i f e − r u l e .2” ))
( m227 ! ( f o r a l l v11 v10 )
( ant
( p42
( a c t ( p41 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( p39 ( a c t ( p38 ( a c t i o n ( m223 ( l e x want ) ) ) ( o b j e c t v10 ) ) )
( a g e n t v11 ) ) ) ) )
( a g e n t v11 ) ) )
( cq ( p39 ) ) ( k n c a t l i f e − r u l e . 2 ) )
( m227 ! )
CPU time : 0 . 0 5
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
;
( describe
; I f a member o f some c l a s s has a p r o p e r t y t h a t i s a c o l o r ,
; then t h e c l a s s t h a t i t i s a member o f i s a s u b c l a s s o f ’ p h y s i c a l o b j e c t ’
( add f o r a l l ( $ t h i n g $prop $ f o o )
&ant ( ( b u i l d member ∗ f o o c l a s s ∗ t h i n g )
238
( b u i l d o b j e c t ∗ f o o p r o p e r t y ∗ prop )
( b u i l d member ∗ prop c l a s s ( b u i l d l e x ” c o l o r ” ) ) )
cq ( b u i l d s u b c l a s s ∗ t h i n g s u p e r c l a s s ( b u i l d l e x ” phys o b j ” ) )
kn cat ” i n t r i n s i c ” ))
( m228 ! ( f o r a l l v14 v13 v12 )
(& ant ( p45 ( c l a s s ( m92 ( l e x c o l o r ) ) ) ( member v13 ) )
( p44 ( o b j e c t v14 ) ( p r o p e r t y v13 ) ) ( p43 ( c l a s s v12 ) ( member v14 ) ) )
( cq ( p46 ( s u b c l a s s v12 ) ( s u p e r c l a s s ( m2 ( l e x phys o b j ) ) ) ) ) ( k n c a t i n t r i n s i c ) )
( m163 ! ( c l a s s ( m20 ( l e x b a s i c c t g y ) ) ) ( member ( m15 ( l e x d e e r ) ) ) )
( m162 ! ( c l a s s ( m20 ) ) ( member ( m22 ( l e x h o r s e ) ) ) )
( m161 ! ( c l a s s ( m20 ) ) ( member ( m29 ( l e x dog ) ) ) )
( m160 ! ( c l a s s ( m12 ( l e x mammal ) ) ) ( member b1 ) )
( m159 ! ( c l a s s ( m10 ( l e x c a r n i v o r e ) ) ) ( member b1 ) )
( m158 ! ( c l a s s ( m5 ( l e x v e r t e b r a t e ) ) ) ( member b1 ) )
( m157 ! ( c l a s s ( m4 ( l e x quadruped ) ) ) ( member b1 ) )
( m156 ! ( c l a s s ( m2 ) ) ( member b1 ) )
( m155 ! ( c l a s s ( m1 ( l e x animal ) ) ) ( member b1 ) )
( m154 ! ( c l a s s ( m20 ) ) ( member ( m39 ( l e x p e r s o n ) ) ) )
( m153 ! ( c l a s s ( m41 ( l e x k i n g ) ) ) ( member b3 ) )
( m152 ! ( c l a s s ( m39 ) ) ( member b3 ) )
( m151 ! ( c l a s s ( m84 ( l e x f u r n i t u r e ) ) ) ( member ( m53 ( l e x Round Table ) ) ) )
( m150 ! ( c l a s s ( m54 ( l e x t a b l e ) ) ) ( member ( m53 ) ) )
( m149 ! ( c l a s s ( m59 ( l e x sword ) ) ) ( member b4 ) )
( m148 ! ( c l a s s ( m43 ( l e x w i z a r d ) ) ) ( member b5 ) )
( m147 ! ( c l a s s ( m39 ) ) ( member b5 ) )
( m146 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( member b6 ) )
( m145 ! ( c l a s s ( m39 ) ) ( member b6 ) )
( m144 ! ( c l a s s ( m47 ) ) ( member b7 ) )
( m143 ! ( c l a s s ( m39 ) ) ( member b7 ) )
( m142 ! ( c l a s s ( m47 ) ) ( member b8 ) )
( m141 ! ( c l a s s ( m39 ) ) ( member b8 ) )
( m140 ! ( c l a s s ( m41 ) ) ( member b9 ) )
( m139 ! ( c l a s s ( m39 ) ) ( member b9 ) )
( m138 ! ( c l a s s ( m41 ) ) ( member b10 ) )
( m137 ! ( c l a s s ( m39 ) ) ( member b10 ) )
( m136 ! ( c l a s s ( m41 ) ) ( member b11 ) )
( m135 ! ( c l a s s ( m39 ) ) ( member b11 ) )
( m134 ! ( c l a s s ( m20 ) ) ( member ( m87 ( l e x c h a i r ) ) ) )
( m133 ! ( c l a s s ( m20 ) ) ( member ( m54 ) ) )
( m132 ! ( c l a s s ( m92 ) ) ( member ( m91 ( l e x w h i t e ) ) ) )
( m131 ! ( c l a s s ( m92 ) ) ( member ( m94 ( l e x b l a c k ) ) ) )
( m130 ! ( c l a s s ( m97 ( l e x s i z e ) ) ) ( member ( m96 ( l e x s m a l l ) ) ) )
( m129 ! ( c l a s s ( m97 ) ) ( member ( m101 ( l e x l a r g e ) ) ) )
( m40 ! ( c l a s s ( m39 ) ) ( member b2 ) )
( m37 ! ( c l a s s ( m29 ) ) ( member b1 ) )
( m228 ! m163 ! m162 ! m161 ! m160 ! m159 ! m158 ! m157 ! m156 ! m155 ! m154 ! m153 ! m152 !
m151 ! m150 ! m149 ! m148 ! m147 ! m146 ! m145 ! m144 ! m143 ! m142 ! m141 ! m140 ! m139 !
m138 ! m137 ! m136 ! m135 ! m134 ! m133 ! m132 ! m131 ! m130 ! m129 ! m40 ! m37 ! )
CPU time : 0 . 5 5
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
239
; I f a member o f some c l a s s has a p r o p e r t y t h a t i s a s i z e ,
; then t h e c l a s s t h a t i t i s a member o f i s a s u b c l a s s o f ’ p h y s i c a l o b j e c t ’
( describe
( add f o r a l l ( ∗ t h i n g ∗ prop ∗ f o o )
&ant ( ( b u i l d member ∗ f o o c l a s s ∗ t h i n g )
( b u i l d o b j e c t ∗ f o o p r o p e r t y ∗ prop )
( b u i l d member ∗ prop c l a s s ( b u i l d l e x ” s i z e ” ) ) )
cq ( b u i l d s u b c l a s s ∗ t h i n g s u p e r c l a s s ( b u i l d l e x ” phys o b j ” ) )
kn cat ” i n t r i n s i c ” ))
( m229 ! ( f o r a l l v14 v13 v12 )
(& ant ( p50 ( c l a s s ( m97 ( l e x s i z e ) ) ) ( member v13 ) )
( p44 ( o b j e c t v14 ) ( p r o p e r t y v13 ) ) ( p43 ( c l a s s v12 ) ( member v14 ) ) )
( cq ( p46 ( s u b c l a s s v12 ) ( s u p e r c l a s s ( m2 ( l e x phys o b j ) ) ) ) ) ( k n c a t i n t r i n s i c ) )
( m130 ! ( c l a s s ( m97 ) ) ( member ( m96 ( l e x s m a l l ) ) ) )
( m129 ! ( c l a s s ( m97 ) ) ( member ( m101 ( l e x l a r g e ) ) ) )
( m229 ! m130 ! m129 ! )
CPU time : 0 . 1 0
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; A weapon damages
( describe
( add f o r a l l $weapon1
ant ( b u i l d member ∗ weapon1 c l a s s ( b u i l d l e x ”weapon” ) )
cq ( b u i l d a g e n t ∗ weapon1 a c t ( b u i l d a c t i o n ( b u i l d l e x ”damage” ) ) )
kn cat ” l i f e − r u l e .1” ))
( m232 ! ( f o r a l l v15 ) ( ant ( p54 ( c l a s s ( m106 ( l e x weapon ) ) ) ( member v15 ) ) )
( cq ( p55 ( a c t ( m231 ( a c t i o n ( m230 ( l e x damage ) ) ) ) ) ( a g e n t v15 ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m232 ! )
CPU time : 0 . 0 8
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; I f something i s an e l d e r then t h a t t h i n g i s o l d and i s presumably a p e r s o n
( describe
( add f o r a l l $ e l d 1
ant ( b u i l d member ∗ e l d 1
class ( build lex ” elder ” ))
cq ( ( b u i l d o b j e c t ∗ e l d 1 p r o p e r t y ( b u i l d l e x ” o l d ” ) )
( b u i l d mode ( b u i l d l e x ” presumably ” )
o b j e c t ( b u i l d member ∗ e l d 1 c l a s s ( b u i l d l e x ” p e r s o n ” ) ) ) )
kn cat ” l i f e − r u l e .1” ))
( m235 ! ( f o r a l l v16 ) ( ant ( p59 ( c l a s s ( m233 ( l e x e l d e r ) ) ) ( member v16 ) ) )
( cq
( p62 ( mode ( m166 ( l e x presumably ) ) )
240
( o b j e c t ( p61 ( c l a s s ( m39 ( l e x p e r s o n ) ) ) ( member v16 ) ) ) )
( p60 ( o b j e c t v16 ) ( p r o p e r t y ( m234 ( l e x o l d ) ) ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m235 ! )
CPU time : 0 . 0 8
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
; i f one t h i n g c h a s e s a n o t h e r , t h e f o r m e r r u n s behind t h e l a t t e r
( describe
( add f o r a l l ( $ c h a s e r $ c h a s e e )
ant ( b u i l d a g e n t ∗ c h a s e r a c t ( b u i l d a c t i o n ( b u i l d l e x ” c h a s e ” ) o b j e c t ∗ c h a s e e ) )
cq ( ( b u i l d a g e n t ∗ c h a s e r a c t ( b u i l d a c t i o n ( b u i l d l e x ” run ” ) ) )
( b u i l d o b j e c t 1 ∗ c h a s e r r e l ( b u i l d l e x ” behind ” ) o b j e c t 2 ∗ c h a s e e ) )
kn cat ” l i f e − r u l e .1” ))
( m240 ! ( f o r a l l v18 v17 )
( ant ( p67 ( a c t ( p66 ( a c t i o n ( m236 ( l e x c h a s e ) ) ) ( o b j e c t v18 ) ) ) ( a g e n t v17 ) ) )
( cq ( p69 ( o b j e c t 1 v17 ) ( o b j e c t 2 v18 ) ( r e l ( m239 ( l e x behind ) ) ) )
( p68 ( a c t ( m238 ( a c t i o n ( m237 ( l e x run ) ) ) ) ) ( a g e n t v17 ) ) )
( kn cat l i f e − r u l e . 1 ) )
( m240 ! )
CPU time : 0 . 0 5
∗
; ; Newly i n f e r r e d i n f o r m a t i o n :
;;
; ; None .
End o f / p r o j e c t s / s t n 2 /CVA/demos/ j o u s t . b a s e d e m o n s t r a t i o n .
CPU time : 3 . 5 1
∗
;;
;;
;;
;;
;;
So i t was o r d a i n e d , and then a c r y was made t h a t e v e r y man
s h o u l d t r y who wished t o win t h e sword . And f o r New Year ’ s Day
t h e b a r o n s a r r a n g e d a j o u s t and a tournament , s o t h a t a l l k n i g h t s
who wished t o j o u s t o r t o u r n e y might j o i n . [ p . 8 ]
; ; Someone a r r a n g e d a something .
( describe
( as se r t a g e n t # b a r o n s 1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” a r r a n g e ” ) o b j e c t # j o u s t 1 )
time # j t 1 k n c a t ” s t o r y ” ) )
( m242 ! ( a c t ( m241 ( a c t i o n ( m121 ( l e x a r r a n g e ) ) ) ( o b j e c t b13 ) ) ) ( a g e n t b12 )
( k n c a t s t o r y ) ( time b14 ) )
( m242 ! )
241
CPU time : 0 . 0 1
∗
; ; The t h i n g happens a t some time
( describe
( as se r t e v e n t ∗ j o u s t 1 time # j t 2 k n c a t ” story−comp ” ) )
( m243 ! ( e v e n t b13 ) ( k n c a t story−comp ) ( time b15 ) )
( m243 ! )
CPU time : 0 . 0 0
∗
; ; The time t h a t t h e e v e n t was a r r a n g e d i s b e f o r e t h e time t h a t i t t a k e s p l a c e
( describe
( a s s e r t b e f o r e ∗ j t 1 a f t e r ∗ j t 2 k n c a t ” story−comp ” ) )
( m244 ! ( a f t e r b15 ) ( b e f o r e b14 ) ( k n c a t story−comp ) )
( m244 ! )
CPU time : 0 . 0 0
∗
; ; The a r r a n g e r i s a baron
( describe
( a sse r t member ∗ b a r o n s 1 c l a s s ( b u i l d l e x ” baron ” )
kn cat ” story ” ))
( m245 ! ( c l a s s ( m45 ( l e x baron ) ) ) ( k n c a t s t o r y ) ( member b12 ) )
( m245 ! )
CPU time : 0 . 0 0
∗
; ; The e v e n t i s a j o u s t
( describe
( add member ∗ j o u s t 1 c l a s s ( b u i l d l e x ” j o u s t ” ) k n c a t ” s t o r y ” ) )
( m248 ! ( c l a s s ( m246 ( l e x j o u s t ) ) ) ( member b13 ) )
( m247 ! ( c l a s s ( m246 ) ) ( k n c a t s t o r y ) ( member b13 ) )
( m248 ! m247 ! )
CPU time : 0 . 0 3
∗
; ; D e f i n e ” j o u s t ” a s a noun .
ˆ(
−−> defineNoun ” j o u s t ” )
Definition of joust :
A c t i o n s pe r f o r me d on a j o u s t : baron a r r a n g e ,
nil
CPU time : 0 . 5 3
242
∗
;;
;;
I f X i s a k n i g h t and X w i s h e s t o j o u s t then X might j o u s t .
;;
( Note : ” might ” i s used i n t h e s e n s e o f ” i s a l l o w e d t o ” h e r e )
( describe
( as se r t f o r a l l $ j k n i g h t
&ant ( ( b u i l d member ∗ j k n i g h t c l a s s ( b u i l d l e x k n i g h t ) )
( build agent ∗ j k n i g h t act
( b u i l d a c t i o n ( b u i l d l e x ” wish ” )
o b j e c t ( build agent ∗ j n k i g h t act
( build action ( build lex ” joust ” ))
time ∗ j t 2 ) ) ) )
cq ( b u i l d mode ( b u i l d l e x ” might ” )
o b j e c t ( build agent ∗ j n k i g h t act ( build a c t i o n ( build l e x ” j o u s t ” ) )
time ∗ j t 2 ) )
kn cat ” story ” ))
( m266 ! ( f o r a l l v21 )
(& ant
( p85
( a c t ( m263 ( a c t i o n ( m260 ( l e x wish ) ) )
( o b j e c t ( m262 ( a c t ( m261 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ) ) ( time b15 ) ) ) ) )
( a g e n t v21 ) )
( p84 ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( member v21 ) ) )
( cq ( m265 ( mode ( m264 ( l e x might ) ) ) ( o b j e c t ( m262 ) ) ) ) ( k n c a t s t o r y ) )
( m266 ! )
CPU time : 0 . 0 1
∗
; ; D e f i n e ” j o u s t ” a s a verb
ˆ(
−−> d e f i n e V e r b ” j o u s t ” )
”You want me t o d e f i n e t h e verb ’ j o u s t ’ .
I ’ l l s t a r t by l o o k i n g a t t h e p r e d i c a t e s t u c t u r e o f t h e s e n t e n c e s I know t h a t u s e ’ j o u s t ’ .
Here i s
The most common ty pe o f s e n t e n c e s I know o f t h a t u s e ’ j o u s t ’ a r e o f t h e form :
’A something can j o u s t . ’
’A something can j o u s t something . ’
’A something can j o u s t something t o something . ’
No s u p e r c l a s s e s were found f o r t h i s verb .
S o r t i n g from t h e most common p r e d i c a t e case t o t h e l e a s t common h e r e i s what I know .
I will firs
Now , l o o k i n g from t h e bottom up I want t o get a s e n s e o f t h e c a t e g o r i e s t h a t most o f t h e a g e n t s , o
”
CPU time : 0 . 0 2
∗
; ; The b a r o n s a r r a n g e d a something ( a t t h e same time t h a t they
243
;;
arranged the j o u s t ) .
( describe
( as se r t a g e n t ∗ b a r o n s 1 a c t
( build action ( build l e x ” arrange ” ) o b j e c t #tourney1 )
time ∗ j t 1 k n c a t ” s t o r y ” ) )
( m268 ! ( a c t ( m267 ( a c t i o n ( m121 ( l e x a r r a n g e ) ) ) ( o b j e c t b16 ) ) ) ( a g e n t b12 )
( k n c a t s t o r y ) ( time b14 ) )
( m268 ! )
CPU time : 0 . 0 1
∗
; ; The e v e n t t a k e s p l a c e a t t h e same time a s t h e j o u s t .
( describe
( as se r t e v e n t ∗ t o u r n e y 1 time ∗ j t 2 k n c a t ” story−comp ” ) )
( m269 ! ( e v e n t b16 ) ( k n c a t story−comp ) ( time b15 ) )
( m269 ! )
CPU time : 0 . 0 0
∗
; ; The time t h a t t h e e v e n t was a r r a n g e d i s b e f o r e t h e time t h a t
;;
t h e e v e n t took p l a c e
( describe
( a s s e r t b e f o r e ∗ j t 1 a f t e r ∗ j t 2 k n c a t ” story−comp ” ) )
( m244 ! ( a f t e r b15 ) ( b e f o r e b14 ) ( k n c a t story−comp ) )
( m244 ! )
CPU time : 0 . 0 0
∗
; ; The e v e n t i s a t o u r n e y
( describe
( a sse r t member ∗ t o u r n e y 1 c l a s s ( b u i l d l e x ” t o u r n e y ” )
kn cat ” story ” ))
( m270 ! ( c l a s s ( m108 ( l e x t o u r n e y ) ) ) ( k n c a t s t o r y ) ( member b16 ) )
( m270 ! )
CPU time : 0 . 0 0
∗
; ; A l l k n i g h t s who wished t o t o u r n e y might t o u r n e y .
;;
f o r a l l X i f X i s a k n i g h t and X w i s h e s t o t o u r n e y then X might t o u r n e y .
( describe
( a sse r t f o r a l l ∗ j k n i g h t
&ant ( ( b u i l d member ∗ j k n i g h t c l a s s ( b u i l d l e x k n i g h t ) )
( build agent ∗ j k n i g h t act
( b u i l d a c t i o n ( b u i l d l e x ” wish ” )
o b j e c t ( build agent ∗ j n k i g h t act
( build action ( build l e x ” tourney ” ) ) )
244
time ∗ j t 2 ) ) )
cq ( b u i l d mode ( b u i l d l e x ” might ” )
o b j e c t ( build agent ∗ j n k i g h t act
( build action ( build l e x ” tourney ” ) )
time ∗ j t 2 ) )
kn cat ” story ” ))
( m276 ! ( f o r a l l v21 )
(& ant
( p86
( a c t ( m273 ( a c t i o n ( m260 ( l e x wish ) ) )
( o b j e c t ( m272 ( a c t ( m271 ( a c t i o n ( m108 ( l e x t o u r n e y ) ) ) ) ) ) )
( time b15 ) ) )
( a g e n t v21 ) )
( p84 ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( member v21 ) ) )
( cq ( m275 ( mode ( m264 ( l e x might ) ) ) ( o b j e c t ( m274 ( a c t ( m271 ) ) ( time b15 ) ) ) ) )
( kn cat story ))
( m276 ! )
CPU time : 0 . 0 1
∗
; Upon New Year ’ s Day , when t h e s e r v i c e was done , t h e b a r o n s r o d e
; onto t h e f i e l d , some t o j o u s t and some t o t o u r n e y .
[p. 8]
;;
; ; The b a r o n s r o d e onto a something a t a time .
;;
( describe
( a ss er t a g e n t ∗ b a r o n s 1 a c t ( b u i l d a c t i o n ( b u i l d l e x ” r i d e ” ) onto # f i e l d 1 )
time # j t 3 k n c a t ” s t o r y ” ) )
( m279 ! ( a c t ( m278 ( a c t i o n ( m277 ( l e x r i d e ) ) ) ( onto b17 ) ) ) ( a g e n t b12 )
( k n c a t s t o r y ) ( time b18 ) )
( m279 ! )
CPU time : 0 . 0 1
∗
; ; The t h i n g t h e b a r o n s r o d e onto i s a f i e l d
( describe
( ass ert member ∗ f i e l d 1 c l a s s ( b u i l d l e x ” f i e l d ” ) k n c a t ” s t o r y ” ) )
( m281 ! ( c l a s s ( m280 ( l e x f i e l d ) ) ) ( k n c a t s t o r y ) ( member b17 ) )
( m281 ! )
CPU time : 0 . 0 0
∗
; ; The time t h e b a r o n s r o d e onto t h e f i e l d i s a f t e r t h e time t h a t the y
; ; arranged the ( j o u s t / tourney )
( describe
( a sse r t b e f o r e ∗ j t 1 a f t e r ∗ j t 3 k n c a t ” story−comp ” ) )
( m282 ! ( a f t e r b18 ) ( b e f o r e b14 ) ( k n c a t story−comp ) )
245
( m282 ! )
CPU time : 0 . 0 1
∗
; ; The time t h a t t h e b a r o n s r o d e onto t h e f i e l d i s a f t e r t h e time t h a t
;;
the ( j o u s t / tourney ) takes place
( describe
( a sse r t b e f o r e ∗ j t 3 a f t e r ∗ j t 2 k n c a t ” story−comp ” ) )
( m283 ! ( a f t e r b15 ) ( b e f o r e b18 ) ( k n c a t story−comp ) )
( m283 ! )
CPU time : 0 . 0 0
∗
; ; Some b a r o n s r o d e t o j o u s t on t h e f i e l d .
( describe
( a sse r t o b j e c t 1 ( a s s e r t a g e n t # b a r o n s 2 a c t
( b u i l d a c t i o n ( b u i l d l e x ” r i d e ” ) onto ∗ f i e l d 1 )
time ∗ j t 3 k n c a t ” s t o r y ” )
r e l ( b uild l e x ” purpose ” )
o b j e c t 2 ( bu ild agent ∗ barons2 act ( build a c t i o n ( build l e x ” j o u s t ” )
place ∗ f i e l d 1 )
time ∗ j t 2 )
kn cat ” story ” ))
( m288 ! ( k n c a t s t o r y )
( object1
( m284 ! ( a c t ( m278 ( a c t i o n ( m277 ( l e x r i d e ) ) ) ( onto b17 ) ) ) ( a g e n t b19 )
( k n c a t s t o r y ) ( time b18 ) ) )
( object2
( m287 ( a c t ( m286 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ( p l a c e b17 ) ) ) ( a g e n t b19 )
( time b15 ) ) )
( r e l ( m285 ( l e x p u r p o s e ) ) ) )
( m288 ! )
CPU time : 0 . 0 2
∗
; ; The b a r o n s who r o d e t o j o u s t a r e i n t h e s e t o f b a r o n s who a r r a n g e d t h e j o u s t
( describe
( add
subset ∗ barons2 s u p e r s e t ∗ barons1 kn cat ” s t o r y ” ) )
( m289 ! ( k n c a t s t o r y ) ( s u b s e t b19 ) ( s u p e r s e t b12 ) )
( m289 ! )
CPU time : 0 . 0 3
∗
; ; The s e c o n d s e t o f b a r o n s j o u s t
( describe
( as s ert a g e n t ∗ b a r o n s 2 a c t ( b u i l d a c t i o n ( b u i l d l e x ” j o u s t ” ) )
time ∗ j t 2 k n c a t ” story−comp ” ) )
246
( m290 ! ( a c t ( m261 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ) ) ( a g e n t b19 )
( k n c a t story−comp ) ( time b15 ) )
( m290 ! )
CPU time : 0 . 0 0
∗
; ; D e f i n e ” j o u s t ” a s a verb
ˆ(
−−> d e f i n e V e r b ” j o u s t ” )
”You want me t o d e f i n e t h e verb ’ j o u s t ’ .
I ’ l l s t a r t by l o o k i n g a t t h e p r e d i c a t e s t u c t u r e o f t h e s e n t e n c e s I know t h a t u s e ’ j o u s t ’ .
Here i s
The most common ty pe o f s e n t e n c e s I know o f t h a t u s e ’ j o u s t ’ a r e o f t h e form :
’A something can j o u s t . ’
No s u p e r c l a s s e s were found f o r t h i s verb .
S o r t i n g from t h e most common p r e d i c a t e case t o t h e l e a s t common h e r e i s what I know .
I will firs
Now , l o o k i n g from t h e bottom up I want t o get a s e n s e o f t h e c a t e g o r i e s t h a t most o f t h e a g e n t s , o
”
CPU time : 0 . 1 7
∗
; ; Others o f t h e b a r o n s r o d e t o t o u r n e y on t h e f i e l d .
( describe
( as se r t o b j e c t 1 ( a s s e r t a g e n t # b a r o n s 3 a c t
( build action ( build lex ” ride ”)
onto ∗ f i e l d 1 )
time ∗ j t 3 k n c a t ” s t o r y ” )
r e l ( b uild l e x ” purpose ” )
o b j e c t 2 ( bu ild agent ∗ barons3 act
( build action ( build l e x ” tourney ” )
place ∗ f i e l d 1 )
time ∗ j t 2 )
kn cat ” story ” ))
( m298 ! ( k n c a t s t o r y )
( object1
( m295 ! ( a c t ( m278 ( a c t i o n ( m277 ( l e x r i d e ) ) ) ( onto b17 ) ) ) ( a g e n t b20 )
( k n c a t s t o r y ) ( time b18 ) ) )
( object2
( m297 ( a c t ( m296 ( a c t i o n ( m108 ( l e x t o u r n e y ) ) ) ( p l a c e b17 ) ) ) ( a g e n t b20 )
( time b15 ) ) )
( r e l ( m285 ( l e x p u r p o s e ) ) ) )
( m298 ! )
CPU time : 0 . 0 1
∗
; ; The t h i r d group o f b a r o n s i s a s u b s e t o f t h e group o f b a r o n s who a r r a n g e d
;;
the j o u s t
247
( describe
( a sse r t s u b s e t ∗ b a r o n s 3 s u p e r s e t ∗ b a r o n s 1 k n c a t ” s t o r y ” ) )
( m299 ! ( k n c a t s t o r y ) ( s u b s e t b20 ) ( s u p e r s e t b12 ) )
( m299 ! )
CPU time : 0 . 0 1
∗
; ; The t h i r d group o f b a r o n s t o u r n e y .
( describe
( as se r t a g e n t ∗ b a r o n s 3 a c t ( b u i l d a c t i o n ( b u i l d l e x ” t o u r n e y ” ) )
time ∗ j t 2 k n c a t ” story−comp ” ) )
( m300 ! ( a c t ( m271 ( a c t i o n ( m108 ( l e x t o u r n e y ) ) ) ) ) ( a g e n t b20 )
( k n c a t story−comp ) ( time b15 ) )
( m300 ! )
CPU time : 0 . 0 1
∗
; And i t happened t h a t S i r E c t o r . . . r o d e unto t h e j o u s t ;
; ; with him r o d e h i s son S i r Kay and young Arthur .
[p. 8]
;;
;;
Something r o d e t o t h e j o u s t .
( describe
( as se rt a g e n t # E c t o r a c t
( build action ( build l e x ” r i d e ” ) to ∗ j o u s t 1 )
time ∗ j t 3 k n c a t ” s t o r y ” ) )
( m302 ! ( a c t ( m301 ( a c t i o n ( m277 ( l e x r i d e ) ) ) ( t o b13 ) ) ) ( a g e n t b21 )
( k n c a t s t o r y ) ( time b18 ) )
( m302 ! )
CPU time : 0 . 0 0
∗
; ; The t h i n g t h a t r o d e i n t o t h e j o u s t i s named ” S i r E c t o r ”
( describe
( a ss er t o b j e c t ∗ E c t o r proper−name ( b u i l d l e x ” S i r E c t o r ” ) k n c a t ” s t o r y ” ) )
( m304 ! ( k n c a t s t o r y ) ( o b j e c t b21 ) ( proper−name ( m303 ( l e x S i r E c t o r ) ) ) )
( m304 ! )
CPU time : 0 . 0 0
∗
; ; S i r Ector i s a knight
( describe
( as se r t member ∗ E c t o r c l a s s ( b u i l d l e x ” k n i g h t ” )
k n c a t ” story−comp ” ) )
( m305 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( k n c a t story−comp ) ( member b21 ) )
248
( m305 ! )
CPU time : 0 . 0 1
∗
; ; Something r o d e t o t h e j o u s t .
( describe
( a ss er t a g e n t #Kay a c t
( build action ( build l e x ” r i d e ” ) to ∗ j o u s t 1 )
time ∗ j t 3 k n c a t ” s t o r y ” ) )
( m306 ! ( a c t ( m301 ( a c t i o n ( m277 ( l e x r i d e ) ) ) ( t o b13 ) ) ) ( a g e n t b22 )
( k n c a t s t o r y ) ( time b18 ) )
( m306 ! )
CPU time : 0 . 0 1
∗
; ; The t h i n g t h a t r o d e t o t h e j o u s t i s named ” S i r Kay”
( describe
( a ss er t o b j e c t ∗ Kay proper−name ( b u i l d l e x ” S i r Kay” ) k n c a t ” s t o r y ” ) )
( m308 ! ( k n c a t s t o r y ) ( o b j e c t b22 ) ( proper−name ( m307 ( l e x S i r Kay ) ) ) )
( m308 ! )
CPU time : 0 . 0 0
∗
; ; S i r Kay i s a k n i g h t
( describe
( as se r t member ∗ Kay c l a s s ( b u i l d l e x ” k n i g h t ” )
k n c a t ” story−comp ” ) )
( m309 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( k n c a t story−comp ) ( member b22 ) )
( m309 ! )
CPU time : 0 . 0 0
∗
; ; S i r Kay i s t h e son o f S i r H ector .
( describe
( a sse r t o b j e c t 1 ∗ Kay r e l ( b u i l d l e x ” son ” ) o b j e c t 2 ∗ E c t o r k n c a t ” s t o r y ” ) )
( m311 ! ( k n c a t s t o r y ) ( o b j e c t 1 b22 ) ( o b j e c t 2 b21 ) ( r e l ( m310 ( l e x son ) ) ) )
( m311 ! )
CPU time : 0 . 0 1
∗
; ; S i r E c t o r i s t h e f a t h e r o f S i r Kay
( describe
( as s ert o b j e c t 1 ∗ E c t o r r e l ( b u i l d l e x ” f a t h e r ” ) o b j e c t 2 ∗ Kay
k n c a t ” story−comp ” ) )
249
( m313 ! ( k n c a t story−comp ) ( o b j e c t 1 b21 ) ( o b j e c t 2 b22 )
( r e l ( m312 ( l e x f a t h e r ) ) ) )
( m313 ! )
CPU time : 0 . 0 0
∗
; ; Someone r o d e t o t h e j o u s t .
( describe
( as s ert a g e n t #Arthur a c t ( b u i l d a c t i o n ( b u i l d l e x ” r i d e ” ) t o ∗ j o u s t 1 )
time ∗ j t 3 k n c a t ” s t o r y ” ) )
( m314 ! ( a c t ( m301 ( a c t i o n ( m277 ( l e x r i d e ) ) ) ( t o b13 ) ) ) ( a g e n t b23 )
( k n c a t s t o r y ) ( time b18 ) )
( m314 ! )
CPU time : 0 . 0 0
∗
; ; The t h i n g t h a t r o d e t o t h e j o u s t i s named ” Arthur ”
( describe
( ass ert o b j e c t ∗ Arthur proper−name ( b u i l d l e x ” Arthur ” ) k n c a t ” s t o r y ” ) )
( m316 ! ( k n c a t s t o r y ) ( o b j e c t b23 ) ( proper−name ( m315 ( l e x Arthur ) ) ) )
( m316 ! )
CPU time : 0 . 0 1
∗
; ; Arthur i s young
( describe
( as se r t o b j e c t ∗ Arthur p r o p e r t y ( b u i l d l e x ” young ” ) k n c a t ” s t o r y ” ) )
( m318 ! ( k n c a t s t o r y ) ( o b j e c t b23 ) ( p r o p e r t y ( m317 ( l e x young ) ) ) )
( m318 ! )
CPU time : 0 . 0 1
∗
; ; Arthur i s a p e r s o n
( describe
( a ss er t member ∗ Arthur c l a s s ( b u i l d l e x ” p e r s o n ” ) k n c a t ” story−comp ” ) )
( m319 ! ( c l a s s ( m39 ( l e x p e r s o n ) ) ) ( k n c a t story−comp ) ( member b23 ) )
( m319 ! )
CPU time : 0 . 0 1
∗
; ; D e f i n e ” j o u s t ” a s a noun .
ˆ(
−−> defineNoun ” j o u s t ” )
Definition of joust :
250
A c t i o n s pe r fo r m e d on a j o u s t : baron a r r a n g e ,
nil
CPU time : 0 . 2 8
∗
; ; But a s the y r o d e toward t h e j o u s t S i r Kay l a c k e d h i s sword , f o r
; ; he had l e f t i t a t h i s f a t h e r ’ s l o d g i n g . . . [ p . 8 ]
;;
; ; S i r Kay l a c k e d h i s something b e c a u s e he had l e f t i t somewhere .
( describe
( ass er t
e f f e c t ( a s s e r t a g e n t ∗ Kay a c t
( b u i l d a c t i o n ( b u i l d l e x ” l a c k ” ) o b j e c t #kaysword )
time ∗ j t 3 k n c a t ” s t o r y ” )
c a u s e ( a s s e r t a g e n t ∗ Kay a c t
( b u i l d a c t i o n ( b u i l d l e x ” l e a v e ” ) o b j e c t ∗ kaysword
place #lodge1 )
time # j t 4 k n c a t ” s t o r y ” )
kn cat ” story ” ))
( m328 !
( cause
( m327 ! ( a c t ( m326 ( a c t i o n ( m325 ( l e x l e a v e ) ) ) ( o b j e c t b24 ) ( p l a c e b25 ) ) )
( a g e n t b22 ) ( k n c a t s t o r y ) ( time b26 ) ) )
( effect
( m324 ! ( a c t ( m323 ( a c t i o n ( m322 ( l e x l a c k ) ) ) ( o b j e c t b24 ) ) ) ( a g e n t b22 )
( k n c a t s t o r y ) ( time b18 ) ) )
( kn cat story ))
( m328 ! )
CPU time : 0 . 0 2
∗
; ; The t h i n g t h a t S i r Kay l e f t somewhere i s h i s sword .
( describe
( as se rt o b j e c t ∗ kaysword r e l ( b u i l d l e x ” sword ” )
p o s s e s s o r ∗ Kay k n c a t ” s t o r y ” ) )
( m329 ! ( k n c a t s t o r y ) ( o b j e c t b24 ) ( p o s s e s s o r b22 ) ( r e l ( m59 ( l e x sword ) ) ) )
( m329 ! )
CPU time : 0 . 0 0
∗
; ; S i r Kay ’ s sword i s a sword .
( describe
( as s ert member ∗ kaysword c l a s s ( b u i l d l e x ” sword ” ) k n c a t ” s t o r y ” ) )
( m330 ! ( c l a s s ( m59 ( l e x sword ) ) ) ( k n c a t s t o r y ) ( member b24 ) )
( m330 ! )
CPU time : 0 . 0 1
∗
251
; ; The p l a c e t h a t S i r Kay l e f t h i s sword i s S i r E c t o r ’ s l o d g i n g
( describe
( as se rt o b j e c t ∗ l o d g e 1 r e l ( b u i l d l e x ” l o d g i n g ” ) p o s s e s s o r ∗ E c t o r
kn cat ” story ” ))
( m332 ! ( k n c a t s t o r y ) ( o b j e c t b25 ) ( p o s s e s s o r b21 ) ( r e l ( m331 ( l e x l o d g i n g ) ) ) )
( m332 ! )
CPU time : 0 . 0 0
∗
; ; S i r Ector ’ s l o d g i n g i s a l o d g i n g
( describe
( as s ert member ∗ l o d g e 1 c l a s s ( b u i l d l e x ” l o d g i n g ” ) k n c a t ” s t o r y ” ) )
( m333 ! ( c l a s s ( m331 ( l e x l o d g i n g ) ) ) ( k n c a t s t o r y ) ( member b25 ) )
( m333 ! )
CPU time : 0 . 0 1
∗
; ; The time t h a t S i r Kay l e f t h i s sword i s b e f o r e t h e time t h a t
; ; he came t o t h e f i e l d
( describe
( a sse r t b e f o r e ∗ j t 4 a f t e r ∗ j t 3 k n c a t ” story−comp ” ) )
( m334 ! ( a f t e r b18 ) ( b e f o r e b26 ) ( k n c a t story−comp ) )
( m334 ! )
CPU time : 0 . 0 1
∗
; ; But when [ Arthur ] r e a c h e d home t h e l a d y and a l l t h e o t h e r s were
; ; out t o s e e t h e j o u s t i n g , and he c o u l d not e n t e r .
[p. 8]
;;
; ; Arthur a r r i v e d a t t h e l o d g i n g .
( describe
( a sse r t a g e n t ∗ Arthur a c t
( build action ( build lex ” a r r i v e ” ) place ∗ lodge1 )
time # j t 5
kn cat ” story ” ))
( m337 ! ( a c t ( m336 ( a c t i o n ( m335 ( l e x a r r i v e ) ) ) ( p l a c e b25 ) ) ) ( a g e n t b23 )
( k n c a t s t o r y ) ( time b27 ) )
( m337 ! )
CPU time : 0 . 0 2
∗
; ; Arthur a r r i v e d a t t h e l o d g i n g a f t e r he r o d e onto t h e f i e l d
( describe
( as se r t b e f o r e ∗ j t 3 a f t e r ∗ j t 5 k n c a t ” story−comp ” ) )
( m338 ! ( a f t e r b27 ) ( b e f o r e b18 ) ( k n c a t story−comp ) )
252
( m338 ! )
CPU time : 0 . 0 0
∗
; ; Arthur c o u l d not e n t e r t h e l o d g i n g , b e c a u s e no−one was i n t h e l o d g i n g .
( describe
( a sse r t c a u s e ( a s s er t f o r a l l $human
ant ( b u i l d member ∗ human c l a s s ( b u i l d l e x ” p e r s o n ” ) )
cq ( b u i l d min 0 max 0
a r g ( b u i l d o b j e c t 1 ∗ human
r e l ( build lex ” in ”)
object2 ∗ lodge1
time ∗ j t 5 ) )
kn cat ” story ” ) = stage1
e f f e c t ( a s s e r t min 0 max 0
a r g ( b u i l d mode ( b u i l d l e x ” can ” )
o b j e c t ( b u i l d a g e n t ∗ Arthur
act ( build action
( build lex ” enter ”)
object ∗ lodge1 )
time ∗ j t 5 ) )
kn cat ” story ” )
kn cat ” story ” ))
( m347 !
( cause
( m340 ! ( f o r a l l v24 ) ( ant ( p91 ( c l a s s ( m39 ( l e x p e r s o n ) ) ) ( member v24 ) ) )
( cq
( p93 ( min 0 ) (max 0 )
( arg
( p92 ( o b j e c t 1 v24 ) ( o b j e c t 2 b25 ) ( r e l ( m339 ( l e x i n ) ) ) ( time b27 ) ) ) ) )
( kn cat story ) ) )
( effect
( m346 ! ( min 0 ) (max 0 )
( arg
( m345 ( mode ( m341 ( l e x can ) ) )
( object
( m344 ( a c t ( m343 ( a c t i o n ( m342 ( l e x e n t e r ) ) ) ( o b j e c t b25 ) ) ) ( a g e n t b23 )
( time b27 ) ) ) ) )
( kn cat story ) ) )
( kn cat story ))
( m347 ! )
CPU time : 0 . 0 3
∗
; ; No−one was i n t h e l o d g i n g , b e c a u s e e v e r y o n e had l e f t .
( describe
( a ss er t e f f e c t ∗ s t a g e 1
c a u s e ( a s s e r t f o r a l l ( ∗ human $timev )
&ant ( ( b u i l d member ∗ human c l a s s ( b u i l d l e x ” p e r s o n ” ) )
( b u i l d o b j e c t 1 ∗ human r e l ( b u i l d l e x ” i n ” )
o b j e c t 2 ∗ l o d g e 1 time ∗ timev )
( b u i l d b e f o r e ∗ timev a f t e r ∗ j t 5 ) )
cq ( ( b u i l d a g e n t ∗ human a c t
253
( build action ( build lex ” leave ”)
place ∗ lodge1 )
time ( b u i l d s k f ” l e a v e − t im e ”
a1 ∗ human a2 ∗ l o d g e 1 ) = gotime1 )
( b u i l d b e f o r e ∗ timev a f t e r ∗ gotime1 )
( b u i l d b e f o r e ∗ gotime1 a f t e r ∗ j t 5 ) )
kn cat ” story ” ) = stage2
kn cat ” story ” ))
( m350 !
( cause
( m349 ! ( f o r a l l v25 v24 )
(& ant ( p95 ( a f t e r b27 ) ( b e f o r e v25 ) )
( p94 ( o b j e c t 1 v24 ) ( o b j e c t 2 b25 ) ( r e l ( m339 ( l e x i n ) ) ) ( time v25 ) )
( p91 ( c l a s s ( m39 ( l e x p e r s o n ) ) ) ( member v24 ) ) )
( cq ( p99 ( a f t e r b27 ) ( b e f o r e ( p96 ( a1 v24 ) ( a2 b25 ) ( s k f l e a v e − t im e ) ) ) )
( p98 ( a f t e r ( p96 ) ) ( b e f o r e v25 ) )
( p97 ( a c t ( m348 ( a c t i o n ( m325 ( l e x l e a v e ) ) ) ( p l a c e b25 ) ) ) ( a g e n t v24 )
( time ( p96 ) ) ) )
( kn cat story ) ) )
( effect
( m340 ! ( f o r a l l v24 ) ( ant ( p91 ) )
( cq
( p93 ( min 0 ) (max 0 )
( a r g ( p92 ( o b j e c t 1 v24 ) ( o b j e c t 2 b25 ) ( r e l ( m339 ) ) ( time b27 ) ) ) ) )
( kn cat story ) ) )
( kn cat story ))
( m350 ! )
CPU time : 0 . 0 2
∗
; ; Everyone was out , b e c a u s e the y wished t o s e e t h e j o u s t .
( describe
( as se rt f o r a l l ∗ human
&ant ( ( b u i l d member ∗ human c l a s s ( b u i l d l e x ” p e r s o n ” ) )
( b u i l d o b j e c t 1 ∗ human r e l ( b u i l d l e x ” i n ” ) o b j e c t 2 ∗ l o d g e 1 ) )
cq ( b u i l d a g e n t ∗ human a c t
( b u i l d a c t i o n ( b u i l d l e x ” wish ” )
o b j e c t ( b u i l d a g e n t ∗ human a c t
( build action ( build lex ” see ”)
object ∗ joust1 ))))
kn cat ” story ” ) = stage3 )
( m353 ! ( f o r a l l v24 )
(& ant ( p100 ( o b j e c t 1 v24 ) ( o b j e c t 2 b25 ) ( r e l ( m339 ( l e x i n ) ) ) )
( p91 ( c l a s s ( m39 ( l e x p e r s o n ) ) ) ( member v24 ) ) )
( cq
( p103
( a c t ( p102 ( a c t i o n ( m260 ( l e x wish ) ) )
( object
( p101 ( a c t ( m352 ( a c t i o n ( m351 ( l e x s e e ) ) ) ( o b j e c t b13 ) ) )
( a g e n t v24 ) ) ) ) )
( a g e n t v24 ) ) )
( kn cat story ))
( m353 ! )
254
CPU time : 0 . 0 2
∗
; ; S i n c e e v e r y o n e was out b e c a u s e they wished t o s e e t h e j o u s t ,
; ; no one was i n t h e l o d g i n g ( b e c a u s e the y a l l had l e f t )
( describe
( as se r t e f f e c t ∗ s t a g e 2
cause ∗ stage3
kn cat ” story ” ))
( m354 !
( cause
( m353 ! ( f o r a l l v24 )
(& ant ( p100 ( o b j e c t 1 v24 ) ( o b j e c t 2 b25 ) ( r e l ( m339 ( l e x i n ) ) ) )
( p91 ( c l a s s ( m39 ( l e x p e r s o n ) ) ) ( member v24 ) ) )
( cq
( p103
( a c t ( p102 ( a c t i o n ( m260 ( l e x wish ) ) )
( object
( p101 ( a c t ( m352 ( a c t i o n ( m351 ( l e x s e e ) ) ) ( o b j e c t b13 ) ) )
( a g e n t v24 ) ) ) ) )
( a g e n t v24 ) ) )
( kn cat story ) ) )
( effect
( m349 ! ( f o r a l l v25 v24 )
(& ant ( p95 ( a f t e r b27 ) ( b e f o r e v25 ) )
( p94 ( o b j e c t 1 v24 ) ( o b j e c t 2 b25 ) ( r e l ( m339 ) ) ( time v25 ) ) ( p91 ) )
( cq ( p99 ( a f t e r b27 ) ( b e f o r e ( p96 ( a1 v24 ) ( a2 b25 ) ( s k f l e a v e − t im e ) ) ) )
( p98 ( a f t e r ( p96 ) ) ( b e f o r e v25 ) )
( p97 ( a c t ( m348 ( a c t i o n ( m325 ( l e x l e a v e ) ) ) ( p l a c e b25 ) ) ) ( a g e n t v24 )
( time ( p96 ) ) ) )
( kn cat story ) ) )
( kn cat story ))
( m354 ! )
CPU time : 0 . 0 2
∗
; ; D e f i n e ” j o u s t ” a s a noun
ˆ(
−−> defineNoun ” j o u s t ” )
Definition of joust :
A c t i o n s pe r fo r me d on a j o u s t : baron a r r a n g e ,
nil
CPU time : 1 . 0 9
∗
; ; Then t h e k i n g a r r a n g e d f o r a g r e a t f e a s t and l e t c r y a g r e a t
;;
j o u s t . . . . a s soon a s the y had washed and r i s e n , a l l
;;
k n i g h t s who would j o u s t made them ready ; when they were ready on
;;
h o r s e b a c k , t h e r e were s e v e n hundred k n i g h t s .
[p. 16]
;;
; ; Something announced a something .
( describe
( as se rt a g e n t # k i n g j 1 a c t
255
( b u i l d a c t i o n ( b u i l d l e x ” announce ” ) o b j e c t # j o u s t 2 )
time # j t 6 k n c a t ” s t o r y ” ) )
( m373 ! ( a c t ( m372 ( a c t i o n ( m371 ( l e x announce ) ) ) ( o b j e c t b29 ) ) ) ( a g e n t b28 )
( k n c a t s t o r y ) ( time b30 ) )
( m373 ! )
CPU time : 0 . 0 1
∗
; ; The t h i n g t h a t announced i s a k i n g
( describe
( as se r t member ∗ k i n g j 1 c l a s s ( b u i l d l e x ” k i n g ” ) k n c a t ” s t o r y ” ) )
( m374 ! ( c l a s s ( m41 ( l e x k i n g ) ) ) ( k n c a t s t o r y ) ( member b28 ) )
( m374 ! )
CPU time : 0 . 0 1
∗
; ; The t h i n g t h a t t h e k i n g announced i s a j o u s t
( describe
( a sse r t member ∗ j o u s t 2 c l a s s ( b u i l d l e x ” j o u s t ” ) k n c a t ” s t o r y ” ) )
( m375 ! ( c l a s s ( m246 ( l e x j o u s t ) ) ) ( k n c a t s t o r y ) ( member b29 ) )
( m375 ! )
CPU time : 0 . 0 1
∗
; ; The j o u s t i s g r e a t
( describe
( a sse r t o b j e c t ∗ j o u s t 2 p r o p e r t y ( b u i l d l e x ” g r e a t ” ) k n c a t ” s t o r y ” ) )
( m377 ! ( k n c a t s t o r y ) ( o b j e c t b29 ) ( p r o p e r t y ( m376 ( l e x g r e a t ) ) ) )
( m377 ! )
CPU time : 0 . 0 0
∗
; ; D e f i n e ” j o u s t ” a s a noun
ˆ(
−−> defineNoun ” j o u s t ” )
Definition of joust :
A c t i o n s pe r fo r me d on a j o u s t : k i n g announce , baron a r r a n g e ,
Possible Properties : great ,
nil
CPU time : 0 . 9 4
∗
; ; A l l t h e k n i g h t s who wished t o j o u s t p r e p a r e d t o j o u s t .
( describe
( as s ert f o r a l l ∗ j k n i g h t
256
&ant ( ( b u i l d member ∗ j k n i g h t c l a s s ( b u i l d l e x k n i g h t ) )
( build agent ∗ j k n i g h t act
( b u i l d a c t i o n ( b u i l d l e x ” wish ” )
o b j e c t ( build agent ∗ j n k i g h t act
( build action ( build lex ” joust ” ) ) ) )
time ∗ j t 6 ) )
cq ( b u i l d a g e n t ∗ j k n g h t a c t
( build action ( build lex ” prepare ” )
o b j e c t ( agent ∗ j k n i g h t act
( build action ( build lex ” joust ” ) ) ) ) )
kn cat ” story ” ))
( m399 ! ( f o r a l l v21 )
(& ant
( p122
( a c t ( m397 ( a c t i o n ( m260 ( l e x wish ) ) )
( o b j e c t ( m396 ( a c t ( m261 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ) ) ) ) ) )
( a g e n t v21 ) ( time b30 ) )
( p84 ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( member v21 ) ) )
( cq
( p124
( a c t ( p123 ( a c t i o n ( m398 ( l e x p r e p a r e ) ) ) ( o b j e c t a c t a g e n t ( m261 ) v21 ) ) ) ) )
( kn cat story ))
( m399 ! )
CPU time : 0 . 0 1
∗
; ; D e f i n e ” j o u s t ” a s a verb
ˆ(
−−> d e f i n e V e r b ” j o u s t ” )
”You want me t o d e f i n e t h e verb ’ j o u s t ’ .
I ’ l l s t a r t by l o o k i n g a t t h e p r e d i c a t e s t u c t u r e o f t h e s e n t e n c e s I know t h a t u s e ’ j o u s t ’ .
Here i s
The most common type o f s e n t e n c e s I know o f t h a t u s e ’ j o u s t ’ a r e o f t h e form :
’A something can j o u s t . ’
No s u p e r c l a s s e s were found f o r t h i s verb .
S o r t i n g from t h e most common p r e d i c a t e case t o t h e l e a s t common h e r e i s what I know .
I will firs
Now , l o o k i n g from t h e bottom up I want t o get a s e n s e o f t h e c a t e g o r i e s t h a t most o f t h e a g e n t s , o
”
CPU time : 0 . 0 3
∗
;;
;;
;;
;;
;;
;;
;;
;;
With t h a t t h e k n i g h t came out o f t h e p a v i l i o n and s a i d , ‘ F a i r k n i g h t ,
why smote ye down my s h i e l d ? ’
‘ Because I w i l l j o u s t with you , ’ s a i d G r y f l e t t e .
‘ I t i s b e t t e r t h a t ye do not , ’ s a i d t h e k n i g h t , ‘ f o r ye a r e young and
l a t e l y made k n i g h t , and your might i s n o t h i n g t o mine . ’
‘ As f o r t h a t , ” s a i d G r y f l e t t e , ‘ I w i l l j o u s t with you . ’
[p. 33]
A something came from something e l s e .
257
( describe
( ass er t a g e n t # b l k n t 1 a c t
( b u i l d a c t i o n ( b u i l d l e x ”come” ) from # j p a v i l i o n 1 )
time # j t 7 k n c a t ” s t o r y ” ) )
( m402 ! ( a c t ( m401 ( a c t i o n ( m400 ( l e x come ) ) ) ( from b32 ) ) ) ( a g e n t b31 )
( k n c a t s t o r y ) ( time b33 ) )
( m402 ! )
CPU time : 0 . 0 1
∗
; ; The t h i n g t h a t came i s a k n i g h t
( describe
( a ss er t member ∗ b l k n t 1 c l a s s ( b u i l d l e x ” k n i g h t ” ) k n c a t ” s t o r y ” ) )
( m403 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( k n c a t s t o r y ) ( member b31 ) )
( m403 ! )
CPU time : 0 . 0 1
∗
; ; The t h i n g t h e k n i g h t came from i s a p a v i l i o n
( describe
( a sse r t member ∗ j p a v i l i o n 1 c l a s s ( b u i l d l e x ” p a v i l i o n ” )
kn cat ” story ” ))
( m405 ! ( c l a s s ( m404 ( l e x p a v i l i o n ) ) ) ( k n c a t s t o r y ) ( member b32 ) )
( m405 ! )
CPU time : 0 . 0 0
∗
; ; The k n i g h t as ked something why he smote down t h e something e l s e .
( describe
( a sse r t a g e n t ∗ b l k n t 1 a c t
( b u i l d a c t i o n ( b u i l d l e x ” ask ” ) i n d o b j #Gryf
o b j e c t ( build r e l ( b uild l e x ” purpose ” )
o b j e c t 2 ( a ss er t a g e n t ∗ Gryf a c t
( build action ( build lex ” smite ” )
object #knt1shield
direction
( b u i l d l e x ”down” ) )
time # j t 8 k n c a t ” s t o r y ” ) = oddact1
o b j e c t 1 ( b u i l d s k f ” r e a s o n − f o r ” a1 ∗ oddact1 ) ) )
time ∗ j t 7 k n c a t ” s t o r y ” ) )
( m414 !
( a c t ( m413 ( a c t i o n ( m406 ( l e x ask ) ) ) ( i n d o b j b34 )
( object
( m412
( object1
( m411
( a1
( m410 !
258
( a c t ( m409 ( a c t i o n ( m407 ( l e x s m i t e ) ) )
( d i r e c t i o n ( m408 ( l e x down ) ) ) ( o b j e c t b35 ) ) )
( a g e n t b34 ) ( k n c a t s t o r y ) ( time b36 ) ) )
( skf reason−for ) ) )
( o b j e c t 2 ( m410 ! ) ) ( r e l ( m285 ( l e x p u r p o s e ) ) ) ) ) ) )
( a g e n t b31 ) ( k n c a t s t o r y ) ( time b33 ) )
( m414 ! )
CPU time : 0 . 0 2
∗
; ; The t h i n g t h a t t h e k n i g h t asked i s named ” S i r G r y f l e t t e ”
( describe
( a s s e r t o b j e c t ∗ Gryf proper−name ( b u i l d l e x ” S i r G r y f l e t t e ” ) k n c a t ” s t o r y ” ) )
( m416 ! ( k n c a t s t o r y ) ( o b j e c t b34 ) ( proper−name ( m415 ( l e x S i r G r y f l e t t e ) ) ) )
( m416 ! )
CPU time : 0 . 0 1
∗
; ; The t h i n g t h a t S i r G r y f l e t t e smote down i s a s h i e l d
( describe
( as se r t o b j e c t ∗ k n t 1 s h i e l d r e l ( b u i l d l e x ” s h i e l d ” ) p o s s e s s o r ∗ b l k n t 1
kn cat ” story ” ))
( m418 ! ( k n c a t s t o r y ) ( o b j e c t b35 ) ( p o s s e s s o r b31 ) ( r e l ( m417 ( l e x s h i e l d ) ) ) )
( m418 ! )
CPU time : 0 . 0 0
∗
; ; The s h i e l d t h a t S i r G r y f l e t t e smote down i s a s h i e l d
( describe
( as s ert member ∗ k n t 1 s h i e l d c l a s s ( b u i l d l e x ” s h i e l d ” ) k n c a t ” s t o r y ” ) )
( m419 ! ( c l a s s ( m417 ( l e x s h i e l d ) ) ) ( k n c a t s t o r y ) ( member b35 ) )
( m419 ! )
CPU time : 0 . 0 0
∗
; ; Sir Gryflette i s a knight
( describe
( a sse r t member ∗ Gryf c l a s s ( b u i l d l e x ” k n i g h t ” )
k n c a t ” story−comp ” ) )
( m420 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( k n c a t story−comp ) ( member b34 ) )
( m420 ! )
CPU time : 0 . 0 1
∗
259
; ; The k n i g h t as ked S i r G r y f l e t t e about t h e s h e i l d a f t e r he came from
;;
the p a v i l i o n
( describe
( as se rt b e f o r e ∗ j t 8 a f t e r ∗ j t 7 k n c a t ” story−comp ” ) )
( m421 ! ( a f t e r b33 ) ( b e f o r e b36 ) ( k n c a t story−comp ) )
( m421 ! )
CPU time : 0 . 0 0
∗
; ; S i r G r y f l e t t e s a i d t h a t he would j o u s t with t h e k n i g h t .
( describe
( a sse r t a g e n t ∗ Gryf a c t
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d a g e n t ∗ Gryf a c t
( build action ( build lex ” joust ” ) against ∗ blknt1 )
time # j t 9 ) )
time # j t 1 0 k n c a t ” s t o r y ” ) )
( m425 !
( a c t ( m424 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m423 ( a c t ( m422 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ( a g a i n s t b31 ) ) )
( a g e n t b34 ) ( time b37 ) ) ) ) )
( a g e n t b34 ) ( k n c a t s t o r y ) ( time b38 ) )
( m425 ! )
CPU time : 0 . 0 1
∗
; ; S i r G r y f l e t t e s a i d t h a t he would j o u s t with t h e k n i g h t b e f o r e
;;
t h e j o u s t a c t u a l l y too k p l a c e
( describe ( as s e r t b e f o r e ∗ j t 1 0 a f t e r ∗ j t 9 k n c a t ” s t o r y ” ) )
( m426 ! ( a f t e r b37 ) ( b e f o r e b38 ) ( k n c a t s t o r y ) )
( m426 ! )
CPU time : 0 . 0 0
∗
; ; The j o u s t to ok p l a c e a f t e r t h e k n i g h t came from t h e p a v i l i o n
( describe ( a s s er t b e f o r e ∗ j t 8 a f t e r ∗ j t 1 0 k n c a t ” story−comp ” ) )
( m427 ! ( a f t e r b38 ) ( b e f o r e b36 ) ( k n c a t story−comp ) )
( m427 ! )
CPU time : 0 . 0 0
∗
; ; The k n i g h t s a i d t h a t S i r G r y f l e t t e s h o u l d not j o u s t with him ,
; ; b e c a u s e S i r G r y f l e t t e was young .
( describe
( a sse r t a g e n t ∗ b l k n t 1 a c t
260
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d c a u s e ( b u i l d o b j e c t ∗ Gryf p r o p e r t y ( b u i l d l e x ” young ” ) )
e f f e c t ( b u i l d mode ( b u i l d l e x ” s h o u l d ” )
o b j e c t ( b u i l d min 0 max 0
a r g ( b u i l d a g e n t ∗ Gryf
act ( build action ( build lex
against ∗ blknt1 )
time ∗ j t 9 ) ) ) ) )
time # j t 1 1 k n c a t ” s t o r y ” ) )
( m434 !
( a c t ( m433 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m432 ( c a u s e ( m428 ( o b j e c t b34 ) ( p r o p e r t y ( m317 ( l e x young ) ) ) ) )
( effect
( m431 ( mode ( m429 ( l e x s h o u l d ) ) )
( object
( m430 ( min 0 ) (max 0 )
( arg
( m423 ( a c t ( m422 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ( a g a i n s t b31 ) ) )
( a g e n t b34 ) ( time b37 ) ) ) ) ) ) ) ) ) ) )
( a g e n t b31 ) ( k n c a t s t o r y ) ( time b39 ) )
( m434 ! )
CPU time : 0 . 0 2
∗
; ; The k n i g h t s a y s t h a t S i r G r y f l e t t e s h o u l d not j o u s t b e f o r e t h e j o u s t
;;
takes place .
( describe ( as s e r t b e f o r e ∗ j t 1 1 a f t e r ∗ j t 9 k n c a t ” s t o r y ” ) )
( m435 ! ( a f t e r b37 ) ( b e f o r e b39 ) ( k n c a t s t o r y ) )
( m435 ! )
CPU time : 0 . 0 0
∗
; ; The k n i g h t s a y s t h a t S i r G r y f l e t t e s h o u l d not j o u s t b e f o r e
;;
S i r G r y f l e t t e o f f e r s to j o u s t
( describe ( a s s er t b e f o r e ∗ j t 1 0 a f t e r ∗ j t 1 1 k n c a t ” story−comp ” ) )
( m436 ! ( a f t e r b39 ) ( b e f o r e b38 ) ( k n c a t story−comp ) )
( m436 ! )
CPU time : 0 . 0 0
∗
; ; The k n i g h t s a i d t h a t S i r G r y f l e t t e s h o u l d not j o u s t with him ,
; ; b e c a u s e something was g r e a t e r than something e l s e .
( describe
( a sse r t a g e n t ∗ b l k n t 1 a c t
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d c a u s e ( b u i l d o b j e c t 1 # knt1might r e l ( b u i l d l e x ” g r e a t e r ” )
o b j e c t 2 #Gryfmight )
e f f e c t ( b u i l d mode ( b u i l d l e x ” s h o u l d ” )
261
o b j e c t ( b u i l d min 0 max 0
a r g ( b u i l d a g e n t ∗ Gryf
act ( build action
( build lex ” joust ”
against ∗ blknt1 )
time ∗ j t 9 ) ) ) ) )
time ∗ j t 1 1 k n c a t ” s t o r y ” ) )
( m441 !
( a c t ( m440 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m439
( c a u s e ( m438 ( o b j e c t 1 b40 ) ( o b j e c t 2 b41 ) ( r e l ( m437 ( l e x g r e a t e r ) ) ) ) )
( effect
( m431 ( mode ( m429 ( l e x s h o u l d ) ) )
( object
( m430 ( min 0 ) (max 0 )
( arg
( m423 ( a c t ( m422 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ( a g a i n s t b31 ) ) )
( a g e n t b34 ) ( time b37 ) ) ) ) ) ) ) ) ) ) )
( a g e n t b31 ) ( k n c a t s t o r y ) ( time b39 ) )
( m441 ! )
CPU time : 0 . 0 1
∗
; ; The g r e a t e r t h i n g i s t h e k n i g h t ’ s might
( describe ( as s e r t o b j e c t ∗ knt1might r e l ( b u i l d l e x ” might ” ) p o s s e s s o r ∗ b l k n t 1
kn cat ” story ” ))
( m442 ! ( k n c a t s t o r y ) ( o b j e c t b40 ) ( p o s s e s s o r b31 ) ( r e l ( m264 ( l e x might ) ) ) )
( m442 ! )
CPU time : 0 . 0 0
∗
; ; The l e s s e r t h i n g i s S i r G r y f l e t t e ’ s might
( describe ( as s er t o b j e c t ∗ Gryfmight r e l ( b u i l d l e x ” might ” ) p o s s e s s o r ∗ Gryf
kn cat ” story ” ))
( m443 ! ( k n c a t s t o r y ) ( o b j e c t b41 ) ( p o s s e s s o r b34 ) ( r e l ( m264 ( l e x might ) ) ) )
( m443 ! )
CPU time : 0 . 0 3
∗
; ; S i r G r y f l e t t e s a i d t h a t he would j o u s t with t h e k n i g h t .
( describe
( as se r t a g e n t ∗ Gryf a c t
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d a g e n t ∗ Gryf a c t
( build action ( build lex ” joust ”)
against ∗ blknt1 )
time ∗ j t 9 ) )
time # j t 1 2 k n c a t ” s t o r y ” ) )
262
( m444 !
( a c t ( m424 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m423 ( a c t ( m422 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ( a g a i n s t b31 ) ) )
( a g e n t b34 ) ( time b37 ) ) ) ) )
( a g e n t b34 ) ( k n c a t s t o r y ) ( time b42 ) )
( m444 ! )
CPU time : 0 . 0 0
∗
; ; S i r G r y f l e t t e s a i d t h a t he would j o u s t b e f o r e t h e j o u s t a c t u a l l y
;;
took p l a c e
( describe ( as s e r t b e f o r e ∗ j t 1 2 a f t e r ∗ j t 9 k n c a t ” s t o r y ” ) )
( m445 ! ( a f t e r b37 ) ( b e f o r e b42 ) ( k n c a t s t o r y ) )
( m445 ! )
CPU time : 0 . 0 0
∗
; ; S i r G r y f l e t t e s a i d t h a t he would j o u s t a f t e r t h e k n i g h t s a y s t h a t
;;
the y s h o u l d not j o u s t
( describe ( a s s er t b e f o r e ∗ j t 1 1 a f t e r ∗ j t 1 2 k n c a t ” story−comp ” ) )
( m446 ! ( a f t e r b42 ) ( b e f o r e b39 ) ( k n c a t story−comp ) )
( m446 ! )
CPU time : 0 . 0 1
∗
; ; S i r G r y f l e t t e j o u s t s a g a i n s t the knight
( describe
( a sse r t a g e n t ∗ Gryf a c t
( build action ( build lex ” joust ” ) against ∗ blknt1 )
time ∗ j t 9 k n c a t ” story−comp ” ) )
( m447 ! ( a c t ( m422 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ( a g a i n s t b31 ) ) ) ( a g e n t b34 )
( k n c a t story−comp ) ( time b37 ) )
( m447 ! )
CPU time : 0 . 0 1
∗
; ; The k n i g h t j o u s t s a g a i n s S i r G r y f l e t t e
( describe
( as se rt a g e n t ∗ b l k n t 1 a c t
( b u i l d a c t i o n ( b u i l d l e x ” j o u s t ” ) a g a i n s t ∗ Gryf )
time ∗ j t 9 k n c a t ” story−comp ” ) )
( m449 ! ( a c t ( m448 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ( a g a i n s t b34 ) ) ) ( a g e n t b31 )
( k n c a t story−comp ) ( time b37 ) )
263
( m449 ! )
CPU time : 0 . 0 0
∗
; ; D e f i n e ” j o u s t ” a s a verb
ˆ(
−−> d e f i n e V e r b ” j o u s t ” )
”You want me t o d e f i n e t h e verb ’ j o u s t ’ .
I ’ l l s t a r t by l o o k i n g a t t h e p r e d i c a t e s t u c t u r e o f t h e s e n t e n c e s I know t h a t u s e ’ j o u s t ’ .
Here i s
The most common type o f s e n t e n c e s I know o f t h a t u s e ’ j o u s t ’ a r e o f t h e form :
’A something can j o u s t . ’
No s u p e r c l a s s e s were found f o r t h i s verb .
S o r t i n g from t h e most common p r e d i c a t e case t o t h e l e a s t common h e r e i s what I know .
I will firs
A b a s i c c t g y can j o u s t .
Now , l o o k i n g from t h e bottom up I want t o get a s e n s e o f t h e c a t e g o r i e s t h a t most o f t h e a g e n t s , o
A k n i g h t can j o u s t .
”
CPU time : 0 . 5 6
∗
; ; As they were t h u s t a l k i n g , they came t o t h e f o u n t a i n and t h e
; ; r i c h p a v i l i o n t h e r e by i t . Then King Arthur was aware t h a t a
; ; k n i g h t s a t armed i n a c h a i r .
; ; ‘ S i r Knight , ’ s a i d Arthur , ‘ f o r what c a u s e a b i d e s t thou h e r e , s o
; ; t h a t no k n i g h t may r i d e t h i s way u n l e s s he j o u s t with t h e e ? I
; ; a d v i s e t h e e t o l e a v e t h a t custom . ’ \ fP [ They r i d e a t each o t h e r
; ; with s p e a r s . ] \fBThen Arthur s e t h i s hand upon h i s sword .
; ; ‘ Nay , ’ s a i d t h e k n i g h t , ‘ ye s h a l l do b e t t e r . Ye a r e a s p a s s i n g
; ; good a j o u s t e r a s I e v e r met with , and f o r t h e l o v e o f t h e High
; ; Order o f Knighthood l e t us j o u s t a g a i n . ’
[p. 34]
;;
;;
Something s a t i n something .
( describe
( as se r t a g e n t # b l k n t 2 a c t ( b u i l d a c t i o n ( b u i l d l e x ” s i t ” ) i n # k n t 2 c h a i r )
time # j t 1 3 k n c a t ” s t o r y ” ) )
( m458 ! ( a c t ( m457 ( a c t i o n ( m456 ( l e x s i t ) ) ) ( i n b44 ) ) ) ( a g e n t b43 )
( k n c a t s t o r y ) ( time b45 ) )
( m458 ! )
CPU time : 0 . 0 1
∗
; ; The t h i n g t h a t s a t i s a k n i g h t
( describe
( a ss er t member ∗ b l k n t 2 c l a s s ( b u i l d l e x ” k n i g h t ” )
kn cat ” story ” ))
264
( m459 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( k n c a t s t o r y ) ( member b43 ) )
( m459 ! )
CPU time : 0 . 0 0
∗
; ; The t h i n g t h a t t h e k n i g h t s a t i n i s a c h a i r
( describe
( a sse r t member ∗ k n t 2 c h a i r c l a s s ( b u i l d l e x ” c h a i r ” ) k n c a t ” s t o r y ” ) )
( m460 ! ( c l a s s ( m87 ( l e x c h a i r ) ) ) ( k n c a t s t o r y ) ( member b44 ) )
( m460 ! )
CPU time : 0 . 0 0
∗
; ; The k n i g h t i s armed
( describe
( a sse r t o b j e c t ∗ b l k n t 2 p r o p e r t y ( b u i l d l e x ”armed” )
time ∗ j t 1 3 k n c a t ” s t o r y ” ) )
( m462 ! ( k n c a t s t o r y ) ( o b j e c t b43 ) ( p r o p e r t y ( m461 ( l e x armed ) ) ) ( time b45 ) )
( m462 ! )
CPU time : 0 . 0 1
∗
; ; King−Arthur asked t h e k n i g h t why he s a t t h e r e .
( describe
( a sse r t a g e n t ∗KA a c t
( b u i l d a c t i o n ( b u i l d l e x ” ask ” ) i n d o b j ∗ b l k n t 2
o b j e c t ( build r e l ( b uild l e x ” purpose ” )
o b j e c t 2 ( build agent ∗ blknt2 act
( build action ( build lex ” s i t ” )))
object1 ( build skf ” reason−for ”
a1 ( b u i l d a g e n t ∗ b l k n t 2 a c t
( build action
( build lex ” s i t ”)
)))))
time ∗ j t 1 3 k n c a t ” s t o r y ” ) )
( m468 !
( a c t ( m467 ( a c t i o n ( m406 ( l e x ask ) ) ) ( i n d o b j b43 )
( object
( m466
( object1
( m465 ( a1 ( m464 ( a c t ( m463 ( a c t i o n ( m456 ( l e x s i t ) ) ) ) ) ( a g e n t b43 ) ) )
( skf reason−for ) ) )
( o b j e c t 2 ( m464 ) ) ( r e l ( m285 ( l e x p u r p o s e ) ) ) ) ) ) )
( a g e n t b3 ) ( k n c a t s t o r y ) ( time b45 ) )
( m468 ! )
CPU time : 0 . 0 1
265
∗
; ; King−Arthur asked t h e k n i g h t why he r e q u i r e d a l l k n i g h t s t o j o u s t with him
; ; i f th ey wished t o p a s s .
( describe
( as se r t a g e n t ∗KA a c t
( b u i l d a c t i o n ( b u i l d l e x ” ask ” ) i n d o b j ∗ b l k n t 2
o b j e c t ( build r e l ( b uild l e x ” purpose ” )
object2
( build agent ∗ blknt2 act
( build action ( build lex ” require ”)
object
( build f o r a l l ∗ jknight
ant ( b u i l d a g e n t ∗ j k n i g h t
act ( build
a c t i o n ( b u i l d l e x ” wish ” )
o b j e c t ( build agent ∗ j k n i g h t
act ( build act
obj
cq ( b u i l d a g e n t ∗ j k n i g h t
act ( build action ( build lex ” joust
a g a i n s t ∗ b l k n t 2 ) ) ) = oddact2
o b j e c t 1 ( b u i l d s k f ” r e a s o n − f o r ” a1 ∗ oddact2 ) ) ) )
time ∗ j t 1 3 k n c a t ” s t o r y ” ) )
( m478 !
( a c t ( m477 ( a c t i o n ( m406 ( l e x ask ) ) ) ( i n d o b j b43 )
( object
( m476
( object2
( m475
( a c t ( m473 ( a c t i o n ( m469 ( l e x require ) ) )
( object
( m472 ( f o r a l l v21 )
( ant
( p127
( a c t ( p126 ( a c t i o n ( m260 ( l e x wish ) ) )
( object
( p125
( a c t ( m471 ( a c t i o n ( m470 ( l e x p a s s ) ) )
( o b j e c t b43 ) ) )
( a g e n t v21 ) ) ) ) )
( a g e n t v21 ) ) )
( cq
( p128 ( a c t ( m261 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ) )
( a g a i n s t b43 ) ( a g e n t v21 ) ) ) ) ) ) )
( a g e n t b43 ) ( o b j e c t 1 ( m474 ( a1 ( m473 ) ) ( s k f r e a s o n − f o r ) ) ) ) )
( r e l ( m285 ( l e x p u r p o s e ) ) ) ) ) ) )
( a g e n t b3 ) ( k n c a t s t o r y ) ( time b45 ) )
( m478 ! )
CPU time : 0 . 0 2
∗
;;
; ; King−Arthur s a i d t h a t t h e k n i g h t s h o u l d not r e q u i r e a l l k n i g h t s t o j o u s t with him .
( describe
266
( as ser t a g e n t ∗KA a c t
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d mode ( b u i l d l e x ” s h o u l d ” )
o b j e c t ( b u i l d min 0 max 0
arg ( build agent ∗ blknt2 act
( build action ( build lex ” require ”)
object ( build f o r a l l ∗ jknight
ant ( b u i l d a g e n t ∗ j k n i
( build acti
obje
cq ( b u i l d a g e n t ∗ j k n i g
( build actio
again
time ∗ j t 1 3 k n c a t ” s t o r y ” ) )
( m486 !
( a c t ( m485 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m484 ( mode ( m429 ( l e x s h o u l d ) ) )
( object
( m483 ( min 0 ) (max 0 )
( arg
( m482
( a c t ( m481 ( a c t i o n ( m469 ( l e x require ) ) )
( object
( m480 ( f o r a l l v21 )
( ant
( p127
( a c t ( p126 ( a c t i o n ( m260 ( l e x wish ) ) )
( object
( p125
( a c t ( m471 ( a c t i o n ( m470 ( l e x p a s s ) ) )
( o b j e c t b43 ) ) )
( a g e n t v21 ) ) ) ) )
( a g e n t v21 ) ) )
( cq
( p129
( a c t ( m479 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ( a g a i n s t b43 ) ) )
( a g e n t v21 ) ) ) ) ) ) )
( a g e n t b43 ) ) ) ) ) ) ) ) )
( a g e n t b3 ) ( k n c a t s t o r y ) ( time b45 ) )
( m486 ! )
CPU time : 0 . 0 2
∗
; ; D e f i n e ” j o u s t ” a s a verb
ˆ(
−−> d e f i n e V e r b ” j o u s t ” )
”You want me t o d e f i n e t h e verb ’ j o u s t ’ .
I ’ l l s t a r t by l o o k i n g a t t h e p r e d i c a t e s t u c t u r e o f t h e s e n t e n c e s I know t h a t u s e ’ j o u s t ’ .
The most common type o f s e n t e n c e s I know o f t h a t u s e ’ j o u s t ’ a r e o f t h e form :
267
Here i s
’A something can j o u s t . ’
No s u p e r c l a s s e s were found f o r t h i s verb .
S o r t i n g from t h e most common p r e d i c a t e case t o t h e l e a s t common h e r e i s what I know .
I will firs
A b a s i c c t g y can j o u s t .
Now , l o o k i n g from t h e bottom up I want t o get a s e n s e o f t h e c a t e g o r i e s t h a t most o f t h e a g e n t s , o
A k n i g h t can j o u s t .
”
CPU time : 0 . 4 2
∗
; ; King Arthur j o u s t s a g a i n s t t h e k n i g h t
( describe
( as se rt a g e n t ∗KA a c t
( build action ( build lex ” joust ” ) against ∗ blknt2 )
time # j t 1 7 k n c a t ” story−comp ” ) )
( m487 ! ( a c t ( m479 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ( a g a i n s t b43 ) ) ) ( a g e n t b3 )
( k n c a t story−comp ) ( time b46 ) )
( m487 ! )
CPU time : 0 . 0 0
∗
; ; The k n i g h t j o u s t s a g a i n s t King Arthur
( describe
( as se r t a g e n t ∗ b l k n t 2 a c t
( b u i l d a c t i o n ( b u i l d l e x ” j o u s t ” ) a g a i n s t ∗KA)
time ∗ j t 1 7 k n c a t ” story−comp ” ) )
( m489 ! ( a c t ( m488 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ( a g a i n s t b3 ) ) ) ( a g e n t b43 )
( k n c a t story−comp ) ( time b46 ) )
( m489 ! )
CPU time : 0 . 0 1
∗
; ; King−Arthur f o u g h t t h e k n i g h t with some i n s t r u m e n t
( describe
( ass er t a g e n t ∗KA a c t
( b u i l d a c t i o n ( b u i l d l e x ” f i g h t ” ) o b j e c t ∗ b l k n t 2 i n s t r #KAspear1 )
time ∗ j t 1 7 k n c a t ” s t o r y ” ) )
( m492 ! ( a c t ( m491 ( a c t i o n ( m490 ( l e x f i g h t ) ) ) ( i n s t r b47 ) ( o b j e c t b43 ) ) )
( a g e n t b3 ) ( k n c a t s t o r y ) ( time b46 ) )
( m492 ! )
CPU time : 0 . 0 1
268
∗
; ; The k n i g h t f o u g h t King Arthur with some o t h e r i n s t r u m e n t
( describe
( a sse r t a g e n t ∗ b l k n t 2 a c t
( b u i l d a c t i o n ( b u i l d l e x ” f i g h t ” ) o b j e c t ∗KA i n s t r # k n t 2 s p e a r 1 )
time ∗ j t 1 7 k n c a t ” s t o r y ” ) )
( m494 ! ( a c t ( m493 ( a c t i o n ( m490 ( l e x f i g h t ) ) ) ( i n s t r b48 ) ( o b j e c t b3 ) ) )
( a g e n t b43 ) ( k n c a t s t o r y ) ( time b46 ) )
( m494 ! )
CPU time : 0 . 0 0
∗
; ; The f i g h t to ok p l a c e a f t e r King Arthur and t h e k n i g h t met
( describe
( a s s e r t b e f o r e ∗ j t 1 3 a f t e r ∗ j t 1 7 k n c a t ” story−comp ” ) )
( m495 ! ( a f t e r b46 ) ( b e f o r e b45 ) ( k n c a t story−comp ) )
( m495 ! )
CPU time : 0 . 0 0
∗
; ; King Arthur ’ s i n s t r u m e n t i s a s p e a r
( describe
( a sse r t member ∗ KAspear1 c l a s s ( b u i l d l e x ” s p e a r ” ) k n c a t ” s t o r y ” ) )
( m496 ! ( c l a s s ( m105 ( l e x s p e a r ) ) ) ( k n c a t s t o r y ) ( member b47 ) )
( m496 ! )
CPU time : 0 . 0 1
∗
; ; The k n i g h t ’ s i n s t r u m e n t i s a s p e a r
( describe
( a sse r t member ∗ k n t 2 s p e a r 1 c l a s s ( b u i l d l e x ” s p e a r ” ) k n c a t ” s t o r y ” ) )
( m497 ! ( c l a s s ( m105 ( l e x s p e a r ) ) ) ( k n c a t s t o r y ) ( member b48 ) )
( m497 ! )
CPU time : 0 . 0 0
∗
; ; D e f i n e j o u s t a s a verb
ˆ(
−−> d e f i n e V e r b ’ j o u s t )
”You want me t o d e f i n e t h e verb ’ j o u s t ’ .
I ’ l l s t a r t by l o o k i n g a t t h e p r e d i c a t e s t u c t u r e o f t h e s e n t e n c e s I know t h a t u s e ’ j o u s t ’ .
The most common ty pe o f s e n t e n c e s I know o f t h a t u s e ’ j o u s t ’ a r e o f t h e form :
’A something can j o u s t . ’
269
Here i s
No s u p e r c l a s s e s were found f o r t h i s verb .
S o r t i n g from t h e most common p r e d i c a t e case t o t h e l e a s t common h e r e i s what I know .
I will firs
A b a s i c c t g y can j o u s t .
Now , l o o k i n g from t h e bottom up I want t o get a s e n s e o f t h e c a t e g o r i e s t h a t most o f t h e a g e n t s , o
A k i n g can j o u s t .
”
CPU time : 0 . 4 6
∗
; ; King Arthur g r a s p e d h i s something
( describe
( as s ert a g e n t ∗KA a c t
( b u i l d a c t i o n ( b u i l d l e x ” g r a s p ” ) o b j e c t #KAsword time # j t 1 4 )
kn cat ” story ” ))
( m504 ! ( a c t ( m503 ( a c t i o n ( m502 ( l e x g r a s p ) ) ) ( o b j e c t b49 ) ( time b50 ) ) )
( a g e n t b3 ) ( k n c a t s t o r y ) )
( m504 ! )
CPU time : 0 . 0 1
∗
; ; The t h i n g King Arthur g r a s p s i s a sword
( describe
( a s s e r t member ∗ KAsword c l a s s ( b u i l d l e x ” sword ” ) k n c a t ” s t o r y ” ) )
( m505 ! ( c l a s s ( m59 ( l e x sword ) ) ) ( k n c a t s t o r y ) ( member b49 ) )
( m505 ! )
CPU time : 0 . 0 1
∗
; ; The s p e a r f i g h t to ok p l a c e b e f o r e King Arthur g r a s p e d h i s sword
( describe
( a sse r t b e f o r e ∗ j t 1 7 a f t e r ∗ j t 1 4 k n c a t ” story−comp ” ) )
( m506 ! ( a f t e r b50 ) ( b e f o r e b46 ) ( k n c a t story−comp ) )
( m506 ! )
CPU time : 0 . 0 0
∗
; ; The k n i g h t s a i d t h a t King Arthur s h o u l d not draw h i s sword .
( describe
( a sse r t a g e n t ∗ b l k n t 2 a c t
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d mode ( b u i l d l e x ” s h o u l d ” )
o b j e c t ( b u i l d min 0 max 0
a r g ( b u i l d a g e n t ∗KA a c t
270
( b u i l d a c t i o n ( b u i l d l e x ”draw ” )
o b j e c t ∗ KAsword time # j t 1 5 ) ) ) ) )
time ∗ j t 1 5 k n c a t ” s t o r y ” ) )
( m513 !
( a c t ( m512 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m511 ( mode ( m429 ( l e x s h o u l d ) ) )
( object
( m510 ( min 0 ) (max 0 )
( arg
( m509
( a c t ( m508 ( a c t i o n ( m507 ( l e x draw ) ) ) ( o b j e c t b49 ) ( time b51 ) ) )
( a g e n t b3 ) ) ) ) ) ) ) ) )
( a g e n t b43 ) ( k n c a t s t o r y ) ( time b51 ) )
( m513 ! )
CPU time : 0 . 0 1
∗
; ; The k n i g h t s a i d t h a t King Arthur s h o u l d not draw h i s sword
;;
a f t e r King Arthur g r a s p e d h i s sword .
( describe
( a s s e r t b e f o r e ∗ j t 1 4 a f t e r ∗ j t 1 5 k n c a t ” story−comp ” ) )
( m514 ! ( a f t e r b51 ) ( b e f o r e b50 ) ( k n c a t story−comp ) )
( m514 ! )
CPU time : 0 . 0 1
∗
; ; The k n i g h t s a i d t h a t something was g r e a t .
( describe
( a sse r t a g e n t ∗ b l k n t 2 a c t
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
object ( build object #KAskill property ( build lex ” great ” ) ) )
time ∗ j t 1 5 k n c a t ” s t o r y ” ) )
( m517 !
( a c t ( m516 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( o b j e c t ( m515 ( o b j e c t b52 ) ( p r o p e r t y ( m376 ( l e x g r e a t ) ) ) ) ) ) )
( a g e n t b43 ) ( k n c a t s t o r y ) ( time b51 ) )
( m517 ! )
CPU time : 0 . 0 0
∗
; ; The t h i n g t h a t t h e k n i g h t s a i d was g r e a t i s
; ; King Arthur ’ s s k i l l
( describe
( a s s e r t o b j e c t ∗ K A s k i l l r e l ( b u i l d l e x ” s k i l l ” ) p o s s e s s o r ∗KA k n c a t ” s t o r y ” ) )
( m519 ! ( k n c a t s t o r y ) ( o b j e c t b52 ) ( p o s s e s s o r b3 ) ( r e l ( m518 ( l e x s k i l l ) ) ) )
( m519 ! )
271
CPU time : 0 . 0 0
∗
; ; King Arthur ’ s s k i l l i s f o r j o u s t i n g
( describe
( as se r t o b j e c t 1 ∗ K A s k i l l r e l ( b u i l d l e x ” p u r p o s e ” ) o b j e c t 2 ( b u i l d l e x ” j o u s t ” )
kn cat ” story ” ))
( m520 ! ( k n c a t s t o r y ) ( o b j e c t 1 b52 ) ( o b j e c t 2 ( m246 ( l e x j o u s t ) ) )
( r e l ( m285 ( l e x p u r p o s e ) ) ) )
( m520 ! )
CPU time : 0 . 0 1
∗
; ; The k n i g h t s a i d t h a t he wished t o j o u s t with King−Arthur a g a i n .
;;
( describe
( a ss er t a g e n t ∗ b l k n t 2 a c t
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( build agent ∗ blknt1 act
( b u i l d a c t i o n ( b u i l d l e x ” wish ” )
o b j e c t ( build agent ∗ blknt1 act
( build action ( build lex ” joust ”)
a g a i n s t ∗KA)
time # j t 1 6 ) ) ) )
time ∗ j t 1 5 k n c a t ” s t o r y ” ) )
( m525 !
( a c t ( m524 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m523
( a c t ( m522 ( a c t i o n ( m260 ( l e x wish ) ) )
( object
( m521 ( a c t ( m488 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ( a g a i n s t b3 ) ) )
( a g e n t b31 ) ( time b53 ) ) ) ) )
( a g e n t b31 ) ) ) ) )
( a g e n t b43 ) ( k n c a t s t o r y ) ( time b51 ) )
( m525 ! )
CPU time : 0 . 0 2
∗
; ; The b l a c k k n i g h t j o u s t s with King Arthur a f t e r t h e
;;
k n i g h t s a y s t h a t he wants t o j o u s t a g a i n .
( describe
( a s s e r t b e f o r e ∗ j t 1 5 a f t e r ∗ j t 1 6 k n c a t ” story−comp ” ) )
( m526 ! ( a f t e r b53 ) ( b e f o r e b51 ) ( k n c a t story−comp ) )
( m526 ! )
CPU time : 0 . 0 1
∗
272
; ; D e f i n e ” j o u s t ” a s a verb
ˆ(
−−> d e f i n e V e r b ’ j o u s t )
”You want me t o d e f i n e t h e verb ’ j o u s t ’ .
I ’ l l s t a r t by l o o k i n g a t t h e p r e d i c a t e s t u c t u r e o f t h e s e n t e n c e s I know t h a t u s e ’ j o u s t ’ .
Here i s
The most common type o f s e n t e n c e s I know o f t h a t u s e ’ j o u s t ’ a r e o f t h e form :
’A something can j o u s t . ’
No s u p e r c l a s s e s were found f o r t h i s verb .
S o r t i n g from t h e most common p r e d i c a t e case t o t h e l e a s t common h e r e i s what I know .
I will firs
A b a s i c c t g y can j o u s t .
Now , l o o k i n g from t h e bottom up I want t o get a s e n s e o f t h e c a t e g o r i e s t h a t most o f t h e a g e n t s , o
A k i n g can j o u s t .
”
CPU time : 0 . 3 2
∗
; ; Then t h e c h i e f l a d y o f t h e c a s t l e s a i d , ‘ Knight with t h e Two Swords ,
; ; ye must have ado and j o u s t with a k n i g h t nearby who g u a r d s an i s l a n d ,
; ; f o r no man may p a s s t h i s way but he must j o u s t e r e he p a s s e s . ’
; ; ‘ That i s an unhappy custom , ’ s a i d Balyn , ‘ t h a t a k n i g h t may not p a s s
; ; t h i s way u n l e s s he j o u s t s . ’
; ; ‘ Ye s h a l l have ado with o n l y one k n i g h t , ’ s a i d t h e l a d y .
[p. 58]
;;
; ; A something s a i d t h a t something must j o u s t with something e l s e .
( describe
( a sse r t a g e n t # j l a d y 1 a c t
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d mode ( b u i l d l e x ”must” )
o b j e c t ( b u i l d a g e n t #Balyn a c t
( build action ( build lex ” joust ”)
against #blknt3 )
time # j t 1 8 ) ) )
time # j t 1 9 k n c a t ” s t o r y ” ) )
( m534 !
( a c t ( m533 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m532 ( mode ( m529 ( l e x must ) ) )
( object
( m531 ( a c t ( m530 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ( a g a i n s t b56 ) ) )
( a g e n t b55 ) ( time b57 ) ) ) ) ) ) )
( a g e n t b54 ) ( k n c a t s t o r y ) ( time b58 ) )
( m534 ! )
CPU time : 0 . 0 2
∗
; ; The s p e a k e r i s a l a d y
273
( describe
( a sse r t member ∗ j l a d y 1 c l a s s ( b u i l d l e x ” l a d y ” ) k n c a t ” s t o r y ” ) )
( m536 ! ( c l a s s ( m535 ( l e x l a d y ) ) ) ( k n c a t s t o r y ) ( member b54 ) )
( m536 ! )
CPU time : 0 . 0 0
∗
; ; The t h i n g t h a t must j o u s t i s named ” Balyn ”
( describe
( a sse r t o b j e c t ∗ Balyn proper−name ( b u i l d l e x ” Balyn ” ) k n c a t ” s t o r y ” ) )
( m538 ! ( k n c a t s t o r y ) ( o b j e c t b55 ) ( proper−name ( m537 ( l e x Balyn ) ) ) )
( m538 ! )
CPU time : 0 . 0 0
∗
; ; Balyn i s a k n i g h t
( describe
( a sse r t member ∗ Balyn c l a s s ( b u i l d l e x ” k n i g h t ” )
k n c a t ” story−comp ” ) )
( m539 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( k n c a t story−comp ) ( member b55 ) )
( m539 ! )
CPU time : 0 . 0 1
∗
; ; The t h i n g t h a t Balyn must j o u s t i s a k n i g h t
( describe
( a sse r t member ∗ b l k n t 3 c l a s s ( b u i l d l e x ” k n i g h t ” ) k n c a t ” s t o r y ” ) )
( m540 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( k n c a t s t o r y ) ( member b56 ) )
( m540 ! )
CPU time : 0 . 0 1
∗
; ; The l a d y s s a y s t h a t Balyn must j o u s t b e f o r e he a c t u a l l y j o u s t s .
( describe
( a sse r t b e f o r e ∗ j t 1 9 a f t e r ∗ j t 1 8 k n c a t ” story−comp ” ) )
( m541 ! ( a f t e r b57 ) ( b e f o r e b58 ) ( k n c a t story−comp ) )
( m541 ! )
CPU time : 0 . 0 0
∗
; ; The l a d y s a i d t h a t t h e k n i g h t guarded an i s l a n d .
( describe
( a sse r t a g e n t ∗ j l a d y 1 a c t
274
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( build agent ∗ blknt3 act
( b u i l d a c t i o n ( b u i l d l e x ” guard ” )
object # i s l e 1 )
time ∗ j t 1 9 ) )
time ∗ j t 1 9 k n c a t ” s t o r y ” ) )
( m546 !
( a c t ( m545 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m544 ( a c t ( m543 ( a c t i o n ( m542 ( l e x guard ) ) ) ( o b j e c t b59 ) ) )
( a g e n t b56 ) ( time b58 ) ) ) ) )
( a g e n t b54 ) ( k n c a t s t o r y ) ( time b58 ) )
( m546 ! )
CPU time : 0 . 0 1
∗
; ; The l a d y s a i d t h a t t h e k n i g h t r e q u i r e d a l l men t o j o u s t with him ,
; ; i f th ey wished t o p a s s .
( describe
( assert agent ∗ j l a d y 1 act
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
object ( build f o r a l l ∗ jknight
ant ( b u i l d a g e n t ∗ j k n i g h t a c t
( b u i l d a c t i o n ( b u i l d l e x ” wish ” )
o b j e c t ( build agent ∗ j k n i g h t act
( build action ( build lex ” pass ” )
object ∗ blknt3 ) ) ) )
cq ( b u i l d a g e n t ∗ b l k n t 3 a c t
( build action ( build lex ” require ”)
o b j e c t ( build agent ∗ j k n i g h t act
( build action ( build lex ” joust ”)
a g a i n s t ∗ b l k n t 3 ) ) ) ) ) = oddact3 )
time ∗ j t 1 9 k n c a t ” s t o r y ” ) )
( m550 !
( a c t ( m549 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m548 ( f o r a l l v21 )
( ant
( p136
( a c t ( p135 ( a c t i o n ( m260 ( l e x wish ) ) )
( object
( p134 ( a c t ( m547 ( a c t i o n ( m470 ( l e x p a s s ) ) ) ( o b j e c t b56 ) ) )
( a g e n t v21 ) ) ) ) )
( a g e n t v21 ) ) )
( cq
( p139
( a c t ( p138 ( a c t i o n ( m469 ( l e x require ) ) )
( object
( p137 ( a c t ( m530 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ( a g a i n s t b56 ) ) )
( a g e n t v21 ) ) ) ) )
( a g e n t b56 ) ) ) ) ) ) )
( a g e n t b54 ) ( k n c a t s t o r y ) ( time b58 ) )
( m550 ! )
275
CPU time : 0 . 0 1
∗
; ; S i r Balyn s a i d t h a t t h e k n i g h t r e q u i r i n g a l l men t o j o u s t with him ,
; ; i f they wished t o p a s s was something
( describe
( a sse r t a g e n t ∗ Balyn a c t
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d member ∗ oddact3 c l a s s # b a d c u s t ) )
time # j t 2 0 k n c a t ” s t o r y ” ) )
( m553 !
( a c t ( m552 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m551 ( c l a s s b60 )
(member
( m548 ( f o r a l l v21 )
( ant
( p136
( a c t ( p135 ( a c t i o n ( m260 ( l e x wish ) ) )
( object
( p134
( a c t ( m547 ( a c t i o n ( m470 ( l e x p a s s ) ) ) ( o b j e c t b56 ) ) )
( a g e n t v21 ) ) ) ) )
( a g e n t v21 ) ) )
( cq
( p139
( a c t ( p138 ( a c t i o n ( m469 ( l e x require ) ) )
( object
( p137
( a c t ( m530 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ( a g a i n s t b56 ) ) )
( a g e n t v21 ) ) ) ) )
( a g e n t b56 ) ) ) ) ) ) ) ) )
( a g e n t b55 ) ( k n c a t s t o r y ) ( time b61 ) )
( m553 ! )
CPU time : 0 . 0 2
∗
; ; The p r e v i o u s ” something ” i s a custom
( describe
( a s s e r t s u b c l a s s ∗ b a d c u s t s u p e r c l a s s ( b u i l d l e x ” custom ” ) k n c a t ” s t o r y ” ) )
( m555 ! ( k n c a t s t o r y ) ( s u b c l a s s b60 ) ( s u p e r c l a s s ( m554 ( l e x custom ) ) ) )
( m555 ! )
CPU time : 0 . 0 0
∗
; ; The custom i s unhappy
( describe
( as s ert o b j e c t ∗ b a d c u s t p r o p e r t y ( b u i l d l e x ” unhappy ” ) k n c a t ” s t o r y ” ) )
( m557 ! ( k n c a t s t o r y ) ( o b j e c t b60 ) ( p r o p e r t y ( m556 ( l e x unhappy ) ) ) )
276
( m557 ! )
CPU time : 0 . 0 0
∗
; ; Balyn s p e a k s a f t e r t h e l a d y has spoken
( describe
( a sse r t b e f o r e ∗ j t 1 9 a f t e r ∗ j t 2 0 k n c a t ” story−comp ” ) )
( m558 ! ( a f t e r b61 ) ( b e f o r e b58 ) ( k n c a t story−comp ) )
( m558 ! )
CPU time : 0 . 0 1
∗
; ; D e f i n e ” j o u s t ” a s a verb
ˆ(
−−> d e f i n e V e r b ’ j o u s t )
”You want me t o d e f i n e t h e verb ’ j o u s t ’ .
I ’ l l s t a r t by l o o k i n g a t t h e p r e d i c a t e s t u c t u r e o f t h e s e n t e n c e s I know t h a t u s e ’ j o u s t ’ .
Here i s
The most common type o f s e n t e n c e s I know o f t h a t u s e ’ j o u s t ’ a r e o f t h e form :
’A something can j o u s t . ’
No s u p e r c l a s s e s were found f o r t h i s verb .
S o r t i n g from t h e most common p r e d i c a t e case t o t h e l e a s t common h e r e i s what I know .
I will firs
A b a s i c c t g y can j o u s t .
Now , l o o k i n g from t h e bottom up I want t o get a s e n s e o f t h e c a t e g o r i e s t h a t most o f t h e a g e n t s , o
A k i n g can j o u s t .
”
CPU time : 0 . 5 6
∗
; ; ‘ . . . t h e r e f o r e I wish t o s e e you a l l t o g e t h e r i n t h e meadow o f Camelot ,
; ; t o j o u s t and t o t o u r n e y , s o t h a t a f t e r your death men may speak o f i t t h a t
; ; such good k n i g h t s were h e r e on such a day a l l t o g e t h e r . ’
; ; To t h a t c o u n s e l a t t h e k i n g ’ s r e q u e s t they a l l a c c o r d e d and put on t h e i r
; ; armor s u i t a b l e f o r j o u s t i n g .
[p. 527]
;;
; ; King Arthur s a i d t h a t he wished t o s e e something j o u s t .
;;
( describe
( a sse r t a g e n t ∗KA a c t
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d a g e n t ∗KA a c t
( b u i l d a c t i o n ( b u i l d l e x ” wish ” )
o b j e c t ( b u i l d a g e n t ∗KA a c t
( build action ( build lex ” see ”)
o b j e c t ( b u i l d a g e n t #Aknts a c t
( build action ( build lex ”
277
time # j t 2 1 ) )
time ∗ j t 2 1 ) )
time # j t 2 2 ) )
time ∗ j t 2 2 k n c a t ” s t o r y ” ) )
( m567 !
( a c t ( m566 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m565
( a c t ( m564 ( a c t i o n ( m260 ( l e x wish ) ) )
( object
( m563
( a c t ( m562 ( a c t i o n ( m351 ( l e x s e e ) ) )
( object
( m561 ( a c t ( m261 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ) )
( a g e n t b62 ) ( time b63 ) ) ) ) )
( a g e n t b3 ) ( time b63 ) ) ) ) )
( a g e n t b3 ) ( time b64 ) ) ) ) )
( a g e n t b3 ) ( k n c a t s t o r y ) ( time b64 ) )
( m567 ! )
CPU time : 0 . 0 2
∗
; ; The t h i n g t h a t King Arthur wants t o s e e j o u s t i s a k n i g h t .
( describe
( a s s e r t member ∗ Aknts c l a s s ( b u i l d l e x ” k n i g h t ” ) k n c a t ” s t o r y ” ) )
( m568 ! ( c l a s s ( m47 ( l e x k n i g h t ) ) ) ( k n c a t s t o r y ) ( member b62 ) )
( m568 ! )
CPU time : 0 . 0 1
∗
; ; The k n i g h t s a r e King Arthur ’ s k n i g h t s
( describe
( a sse r t o b j e c t ∗ Aknts r e l ( b u i l d l e x ” k n i g h t ” ) p o s s e s s o r ∗KA k n c a t ” s t o r y ” ) )
( m569 ! ( k n c a t s t o r y ) ( o b j e c t b62 ) ( p o s s e s s o r b3 ) ( r e l ( m47 ( l e x k n i g h t ) ) ) )
( m569 ! )
CPU time : 0 . 0 0
∗
; ; King Arthur s a y s t h a t he wants t o s e e t h e j o u s t b e f o r e i t
;;
actually takes place
( describe
( as s ert b e f o r e ∗ j t 2 2 a f t e r ∗ j t 2 1 k n c a t ” s t o r y ” ) )
( m570 ! ( a f t e r b63 ) ( b e f o r e b64 ) ( k n c a t s t o r y ) )
( m570 ! )
CPU time : 0 . 0 0
278
∗
; ; D e f i n e j o u s t a s a verb
ˆ(
−−> d e f i n e V e r b ’ j o u s t )
”You want me t o d e f i n e t h e verb ’ j o u s t ’ .
I ’ l l s t a r t by l o o k i n g a t t h e p r e d i c a t e s t u c t u r e o f t h e s e n t e n c e s I know t h a t u s e ’ j o u s t ’ .
Here i s
The most common ty pe o f s e n t e n c e s I know o f t h a t u s e ’ j o u s t ’ a r e o f t h e form :
’A something can j o u s t . ’
No s u p e r c l a s s e s were found f o r t h i s verb .
S o r t i n g from t h e most common p r e d i c a t e case t o t h e l e a s t common h e r e i s what I know .
I will firs
A b a s i c c t g y can j o u s t .
Now , l o o k i n g from t h e bottom up I want t o get a s e n s e o f t h e c a t e g o r i e s t h a t most o f t h e a g e n t s , o
A k i n g can j o u s t .
”
CPU time : 0 . 3 7
∗
; ; King−Arthur s a i d t h a t he wished t o s e e h i s k n i g h t s t o u r n e y .
( describe
( ass er t a g e n t ∗KA a c t
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d a g e n t ∗KA a c t
( b u i l d a c t i o n ( b u i l d l e x ” wish ” )
o b j e c t ( b u i l d a g e n t ∗KA a c t
( build action ( build lex ” see ”)
o b j e c t ( b u i l d a g e n t ∗ Aknts a c t
( build action ( build lex ”
time ∗ j t 2 1 ) )
time ∗ j t 2 1 ) )
time ∗ j t 2 2 ) )
time ∗ j t 2 2 k n c a t ” s t o r y ” ) )
( m579 !
( a c t ( m578 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m577
( a c t ( m576 ( a c t i o n ( m260 ( l e x wish ) ) )
( object
( m575
( a c t ( m574 ( a c t i o n ( m351 ( l e x s e e ) ) )
( object
( m573 ( a c t ( m271 ( a c t i o n ( m108 ( l e x t o u r n e y ) ) ) ) )
( a g e n t b62 ) ( time b63 ) ) ) ) )
( a g e n t b3 ) ( time b63 ) ) ) ) )
( a g e n t b3 ) ( time b64 ) ) ) ) )
( a g e n t b3 ) ( k n c a t s t o r y ) ( time b64 ) )
( m579 ! )
279
CPU time : 0 . 0 2
∗
; ; King−Arthur ’ s k n i g h t s s a i d t h a t they would j o u s t
( describe
( as se r t a g e n t ∗ Aknts a c t
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d a g e n t ∗ Aknts a c t
( build action ( build lex ” joust ” ))
time ∗ j t 2 1 ) )
time # j t 2 3 k n c a t ” s t o r y ” ) )
( m581 !
( a c t ( m580 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m561 ( a c t ( m261 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ) ) ( a g e n t b62 )
( time b63 ) ) ) ) )
( a g e n t b62 ) ( k n c a t s t o r y ) ( time b65 ) )
( m581 ! )
CPU time : 0 . 0 1
∗
; ; The j o u s t t a k e s p l a c e a f t e r King Arthur s a i d t h a t i t
; ; would t a k e p l a c e .
( describe
( assert b e f o r e ∗ j t 2 3 a f t e r ∗ j t 2 1 kn cat ” s t o r y ” ) )
( m582 ! ( a f t e r b63 ) ( b e f o r e b65 ) ( k n c a t s t o r y ) )
( m582 ! )
CPU time : 0 . 0 1
∗
; ; The t o u r n e y t a k e s p l a c e a f t e r King Arthur s a i d
;;
t h a t he wished t o s e e i t .
( describe
( a sse r t b e f o r e ∗ j t 2 2 a f t e r ∗ j t 2 3 k n c a t ” story−comp ” ) )
( m583 ! ( a f t e r b65 ) ( b e f o r e b64 ) ( k n c a t story−comp ) )
( m583 ! )
CPU time : 0 . 0 0
∗
; ; The k n i g h t s say t h a t the y w i l l t o u r n e y
( describe
( a sse r t a g e n t ∗ Aknts a c t
( b u i l d a c t i o n ( b u i l d l e x ” say t h a t ” )
o b j e c t ( b u i l d a g e n t ∗ Aknts a c t
( build action ( build l e x ” tourney ” ) )
time ∗ j t 2 1 ) )
time ∗ j t 2 3 k n c a t ” s t o r y ” ) )
( m585 !
280
( a c t ( m584 ( a c t i o n ( m226 ( l e x say t h a t ) ) )
( object
( m573 ( a c t ( m271 ( a c t i o n ( m108 ( l e x t o u r n e y ) ) ) ) ) ( a g e n t b62 )
( time b63 ) ) ) ) )
( a g e n t b62 ) ( k n c a t s t o r y ) ( time b65 ) )
( m585 ! )
CPU time : 0 . 0 1
∗
; ; King Arthur ’ s k n i g h t s don something .
( describe
( a s s e r t a g e n t ∗ Aknts a c t
( b u i l d a c t i o n ( b u i l d l e x ”don” )
o b j e c t # j ar mo r )
time # j t 2 4 k n c a t ” s t o r y ” ) )
( m588 ! ( a c t ( m587 ( a c t i o n ( m586 ( l e x don ) ) ) ( o b j e c t b66 ) ) ) ( a g e n t b62 )
( k n c a t s t o r y ) ( time b67 ) )
( m588 ! )
CPU time : 0 . 0 4
∗
; ; The t h i n g they don i s armor
( describe
( a ss er t member ∗ jarmo r c l a s s ( b u i l d l e x ” armor ” ) k n c a t ” s t o r y ” ) )
( m590 ! ( c l a s s ( m589 ( l e x armor ) ) ) ( k n c a t s t o r y ) ( member b66 ) )
( m590 ! )
CPU time : 0 . 0 0
∗
; ; The armor i s f o r j o u s t i n g
( describe
( a sse r t o b j e c t 1 ∗ j armo r r e l ( b u i l d l e x ” f u n c t i o n ” ) o b j e c t 2 ( b u i l d l e x ” j o u s t ” )
kn cat ” story ” ))
( m592 ! ( k n c a t s t o r y ) ( o b j e c t 1 b66 ) ( o b j e c t 2 ( m246 ( l e x j o u s t ) ) )
( r e l ( m591 ( l e x f u n c t i o n ) ) ) )
( m592 ! )
CPU time : 0 . 0 1
∗
; ; The k n i g h t s j o u s t
( describe
( as se r t a g e n t ∗ Aknts a c t
( build action ( build lex ” joust ” ))
time ∗ j t 2 1 k n c a t ” story−comp ” ) )
( m593 ! ( a c t ( m261 ( a c t i o n ( m246 ( l e x j o u s t ) ) ) ) ) ( a g e n t b62 )
( k n c a t story−comp ) ( time b63 ) )
281
( m593 ! )
CPU time : 0 . 0 1
∗
; ; The k n i g h t s don t h e i r armor a f t e r they say they w i l l t o u r n e y
( describe
( a sse r t b e f o r e ∗ j t 2 3 a f t e r ∗ j t 2 4 k n c a t ” story−comp ” ) )
( m594 ! ( a f t e r b67 ) ( b e f o r e b65 ) ( k n c a t story−comp ) )
( m594 ! )
CPU time : 0 . 0 0
∗
; ; The k n i g h t s don t h e i r armor b e f o r e they j o u s t
( describe
( a sse r t b e f o r e ∗ j t 2 4 a f t e r ∗ j t 2 1 k n c a t ” story−comp ” ) )
( m595 ! ( a f t e r b63 ) ( b e f o r e b67 ) ( k n c a t story−comp ) )
( m595 ! )
CPU time : 0 . 0 1
∗
; ; D e f i n e ” j o u s t ” a s a verb
ˆ(
−−> d e f i n e V e r b ’ j o u s t )
”You want me t o d e f i n e t h e verb ’ j o u s t ’ .
I ’ l l s t a r t by l o o k i n g a t t h e p r e d i c a t e s t u c t u r e o f t h e s e n t e n c e s I know t h a t u s e ’ j o u s t ’ .
Here i s
The most common type o f s e n t e n c e s I know o f t h a t u s e ’ j o u s t ’ a r e o f t h e form :
’A something can j o u s t . ’
No s u p e r c l a s s e s were found f o r t h i s verb .
S o r t i n g from t h e most common p r e d i c a t e case t o t h e l e a s t common h e r e i s what I know .
I will firs
A b a s i c c t g y can j o u s t .
Now , l o o k i n g from t h e bottom up I want t o get a s e n s e o f t h e c a t e g o r i e s t h a t most o f t h e a g e n t s , o
A k i n g can j o u s t .
”
CPU time : 0 . 4 8
∗
; ; D e f i n e ” j o u s t ” a s a noun
ˆ(
−−> defineNoun ’ j o u s t )
Definition of joust :
A c t i o n s p e r f o r m e d on a j o u s t : k i n g announce , baron a r r a n g e ,
282
P o s s i b l e P r o p e r t i e s : g r e a t , armor f u n c t i o n ,
nil
CPU time : 0 . 4 0
∗
End o f / p r o j e c t s / s t n 2 /CVA/demos/ j o u s t . demo d e m o n s t r a t i o n .
CPU time : 1 1 . 6 0
∗
C
Running the Algorithm
The following instructions for running SNePS and the noun-definition algorithm assume that the commands
are being executed on a computer at the University at Buffalo Department of Computer Science and Engineering with access to the /projects filesystem.
• Type composer to start Allegro Common Lisp (or in Emacs type M-x run-acl).
• At the lisp prompt type (load “/projects/snwiz/bin/sneps”). Note: This algorithm has been tested with
SNePS 2.6.0. The algorithm may or may not be compatible with previous versions of SNePS.
• Type (load “/projects/stn2/CVA/defun noun.cl”) to load the noun-definition algorithm.
• Type (sneps) to start SNePS.
• Type (demo “/projects/stn2/CVA/demos/some-demo.demo”) to run a demo. Note: you should replace
“some-demo” with the name of the demo you want to run.
D
Location of Files
/projects/rapaport/CVA/STN2/defun noun.cl
The noun definition algorithm.
/projects/rapaport/CVA/STN2/defun verb.cl
The verb definition algorithm.
/projects/rapaport/CVA/STN2/demos
Contains all of the demos and supporting files.
/projects/rapaport/CVA/STN2/output
Contains sample runs of all the demos.
/projects/rapaport/CVA/STN2/papers
Contains PDF files of papers downloaded for CVA bibliography.
Online:
http://www.cse.buffalo.edu/ stn2/cva/index.html
283