4 ms·
Looks a lot like this: https://youtu.be/OyfBQmvr2Hc?t=1h6m35s https://youtu.be/OyfBQmvr2Hc?t=1h6m35s
by lottin 9y ago
Looks a lot like this:
https://youtu.be/OyfBQmvr2Hc?t=1h6m35s https://youtu.be/OyfBQmvr2Hc?t=1h6m35s
- agumonkey 9y agoMy first thought. I wonder how much logic programming is in suggest.el .. if it's full fledge then I'll be damned.
- wcummings 9y agoSounds like it's brute forcing elisp fns.
- agumonkey 9y agoWell prolog is a kind of brute force too
- zmonx 9y agoA major attraction of (pure) Prolog is that you can easily reorder goals and use all-solutions predicates to try different search strategies. Further, constraints like dif/2 help considerably to prune the search space. So yes, it can be brute force, but is often better than that.
- agumonkey 9y agoSure, but there's no magic here when you want to explore the space of all possibilities. I'm a prolog noob and barely new about dif
- zmonx 9y agoYes I agree. Still, the key insight of constraints like dif/2 may also be applicable in this concrete case to limit the candidates already before and even during the search. It is this automatic pruning that makes logic programming with constraints so fast for many combinatorial applications. You are right of course that it may end up in brute force though, if there is nothing to prune.
- agumonkey 9y agoI have yet to read about CLP, I'm eager now.