On Thu, Oct 25, 2012 at 07:02:29PM -0700, Matthew Rocklin wrote: > > Regarding combinatorial explosion yes, that's an issue. There are a few > ways to get past this, the first is to do this whole experiment with lazy > generators. Get one match quickly, ask for another if you don't like it, if > you want all of them you have that option. I believe that Prolog works this > way. You might also be able to do some sort of guided search. Ideally we > find a way to separate the search mechanism from the matching.
I'm fully supportive of applying the lazy approach by means of generators. In my GSoC-2012 work I relied on generators a great deal and I haven't yet had an occasion to regret this. Sergiu -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
