> > > How many domains are there? one? two? three? "satisfiability modulo > theories" > That's what those words mean. >
Any relation based on individual properties of objects. > > I'm totally confused. "Greater than" is just a theory. Its like any other > theory. > What exactly, is the problem here? > The problem is very small: PM enumerates virtual links for every pair of nodes, making it O(N^2), while without such link similar queries are executed in O(N). > So, stick them in the same group. If you design a crappy representation > for the knowledge you are representing, then the query will run slowly. > They are in the same group. Maybe the representation is crappy, maybe algorithms... -- You received this message because you are subscribed to the Google Groups "opencog" 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/opencog. To view this discussion on the web visit https://groups.google.com/d/msgid/opencog/CABpRrhz3uLkfmgY_qoJLrkfR5%2B6y%2B9V_RZxqG-nUizox06newQ%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
