I haven’t read english version of the article, but I suspect you’re talking about http://en.wikipedia.org/wiki/Constraint_satisfaction_problem

You can find some references to this by following this 2-SAT article:

http://en.wikipedia.org/wiki/2-satisfiability

There’s no reference implementation (yet?), at least not the one I know of. I also don’t know if professor Romanov has any implementation available. I suggest you to contact him directly at romvf@mail.ru.

I haven’t made any progress on new implementation, and I won’t have any time soon to work on it.

]]>Is there an alternative reference for ‘constraints distribution’, preferably on the net?

]]>Dmitry: have you made any progress on a reference implementation?

]]>You can look at the previous reference implementation, F => CTF set completely implemented there. Try running any example using this solver, and examine debug output.

]]>Current implementation should be much simpler than previous: there is no more hyperstructures and concordant shifts, etc. So if someone else wants to try his skills and implement this — you’re welcome, I will try to answer any questions with the help of Vladimir Romanov.

Meanwhile you can watch this repo on github: https://github.com/anjlab/sat3. If new implementation will appear from me — it will be there. Of course, I will also write a post here when it will be ready.

]]>By hard you mean a huge instance?

As a previous version, new algorithm doesn’t make any assumptions on instance structure, so it should work the same for all (easy and hard) instances. It also much lighter by the means of required computations and memory consumption, so it should be possible to create implementations that are able to solve bigger instances than previous algorithm.

]]>