PROLOG EXERCISES SEPTEMBER 25 2006


1. Modify member so that it checks for membership in sublists.
	
2. Modify writelist so that it writes elements in sublists.

3. Write length(L, N) where N is the number of elements in list L
	
4. Write reverse(X,Y) where Y is the reverse of list X.  
   Test  reverse([a,b,c], Y) and reverse(X, [a,b,c]).

5. Write_reverse(X) which writes X in reverse order.  

6. Write add_to_end(X, L, LL) where LL is the list L with X added to the end.

7. Write palindrome(X) which returns true if list X is a palindrome.


A possibly useful predicate: atom(X) is true if X is an atom, not a list.