Knowledge creation using class algebra

We present an overview of knowledge creation in a ternary Boolean algebra of classes and binary relations. The knowledge creation process involves both the induction and deduction processes to create the most "interesting" IS-A hierarchy of classes. This IS-A hierarchy will contain "interesting" class containments from which rules may be proposed and verified. These rules are proposed by looking at the "extent", or the set of instances of the class, and noticing that all objects in a class "unexpectedly" satisfy some predicate. If this predicate does not follow from normalizing the other predicates in the "intent" of the class, then a rule can be proposed that all members of this class satisfy the predicate. A theorem prover may then attempt to prove the predicate from previous rules and the other predicates in the intent. The deeper the proof tree, the more interesting is the rule.