Question

Question 3 (13] (a) Write a procedure filter (L,PredName, L1,L2) that accepts a list L and returns two lists Li and L2, where Li contains all elements in L for which PredName (x) fails, and L2 contains all elements in L for which PredName (x) succeeds. The predicate PredName/1 should be defined when calling the procedure filter. For example: let test be defined as test(N).- N > 0. 7- filter((-6,7,-1,0),test,L1,L2). L1 - (-6.-1) L2 - [7, 0] NB Use the Prolog built-in predicate. (6) (b) Write a Prolog program to remove duplicate elements from an unsorted list without using the built-in predicate setof (c) Write a Prolog program to remove duplicate elements from a list, this time using the built-in predicate setof (3)

Answer 1

Page 1 Answer:- As per given details swI- Prolog the One way is to use Pdedicated used to this is exclude from the library opply OR filter Clist, Pred Name Result); findali (M (member LM, List), call (Pred Name, M), Result Explanation : findall on list Pass Predicate. Value of M are collected to Result. (6) membex 1 (x, [H). 3) :- X= = H,!. member 1 (X,6-17]) :- membes 1 CX,T).

Page 2 distinct (C1,6]). distinct (CHIT), C) :- Member 1 CH,T), !, distinct (T,C). distinct (CH173, CHIC]):- distinct (T,C) (C) mymember CX, CX] _)). mymember (X.C_1T]): mymember (X,T). not (A):- \ t call (A). Set (C],[]). Set (CH)], CHlout3) - mot (my member CH, T)), set CT, Out). Set (CHIT] ,Out):- mymember CH,T), Set (T, Out) PLEASE LIKE HIT VOTE