I'm going to assume you mean the computational complexity of working with such an expressive representation. If so, then that is correct. historically, working such an expressive representation blows out computationally. But, we've resolved that issue with our graph engine. that is, its been shown that algorithms take time proportional to N-cubed where N is the number of graphs in the knowledge base. with our graph engine, we encode graph structures and ontology in a Cognitive Signature, and we can find closely matching signatures in log(N) time. the log-time algorithms scale to the size of the web.