11.2.1 All Solutions

?X ^ :P
there exists an X such that P is provable (used in setof/3 and bagof/3)
bagof(?X,:P,-B) ISO
B is the bag of instances of X such that P is provable
findall(?T,:G,-L) ISO
findall(?T,:G,?L,?R)
L is the list of all solutions T for the goal G, concatenated with R or with the empty list
setof(?X,:P,-S) ISO
S is the set of instances of X such that P is provable

Send feedback on this subject.