All Solutions Built-ins

These predicates yield the sets of solutions to a goal. The underlying technique is to find a solution to the problem, record it, then force backtracking to find a further solution. This process is continued until all solutions are found.

ECLiPSe All solutions built-in.

bagof(?Term, +Goal, ?List)

Succeeds if List is the (non-empty) list of all instances of Term such that Goal is provable.  

coverof(?Term, +Goal, ?List)

Succeeds if List is the (non-empty) list of all the most general instances of Term such that Goal is provable.  

findall(?Term, +Goal, ?List)

List is the (possibly empty) list of all instances of Term such that Goal is provable.  

setof(?Term, +Goal, ?List)

Succeeds if List is the (non-empty) ordered list of all instances of Term such that Goal is provable.