|
Organizers |
Distributive lattice-structured ontologies
by
Mai Gehrke
Radboud Universiteit, Nijmegen, NL
Coauthors: Hans Bruun, DTU, Lyngby, Denmark;
Jørgen Fischer Nilsson, DTU, Lyngby, Denmark
We describe an implementation of a language that accommodates both ontologies and relational databases. The structures arrived at are finite distributive lattices with attribution operations that preserve all joins and binary meets. The preservation of binary meets allows these functions to model the natural join operation in databases. A crucial feature we believe to be new is the concept of terminal solution identifying a minimal faithful ontology generated by the inhabited points of a data set. The main tools we use are Kripke frames/Birkhoff duality and adjoint operations. The work generalises work by Frank Oles of IBM.
Date received: June 22, 2007
Copyright © 2007 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caug-80.