统一基于类的表示形式
Unifying Class-Based Representation Formalisms
摘要:
类的概念在计算机科学中是普遍存在的,并且在用于知识表示和数据库中的结构化知识的表示的许多形式主义中是中心的。在本文中,我们研究的基本问题,这种表示形式主义,并挑选出他们的共同特点和他们的显着特点。这样的调查导致我们提出了一个统一的框架,在这个框架中,我们能够捕获在不同的上下文中使用的几种表示语言的基本方面。所提出的形式主义表示的风格的描述逻辑,这已被引入知识表示作为一种手段,提供一个语义上有充分根据的基础上的结构方面的知识表示系统。描述逻辑是一阶逻辑的一个子集,具有良好的计算特性。它是相当有表现力的,并具有一个新的结构组合,以前没有研究过。区别结构是数量限制,它概括了存在性和功能依赖性,逆角色,它允许人们引用关系的逆,以及可能的循环断言,这是捕获现实世界域所必需的。我们能够表明,正是这种结构的组合,使我们的逻辑强大到足以建模的基本功能集定义类结构是共同的框架系统,面向对象的数据库语言,和语义数据模型。由于建立的对应关系,上述形式主义的几个重要的扩展变得可用。我们提出的逻辑的高表达性和需要在不同的上下文中捕获的推理迫使我们区分无限制和有限模型推理。我们的建议的一个显着特点是,在这两种情况下的推理是可判定的。我们认为,凭借高的表达能力和相关的推理能力,不受限制的和有限的模型,我们的逻辑提供了一个共同的核心,基于类的表示形式主义。
英文摘要:
The notion of class is ubiquitous in computer science and is central in many formalisms for the representation of structured knowledge used both in knowledge representation and in databases. In this paper we study the basic issues underlying such representation formalisms and single out both their common characteristics and their distinguishing features. Such investigation leads us to propose a unifying framework in which we are able to capture the fundamental aspects of several representation languages used in different contexts. The proposed formalism is expressed in the style of description logics, which have been introduced in knowledge representation as a means to provide a semantically well-founded basis for the structural aspects of knowledge representation systems. The description logic considered in this paper is a subset of first order logic with nice computational characteristics. It is quite expressive and features a novel combination of constructs that has not been studied before. The distinguishing constructs are number restrictions, which generalize existence and functional dependencies, inverse roles, which allow one to refer to the inverse of a relationship, and possibly cyclic assertions, which are necessary for capturing real world domains. We are able to show that it is precisely such combination of constructs that makes our logic powerful enough to model the essential set of features for defining class structures that are common to frame systems, object-oriented database languages, and semantic data models. As a consequence of the established correspondences, several significant extensions of each of the above formalisms become available. The high expressiveness of the logic we propose and the need for capturing the reasoning in different contexts forces us to distinguish between unrestricted and finite model reasoning. A notable feature of our proposal is that reasoning in both cases is decidable. We argue that, by virtue of the high expressive power and of the associated reasoning capabilities on both unrestricted and finite models, our logic provides a common core for class-based representation formalisms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。