Abstract
In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attribution operations that preserve ∨, ∧ and \(\bot\). The preservation of ∧ allows the attributes to model the natural join operation in databases. We start by introducing ontological frameworks and knowledge bases and define the notion of a solution of a knowledge base. The import of this definition is that it specifies under what condition all information relevant to the domain of interest is present and it allows us to prove that a knowledge base always has a smallest, or terminal, solution. Though universal or initial solutions almost always are infinite in this setting with attributes, the terminal solution is finite in many cases.
We describe a method for computing terminal solutions and give some conditions for termination and non-termination. The approach is predominantly coalgebraic, using Priestley duality, and calculations are made in the terminal coalgebra for the category of bounded distributive lattices with attribution operations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Lutz, C., Sturm, H., Wolter, F.: Fusions of Description Logics and Abstract Description Systems. J. Artif. Intell. Res (JAIR) 16, 1–58 (2002)
Baader, F., Nutt, W.: Basic description logics. In: Baader, F., et al. (eds.) The description logic handbook: theory, implementation, and applications, pp. 43–95. Cambridge University Press, Cambridge (2003)
Bezhanishvili, N., Kurz, A.: Free modal algebras: a coalgebraic perspective. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 143–157. Springer, Heidelberg (2007)
Bruun, H.: The developement of a lattice structured database. IMM Technical report, Technical University of Denmark, DTU (2006), http://www2.imm.dtu.dk/pubdb/views/publication_details.php?id=4967
Bruun, H., Fischer Nilsson, J., Gehrke, M.: Lattice ordered ontologies (preprint)
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)
Gehrke, M., Jónsson, B.: Bounded distributive lattice expansions. Mathematica Scandinavica 94(1), 13–45 (2004)
Ghilardi, S., Santocanale, L.: Algebraic and Model-Theoretic Techniques for Fusion Decidability in Modal Logic. In: Vardi, M., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2003). LNCS (LNAI), vol. 2850, pp. 152–166. Springer, Heidelberg (2003)
Nilsson, J.F.: Relational data base model simplified and generalized as algebraic lattice with attribution. In: FQAS 1994, pp. 101–104 (1994)
Oles, F.J.: An application of lattice theory to knowledge representation. Theoretical Computer Science 249, 163–196 (2000)
OntoQuery project net site, http://www.ontoquery.dk
Sofronie-Stokkermans, V.: Automated theorem proving by resolution in non-classical logics. Annals of Mathematics and Artificial Intelligence 49(1-4), 221–252 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruun, H., Coumans, D., Gehrke, M. (2009). Distributive Lattice-Structured Ontologies. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds) Algebra and Coalgebra in Computer Science. CALCO 2009. Lecture Notes in Computer Science, vol 5728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03741-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-03741-2_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03740-5
Online ISBN: 978-3-642-03741-2
eBook Packages: Computer ScienceComputer Science (R0)