permutation/2未返回排列，咨询该谓词定义及预期工作机制

What is permutation/2? #

permutation/2 is a standard Prolog predicate built specifically to handle list permutations—whether you need to generate all possible rearrangements of a list, or verify if one list is a permutation of another. As you found in help(permutation), it’s exactly the tool for your use case.

How permutation/2 is supposed to work #

Let’s walk through the example from the docs to break down its behavior:

?- permutation([1,2], [X,Y]).
X = 1, Y = 2 ;
X = 2, Y = 1 ;
false.

Here’s the play-by-play:

• When you run this query, Prolog first unifies the output list [X,Y] with the original order of the input list ([1,2]), giving you the first solution.
• If you type ; (the backtrack operator), Prolog will undo that unification and find the next valid permutation ([2,1]).
• Once all possible permutations are exhausted, Prolog returns false to signal there are no more solutions.

It’s bidirectional too—you can use it to verify a permutation instead of generating one:

?- permutation([1,2], [2,1]).
true.

Or even find what input list would produce a given permutation (though this is less common):

?- permutation(Input, [2,1]).
Input = [1,2] ;
false.

Why your permutation/2 query might return no results #

If you’re getting zero permutations, here are the most likely culprits:

1. Your input list isn’t fully instantiated #

Prolog can’t generate permutations from a list with unbound variables unless you give it enough structure. For example:

• This works (it finds values for X and Y):

  ?- permutation([X,Y], [1,2]).
  

• This will hang or return nothing useful (since X is a completely unbound variable—Prolog can’t guess what list you want permutations of):

  ?- permutation(X, [1,2]).
  

2. Mismatched list lengths #

If your output list has a different length than the input list, Prolog immediately knows there’s no possible permutation and fails. For example:

?- permutation([1,2], [X]).  % Fails—can't rearrange 2 elements into a 1-element list

3. You’re running an infinite query #

If both arguments are unbound variables, Prolog tries to generate every possible list and its permutations—this is an infinite loop, so it might never return any results, or hang entirely:

?- permutation(X, Y).  % Avoid this—it's impossible to generate all possible lists

4. Edge cases with duplicate elements #

permutation/2 does handle duplicates, but it only returns unique list permutations. For example, permutation([1,1], X) will only return X = [1,1] once (since swapping the two 1s doesn’t create a new distinct list). This isn’t a "no results" issue, but it might make you think something’s broken if you expected multiple outputs for duplicate-heavy lists.

5. Implementation-specific quirks #

If you’re using a minimal or non-standard Prolog implementation, permutation/2 might not behave as expected. Stick to standard implementations like SWI-Prolog, GNU Prolog, or SICStus Prolog to avoid this.

Quick fixes to try #

• Start with a fully instantiated small input list (like [1,2]) to confirm permutation/2 works in your environment.
• Make sure your output list either has the same length as the input, or is a completely unbound variable (so Prolog can generate permutations of the correct size).
• Avoid unbound variables in the input list unless you’re specifically trying to solve for what input would produce a given permutation.

内容的提问来源于stack exchange，提问作者Asqiir