intersection/3

Availability::- use_module(library(lists)).(can be autoloaded)

[det]intersection(+Set1, +Set2, -Set3)

True if Set3 unifies with the intersection of Set1 and Set2. The complexity of this predicate is |Set1|*|Set2|. A set is defined to be an unordered list without duplicates. Elements are considered duplicates if they can be unified.

See also: ord_intersection/3.