Prolog permutation. For example: Oct 11, 2012 · Given your example, it looks like you might actually be wanting the powerset, not the permutation, of the given list. In most languages generating permutations is non-trivial—you need data structures to store the permutations you are generating and control structures to visit all p rmutations in some order. For example, in case of a List, [a, b, c], the possible permutations are as following − Prolog provides an inbuilt function permutation I want to access list permutation and pass it as argument to other functions. Permutations Permutation relation is defined with two arguments such as permutation(L,P) where P is a permutation of list L There are two cases: The predicate permutation/2 is primarily intended to generate permutations. The predicate permutation/2 is primarily intended to generate permutations. A better predicate would be: random_permutation(List, Permutation, PicklistFromListToPermutation). Permutation refers to arrangments of elements in specific order and each combination should be unique order wise. [permutations] [combinations] [variations] This lecture covers basic combinatorial algorithms which generate successively all permutations, combinations and variations respectively. If this helps you, also please upvote that answer. To compute the powerset of a list of items in Prolog, look at this answer by @gusbro. yvw eqwspx cmmfx tvi jdvyrzdn fsjisich vwllm jsuag vpg hxg