Prolog:

Define the powerSet predicate so that powerSet (X, Y) says that the powerset of X is Y. The powerset of a set is the set of all subsets of that set. For example, consider the set A-[1,2,3]. It has various subsets: {1j, {1,2) and so on. And of course the empty set (0 is a subset of every set. The powerset of A is the set of all subsets of A: P(S) 0,(1),121,f3),11,2),2,31,(1,3),11,2,3 For your powerSet predicate, if X is a list (representing the set), Y will be a list of lists (representing the set of all subsets of the original set). So power set ( [ 1,2 ] , y should produce the binding Y - 11,2), {,2, (in any order). Your predi- cate may choose a fixed order for Y. Your predicate need not work well when X is an unbound variable Define the powerSet predicate so that powerSet (X, Y) says that the powerset of X is Y. The powerset of a set is the set of all subsets of that set. For example, consider the set A-[1,2,3]. It has various subsets: {1j, {1,2) and so on. And of course the empty set (0 is a subset of every set. The powerset of A is the set of all subsets of A: P(S) 0,(1),121,f3),11,2),2,31,(1,3),11,2,3 For your powerSet predicate, if X is a list (representing the set), Y will be a list of lists (representing the set of all subsets of the original set). So power set ( [ 1,2 ] , y should produce the binding Y - 11,2), {,2, (in any order). Your predi- cate may choose a fixed order for Y. Your predicate need not work well when X is an unbound variable