Distributive Lattice-Structured Ontologies
Distributive Lattice-Structured Ontologies
复制标题
分布式格结构本体
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
M. Gehrke
中科院分区：
文献类型：
--
作者：
H. Bruun;Dion Coumans;M. Gehrke
在本文中，我们描述了一种语言和方法，推导本体和排序数据库。到达的本体论结构是分配格与属性操作，保持的x2，x3和x4。保留连接允许属性对数据库中的自然连接操作进行建模。我们首先介绍本体框架和知识库，并定义了知识库的解决方案的概念。这个定义的重要性在于，它规定了在什么条件下与感兴趣的领域相关的所有信息都存在，并且它允许我们证明知识库总是有最小或终端解。虽然在这种具有属性的情况下，普遍解或初始解几乎总是无限的，但在许多情况下，最终解是有限的。
我们描述了一种计算终端解的方法，并给出了终端解和非终端解的条件。该方法主要是共代数，使用Priestley对偶，并计算在终端共代数的类别有界分配格属性操作。
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 ⊥. 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.