The term completeness as applied to knowledge bases refers to two different concepts.
In some cases, a consistent knowledge base can be made complete with the closed world assumption—that is, adding all not-entailed literals as negations to the knowledge base.
In the above example though, this would not work because it would make the knowledge base inconsistent:
For Query 2, no such conclusion could be made, as predicate T is potentially incomplete.
You can help Wikipedia by expanding it.This database-related article is a stub.