Yo ! > In this language, your code enumerates true/false assigments to the variables > x_j, so that all these NO clauses hold true. > These NO clauses are just an encoding of your "matrix of NOs" that I > understood > you write out completely. But now you write that you can't do this. > Oh well.
Yes, but in this formalism they consider the function as a black box, which is exactly what I am doing when I run the function I mentionned in this thread. The matrix that I build in this function does not contain all no-sets. At first it contains none. And every time the function F is called, we 'learn' either a yes-set (that we store) or a no-set (that we add to the matrix, in order to filter other sets later). I cannot enumerate all no-set and all yes-sets, for the union of them is 2^n. But the function tries to do its job by only having to meet the inclusionwise mininal no-sets, which it computes while the functions does its exploring. Nathann -- You received this message because you are subscribed to the Google Groups "sage-devel" 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 http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
