Knowledge consistency is the property that a knowledge database contain
no contradictions.
It is extremely important for knowledge representations
that may only either assert or deny statements, with no measure of partial
belief.
One such system is first order predicate calculus.
Because all statements may be either true or false, it may be possible to store
only part of the statements (a basis set), from which all true statements
(or all false statements) may be derived.
Statements that can't be derived from the basis set are assumed false (or true).
This is the
closed-world assumption.
The primary advantage of knowledge consistency is ability to store less
statements (using closed-world assumption).
A related property is learning monotonicity,
which is whether an architecture may learn things that contradict what it
already knows. If an architecture must maintain a consistent knowledge
base then any learning strategy it uses must be monotonic.
Architectures which require knowledge consistency include:
Go to the List of Common Agent Properties.
Return to the Table of Contents.