Remove duplicates in list (Prolog)

by

You are getting multiple solutions due to Prolog’s backtracking. Technically, each solution provided is correct, which is why it is being generated. If you want just one solution to be generated, you are going to have to stop backtracking at some point. This is what the Prolog cut is used for. You might find that reading up on that will help you with this problem.

Update: Right. Your member() predicate is evaluating as true in several different ways if the first variable is in multiple positions in the second variable.

I’ve used the name mymember() for this predicate, so as not to conflict with GNU Prolog’s builtin member() predicate. My knowledge base now looks like this:

mymember(X,[X|_]).
mymember(X,[_|T]) :- mymember(X,T).

not(A) :- \+ call(A).

set([],[]).
set([H|T],[H|Out]) :-
    not(mymember(H,T)),
    set(T,Out).
set([H|T],Out) :-
    mymember(H,T),
    set(T,Out).

So, mymember(1, [1, 1, 1]). evaluates as true in three different ways:

| ?- mymember(1, [1, 1, 1]).

true ? a

true

true

no

If you want to have only one answer, you’re going to have to use a cut. Changing the first definition of mymember() to this:

mymember(X,[X|_]) :- !.

Solves your problem.

Furthermore, you can avoid not() altogether, if you wish, by defining a notamember() predicate yourself. The choice is yours.

More Related Contents:

  1. prolog change show answer to print into list
  2. Prolog union for A U B U C
  3. Prolog – count repetitions in list
  4. Prolog removing unique elements only
  5. Find powers of 2 in a list Prolog
  6. Flatten a list in Prolog
  7. How do I append lists in Prolog?
  8. Prolog: Filtering a list?
  9. Subsets in Prolog
  10. Get elements from list of lists
  11. Lazy lists in Prolog?
  12. Segregating Lists in Prolog
  13. Splitting a list of integers into a list of positive integers and a list of negative integers
  14. How to count number of element occurrences in a list in Prolog
  15. Intersection and union of 2 lists
  16. Prolog: First duplicate value
  17. Implementing “last” in Prolog
  18. Recursive Prolog predicate for reverse / palindrome
  19. Prolog, find minimum in a list
  20. What is Haskell’s Stream Fusion
  21. Using return vs. not using return in the list monad
  22. Cartesian product of infinite lists in Haskell
  23. Hide Show content-list with only CSS, no javascript used
  24. How to extend a Scala list to enable slicing not by explicit position but by given predicate/condition
  25. Iterate over pairs in a list (circular fashion) in Python
  26. How to count items’ occurence in a List
  27. Removing syntactic sugar: List comprehension in Haskell
  28. Counting unique elements in a list
  29. Unsequence Monad function within Haskell
  30. Prolog getting head and tail of string

Leave a Comment