Hello! I wanted to share some stuff I had learned from a paper John McCarthy wrote about logic programming, and then experimenting with it in mk.
If the map coloring problem is done in the basic naive way (list out each neighboring country and declare they have a different color) then it takes exponential time to solve it. For something like america with 50 states it'll be impossible to solve. In the paper John McCarthy taught a technique where you can do some preprocessing in order to rearrange the logic program into a series of "local" logic problems which can be solved one after another. We're able to apply this in minikanren by adding some new 'depth first' variants of the regular mk operators. Here is my post about it: http://orchid-hybrid-2.github.io/ All the best! -- You received this message because you are subscribed to the Google Groups "minikanren" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/minikanren. For more options, visit https://groups.google.com/d/optout.
