One of the issues with standard logic programming is that sooner or later you want to be controlling the search strategies. Mozart/Oz has the notion of "computa

One of the issues with standard logic programming is that sooner or later you want to be controlling the search strategies. Mozart/Oz has the notion of "computational spaces" as a primitive on which to build custom strategies. Quite a while back, I wrote tan implementation of this in JS called FD.js[1] for finite domain constraint programming. Might be useful for those interested in such in JS. [1] https://github.com/srikumarks/FD.js https://github.com/srikumarks/FD.js