Please Suggest - Continually Resort vs. Interfacing Prolog.

Question

I would like to pass a list, arraylist, queue or some other collection of data to a Prolog program. Then have the Prolog program sort the collection and pass it to a java method which returns a value to the Prolog program. The goal of the Prolog program is to get the lowest possible value of the collection, when passed throught the java method.
Reason:
Prolog should naturally resort the list while trying to achieve its goal. If Java can resort a list of values into all possible permutations then I won't need to interface with Prolog, however I can't find anyway to continually resort a list and notify when all permutations have been completed.
Illustration://Original List:
  [AA][BB][CC][DD][EE]
//Desired Method Result:
  [AA][BB][CC][EE][DD]  [AA][BB][DD][CC][EE]  [AA][BB][DD][EE][CC]
  [AA][BB][EE][DD][CC]  [AA][BB][EE][CC][DD]  [AA][CC][BB][DD][EE]
  [AA][CC][BB][EE][DD]  [AA][CC][EE][BB][DD]  ...
//Prolog Psuedo Statement:
     goal: java(thisOrder) < java(previousOrder)
     on YES previousOrder = thisOrder
     on NO return previousOrderThank you for your time and any suggestions given.

Answer 1

I would like to pass a list, arraylist, queue or some
other collection of data to a Prolog program. Then
have the Prolog program sort the collection and pass
it to a java method which returns a value to the
Prolog program. The goal of the Prolog program is to
get the lowest possible value of the collection, when
passed throught the java method.When you write 'the lowest possible value of the collection' do you mean the lowest value in the collection or is there some formula or algorithm for determining the value of a collection depending on its order?
Reason:
Prolog should naturally resort the list while trying
to achieve its goal. If Java can resort a list of
values into all possible permutations then I won't
need to interface with Prolog, however I can't find
anyway to continually resort a list and notify when
all permutations have been completed.I don't understand why you need every possible permutation. I think you need to explain the goal of this program more clearly. Sure, you can create a java method that will create every possible permutation but why?
Illustration://Original List:
[AA][BB][CC][DD][EE]
//Desired Method Result:
[AA][BB][CC][EE][DD]  [AA][BB][DD][CC][EE]
]  [AA][BB][DD][EE][CC]
[AA][BB][EE][DD][CC]  [AA][BB][EE][CC][DD]
]  [AA][CC][BB][DD][EE]
[AA][CC][BB][EE][DD]  [AA][CC][EE][BB][DD]  ...
//Prolog Psuedo Statement:
goal: java(thisOrder) < java(previousOrder)
on YES previousOrder = thisOrder
on NO return previousOrderThank you for your time and any suggestions given.