Hi, It is really difficult to answer your question. If I understand correctly you would like to use constraint propagation now and then but not search. This you can do easily with Gecode, you might want to start by working through the first two chapters of Modeling and Programming with Gecode.
Best Christian -- Christian Schulte, Professor of Computer Science, KTH, www.ict.kth.se/~cschulte/ -----Original Message----- From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On Behalf Of primafa...@free.fr Sent: Friday, December 13, 2013 6:16 PM To: users@gecode.org Subject: [gecode-users] Arc consistency and "dynamic" CSP 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 _______________________________________________ Gecode users mailing list users@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
