Hello, I see how everyg work, but is there a way to have something like someg that checks whether any goal is true in a coll ?

yes, let me find it

when you everyg is a conjunction of goals and there is some other functional constructor of disjunctions, the macro constructor for disjunctions is conde

ah or*

ah-ah thanks !

ah, sorry, sublte difference in use cases

so instead of (everyg f coll) I can do something like (or* (mapv f coll)) ?

and* and or* turn a list of goals into a goal, which is not exactly what everyg does

yeah, I think so

(let [vars [(l/lvar) (l/lvar) (l/lvar)]]
  (l/run* [q]
    (l/== q vars)
    (l/everyg #(fd/in % (fd/domain 1 2 3 4 5 6 7)) vars)
    (l/or* (mapv #(l/== 7 %) vars))))

ok, additional question: I want to check that at least n goals be successful in my coll, I've succeeded in doing that with project but it seems pretty slow, any better way to do so ?

don't

I think maybe a way to do it would be to take your collection of goals, generate all the n-ary permuations of them, then and* each permuation then or* all of them

and if that sounds like a lot, that is in fact what the search tree ends up needing to look like if you want to exhaustively search for all options, which is why the performance is going to be bad

which is why if you can find other way to express what you want it might be better

a simplified version of the task at hand: I have a list of goals, and a sliding window over said list of goals, and I want to make sure that in each window (say of length 3), at least 2 goals are valid