.po 5
.nh
.ce
TEST I CS524
.nf
Instructor Dr P Juell                           NAME__________________________
100 points, open book                                      Dec 17, 1987
OPEN BOOK
.fi
.sp
1. (20)
For the following example 
the Evan's analogy program will not easily "see" the proper relationships.
.sp
(a) Why does Evan's program have problems?
.sp
(b) Propose something to fix these problems.
.sp
.nf
      A                           B
--------------             --------------- 
!            !             !             !
!            !             !             !
!            !             !             !
!            !             !             !
!            !             !             !
!            !             !             !
!            !             !             !
--------------             ---------------
      C                  1               2              3            4
--------------    ---------------  -------------  ------------ -------------
!            !    !             !  !           !  !          ! !           !
!            !    !             !  !           !  !          ! !           !
!            !    !             !  !           !  !          ! !           !
!            !    !             !  !           !  !          ! !           !
!            !    !             !  !           !  !          ! !           !
!            !    !             !  !           !  !          ! !           !
!            !    !             !  !           !  !          ! !           !
!            !    !             !  !           !  !          ! !           !
--------------    ---------------  -------------  ------------ -------------
.fi
.sp
2. (20)
Write a lisp function(s) 
to flatten out a list.  It will always be given a list as input.
e.g.
.nf
(flatten '((a b (c ()) (d e)) f))  =  (a b c d e f)    
.fi
.sp
[For reduced credit write a lisp function(s) to print the atoms
in a list.]
.sp
.bp
3. (20)
The following AND/OR represents ways to solve a problem.  List the names
of the leaves that would be visited (used) if you want to visit a minimum
number of leaves.
.nf
 
				     o
 
 
 
		 o            o               o               o
 
 
 
	 o       o     o   o      o      o    o     o     o         o
 
 
     a   b  c   d  e   f   g    h   i  j   k  l   m   n o  p  q   r  s   t
.fi
.sp
.sp
4. (20)
If you changed some of the values and the order of some of the values
that the Evan's analogy program uses for discrimination (see page ___)
would the program necessarily perform worse?  Why or why not?
.sp
5. (20)
Can the following configurations be built with the blocks world program?
If so, specify the commands to build the configuration assuming
all items start on  the table.  If not, specify "NOT POSSIBLE" and give
a one or two sentence reason why not.
.nf
.in +5
D

C

B           E            G               J     K

A           F        H       I              L

(i)        (ii)         (iii)              (iv)