Longest increasing subset Prolog

Question

I want to create in Prolog to find longest increasing subset of entered list. For example, you enter list of [3,1,2] and the output is [1,2],

?- subset([3,1,2],          


        

Answer 1

Just out of curiosity, would it be possible in prolog to realize something like this for finding longest increasing subsequence:

• You find all subsets of list
• Than you find, which of these subsets are increasing
• And then you search for the longest

If it's possible, how could I do that in Prolog?