Knowledge creation using class algebra

Abstract

This paper presents an overview of knowledge creation in a t e m q 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 hieiarchy 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 thir 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.

Access Control for Shared Ontologies

“…Depending on the configuration, it stores data in various databases, in a file system, or even in cloud storage such as Hadoop. The upper ontology Kernel0 is based on a common data model, class algebra 5,6 , and it allows objects to cross-reference each other via relations on the Web. A related query language 6 helps to query data in the ontology on the web via proxy queries.…”