Hi, We're planning to tackle a decision problem as a "dynamic" CSP meaning that, while exploring partial solutions for this problem, we aggregate constraints... In order to prune in polynomial time ill-formed partial solutions, we would like to use some kind of arc consistency and delay as much as possible solving CSPs. Therefore, we need to call "arc consistency method/function" frequently, and not the solve method/function.
I've looked rapidly the documentation, and I'am not sure Gecode library could help us. But, I've never used it... Is there any module that I should consider? Thanks, Humbert. _______________________________________________ Gecode users mailing list users@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
