% http://www.cs.kuleuven.be/~dtai/events/ASP-competition/Benchmarks/FastFood.shtml % by Neng-Fa Zhou, April 11, 2009 solve(As):- findall(RK,member(restaurant(_,RK),As),RKs), % restaurant distances findall(DK,member(depot(_,DK),As),DKs), % dipot distances sum_supply_distances(RKs,DKs,0,Sum0), length(DKs,M), % M - number of depots length(Vars,M), % Vars=[V1,...,VM] Vi=d if the ith depot is built d ki away Vars :: RKs, ordered(Vars), % V1=