Class Algebra for Ontology Reasoning

02/02/2013
by   Daniel Buehrer, et al.
0

Class algebra provides a natural framework for sharing of ISA hierarchies between users that may be unaware of each other's definitions. This permits data from relational databases, object-oriented databases, and tagged XML documents to be unioned into one distributed ontology, sharable by all users without the need for prior negotiation or the development of a "standard" ontology for each field. Moreover, class algebra produces a functional correspondence between a class's class algebraic definition (i.e. its "intent") and the set of all instances which satisfy the expression (i.e. its "extent"). The framework thus provides assistance in quickly locating examples and counterexamples of various definitions. This kind of information is very valuable when developing models of the real world, and serves as an invaluable tool assisting in the proof of theorems concerning these class algebra expressions. Finally, the relative frequencies of objects in the ISA hierarchy can produce a useful Boolean algebra of probabilities. The probabilities can be used by traditional information-theoretic classification methodologies to obtain optimal ways of classifying objects in the database.

READ FULL TEXT

page 10

page 11

research
04/10/2018

A Mathematical Framework for Superintelligent Machines

We describe a class calculus that is expressive enough to describe and i...
research
01/25/2021

The Agda Universal Algebra Library and Birkhoff's Theorem in Dependent Type Theory

The Agda Universal Algebra Library (UALib) is a library of types and pro...
research
02/20/2015

An Approach For Transforming of Relational Databases to OWL Ontology

Rapid growth of documents, web pages, and other types of text content is...
research
10/22/2018

What is an Ontology?

In the knowledge engineering community "ontology" is usually defined in ...
research
09/16/2023

Some Algebraic Aspects of Assume-Guarantee Reasoning

We present the algebra of assume-guarantee (AG) contracts. We define con...
research
12/20/2019

A characterization of ordered abstract probabilities

In computer science, especially when dealing with quantum computing or o...
research
09/13/2021

Predictable universally unique identification of sequential events on complex objects

Universal identifiers and hashing have been widely adopted in computer s...

Please sign up or login with your details

Forgot password? Click here to reset