I'd like to use predicates like:
range(X,0,5)
range(X,4,200)
range(X,-1000000,1000000)
dom_range(X,-1000000,1000000)
with meaning :
range(X,0,5) :- member(X,[0,1,2,3,4,5]).
range(X,4,200) :- member(X,[4,5,6...198,199,200]).
range(X,-1000000,1000000) :- member(X,[-1000000,...,1000000]).
dom_range(X,-1000000,1000000) :- domain(X, [-1000000,...,1000000]).
How to code it in Prolog nicely (taking solution performance into account - depth of recursion etc) ?
Solution is expected to run on GNU-Prolog.
P.S. Question inspired with this question.
SWI-Prolog has the predicate between/3. so you would call it like between(0,5,X) to get the results you showed above. This predicate looks like this is implemented in C though.
If we have to write it in pure prolog (and speed&space is not a factor), you could try this following.
range(Low, Low, High).
range(Out,Low,High) :- NewLow is Low+1, range(Out, NewLow, High).
Dave's answer is almost perfect: there is no check to see if low < high. I added a condition and now it works fine (otherwise it generates numbers from low to infinity):
range(Low, Low, High).
range(Out,Low,High) :- NewLow is Low+1, NewLow =< High, range(Out, NewLow, High).
Hope that helps!
range
in Gnu-Prolog can be solved with finite domains
range(X,Low,High) :- fd_domain(X,Low,High).
I don't know if dom_range(X,L,H) :- fd_domain(X,L,H)
.
P.S. When playing with finite domains, you might like to use fd_set_vector_max/1
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With