基于描述逻辑的概念图推理

分析了概念图在知识表示领域的重要性及其存在的问题,提出了一种基于描述逻辑的具有自动推理功能的扩展概念图.针对概念图的特点和需求,给出了将概念图的一个子集转化为描述逻辑知识库的方法,并证明了该方法的正确性.同时给出了其知识库的一致性、包含关系的自动判断方法,也证明了这些判断方法的正确性.     

量词在知识图中的分类与表示

在当今知识表示领域中,知识图作为自然语言理解的语义模型有其独到之处,而在自然语言处理中普遍认为词是最基本的单位,本文从语义学和自然语言处理的角度（主要是从知识图的角度,）在对介词的逻辑词的研究之后,按照量词图的结构,对汉语中的量词进行了分类,并且按照知识量词构造,给一词图。     

背景格的若干性质及其完备性证明*

背景在概念图理论中至关重要,其作用尤其体现在信息组织方面。借鉴形式概念分析的理论,用二元组表示形式背景,能够体现出形式背景的内涵与外延的统一。背景格是形式背景的一种组织形式,反映了形式背景之间的蕴涵关系,完备的背景格有着广阔的应用前景。介绍了背景格的定义及其构造方法,并给出了背景格的若干性质以及完备性证明。     

基于概念图的中文信息自动转化技术研究

概念图是一种基于语言学、心理学、哲学为一体的一种知识表示方法,目前主要应用于自然语言处理、知识获取、规划及推理等方面。在哈工大IR-Lab资源基础之上,并结合《知网》的世界知识信息,基于概念图理论提出了一种中文文本信息自动转化为概念图的实现方案。可以实现从中文文本直接转化到概念图结构。     

自然语言处理中的逻辑词

词是自然语言处理中最基本的单位,在当今知识表示领域,知识图作为自然语言理解的语义模型有其独到之处。本文从语言学和逻辑学的角度,首次提出并探讨了逻辑词研究逻辑词分类及如何用知识图表示各类逻辑词的结构。对自然语言处理中研究复句和篇章的理解提供了一种新的途径。     

面向链接预测的知识图谱嵌入研究综述

知识图谱在人工智能领域有着广泛的应用,如信息检索、自然语言处理、推荐系统等。然而,知识图谱的开放性往往意味着它们是不完备的,具有自身的缺陷。鉴于此,需建立更完整的知识图谱,以提高知识图谱的实际利用率。利用链接预测通过已有关系来推测新的关系,从而实现大规模知识库的补全。通过比较基于翻译模型的知识图谱链接预测模型,从常用数据集与评价指标、翻译模型、采样方法等方面分析知识图谱链接预测模型的框架,并对基于知识图谱的链接预测模型进行了综述。     

On generalization/specialization for conceptual graphs

Abstract

This paper centres on the generalization/specialization relation in the framework of conceptual graphs (this relation corresponds to logical subsumption when considering logical formulas associated with conceptual graphs). Results given here apply more generally to any model where knowledge is described by labelled graphs and reasoning is based on graph subsumption, as in semantic networks or in structural machine learning. The generalization/specialization relation, as defined by Sowa, is first precisely analysed, in particular its links with a graph morphism, called projection. Besides Sowa's specialization relation (which is a preorder), another one is actually used in some practical applications (which is an order). These are comparatively studied. The second topic of this paper is the design of efficient algorithms for computing these specialization relations. Since the associated problems are NP-hard, the form of the graphs is restricted in order to arrive at polynomial algorithms. In particular, polynomial algorithms are presented for computing a projection from a conceptual ‘tree’ to any conceptual graph, and for counting the number of such projections. The algorithms are also described in a generic way, replacing the projection by a parametrized graph morphism, and conceptual graphs by directed labelled graphs.     

基于优势关系下不协调目标信息系统的知识约简

在基于优势关系下不协调目标信息系统中引入了分配约简和近似约简的概念,并讨论了它们二者之间的关系,进一步给出了知识约简的判定定理和辨识矩阵,从而提供了在优势关系下不协调目标信息系统知识约简的具体操作方法。     

Compiling conceptual graphs

The paper addresses problems in conceptual graph implementation: subsumption and classification in a taxonomy. Conceptual graphs are typically stored using a directed acyclic graph data structure based on the partial order over conceptual graphs. We give an improved algorithm for classifying conceptual graphs into this hierarchy. It prunes the search space in the database using the information gathered while searching. We show how conceptual graphs in this hierarchy can be compiled into instructions which represent specialized cases of the canonical formation rules. This compiles subsumption of conceptual graphs and compresses knowledge in a knowledge base. Conceptual graphs are compiled as differences between adjacent graphs in the hierarchy. The differences represent the rules used in deriving the graph from the adjacent graphs. We illustrate how the method compresses knowledge bases in some experiments. Compilation is effected in three ways: removal of redundant data, use of simple instructions which ignore redundant checks when performing matching, and by sharing common processing between graphs     

Capture, integration, and analysis of digital system requirementswith conceptual graphs

Initial requirements for new digital systems and products that are generally expressed in a variety of notations including diagrams and natural language can be automatically translated to a common knowledge representation for integration, for consistency and completeness analysis, and for further automatic synthesis. Block diagrams, flowcharts, timing diagrams, and English as used in specifying digital systems requirements are considered as examples of source notations for system requirements. The knowledge representation selected for this work is a form of semantic network called conceptual graphs. For each source notation, a basis set or semantic primitives in terms of conceptual graphs is given, together with an algorithm for automatically generating conceptual structures from the notation. The automatic generation of conceptual structures from English presumes a restricted sublanguage of English and feedback to the author for verification of the interpretation. Mechanisms for integrating the separate conceptual structures generated from individual requirements expressions using schemata are discussed, and methods are illustrated for consistency and completeness analysis     

基于知网的汉语普通未登录词语义分析模型

提出一种基于知网的汉语普通未登录词语义分析模型,该模型以概念图为知识表示方法,以2005版知网为语义知识资源,首先参照知网知识词典对普通未登录词进行分词;然后综合利用知网中的知识词典等知识,通过词性序列匹配消歧法、概念图相容性判定消歧法、概念图相容度计算消歧法及语义相似度计算消歧法对中文信息结构进行消歧;最后根据所选择的中文信息结构生成未登录词的概念图,从而实现未登录词的语义分析。该模型在语义分析过程中一方面确定了未登录词中每个已登录词的词义,另一方面构造了该未登录词的语义信息,实验结果证明它可以作为普通未登录词语义分析的原型系统。     

An approach to capturing and reusing tacit design knowledge using relational learning for knowledge graphs

Tacit design knowledge plays an important role in the process of product design and is a valuable knowledge asset for enterprises. In terms of the characteristics of tacit rational design knowledge, this paper puts forward a scientific hypothesis and approach on capturing and reusing tacit rational design knowledge. The presented approach represents the observable design result facts of products using design knowledge graphs. A design issue-solving oriented knowledge graph model is presented, where directed relation edges represent design issues, and nodes stand for design solutions. When a new design solutions requirement needs to be searched, tacit design knowledge can be reused by relational learning for the constructed design knowledge graphs. In relational learning, the design knowledge graph is converted into a three-order tensor, where two modes are solution nodes, and the third mode holds the issue relations. Then, a tensor factorization approach is employed to calculate the latent features between design solutions for an issue relation. As a result, a score vector to represent the existence of issue-solution relations can be obtained. By sorting the scores in descending order, we may select the solution node with the highest score as the design solution to be searched. Finally, a stamping die design case study is provided. The case study shows that the proposed approach is feasible, and effective, and has better flexibility, scalability and efficiency than CBR methods.     

A smart conflict resolution model using multi-layer knowledge graph for conceptual design

Reducing the impact of conflicts on requirement-function-structure mapping in the early stage of product design is an important measure to achieve conceptual innovation, which relies on accurate reasoning of multi-domain knowledge. As product requirements become more personalized and diverse, traditional discrete knowledge organization and reasoning methods are difficult to adapt to the challenges of continuity and precision in conceptual solution. Knowledge graphs with complex networks have obvious advantages in association detection, knowledge visualization, and explainable reasoning of implicit knowledge, which offer innovative opportunities for conflict resolution in conceptual design. Therefore, a smart conflict resolution model using a multi-layer Knowledge Graph for Conceptual Design(mKGCD) is proposed in this study. A knowledge expression form of FBS-oriented design patent vocabulary is proposed, which is used for knowledge entity recognition and relation extraction based on natural language processing. A label mapping method based on inventive principles is used for patent classification and a four-layer semantic network for conflict resolution is constructed. Through semantic distance calculation, the designer's requirements for function/behavior/structure are smart deployed to obtain appropriate knowledge. A case study of the conceptual design of a collapsible installation and handling equipment demonstrates the feasibility of the proposed approach. The proposed method can not only meet the functional solution and innovation in the context of different design requirements, but also effectively improve the design efficiency in the iterative design process by means of multiple meanings of one graph.     

Visual knowledge specification for conceptual design: Definition and tool support

Current CAD tools are not able to support the conceptual design phase, and none of them provides a consistency analysis for sketches produced by architects. This phase is fundamental and crucial for the whole design and construction process of a building. To give architects a better support, we developed a CAD tool for conceptual design and a knowledge specification tool. The knowledge is specific to one class of buildings and it can be reused. Based on a dynamic and domain-specific knowledge ontology, different types of design rules formalize this knowledge in a graph-based form. An expressive visual language provides a user-friendly, human readable representation. Finally, a consistency analysis tool enables conceptual designs to be checked against this formal conceptual knowledge.In this article, we concentrate on the knowledge specification part. For that, we introduce the concepts and usage of a novel visual language and describe its semantics. To demonstrate the usability of our approach, two graph-based visual tools for knowledge specification and conceptual design are explained.     

Trust-aware recommendation based on heterogeneous multi-relational graphs fusion

Users’ trust relations have a significant influence on their choice towards different products. However, few recommendation or prediction algorithms both consider users’ social trust relations and item-related knowledge, which makes them difficult to cope with cold start and the data sparsity problems. In this paper, we propose a novel trust-ware recommendation method based on heterogeneous multi-relational graphs fusion, termed as T-MRGF. In contrast with other traditional methods, it fuses the user-related and item-related graphs with the user–item interaction graph and fully utilizes the high-level connections existing in heterogeneous graphs. Specifically, we first establish the user–user trust relation graph, user–item interaction graph and item–item knowledge graph, and the user feature and item feature, which have been obtained from the user–item graph, are used as the input of the user-related graph and the item-related graph respectively. The fusion is achieved through the cascade of feature vectors before and after feature propagation. In this way, the heterogeneous multi-relational graphs are fused for the feature propagation, which largely refines the user and item representation for model prediction. Simulation results show that the proposed method significantly improve the recommendation performance compared to the state-of-the-art KG-based algorithms both in accuracy and training efficiency.     

Research on an active knowledge push service based on collaborative intent capture

The quality of a knowledge service influences the quality, efficiency and innovation of product conceptual design. Existing approaches lack intelligence and individuation when providing a knowledge retrieval service via rules and cases. In this paper, we propose a framework of an active knowledge service based on collaborative intent capture to assist product conceptual design. First, a collaborative intent capture model is constructed through the study of the expression and capture of collaborative intent; second, a framework and a process of active knowledge push based on collaborative intent capture are designed after analyzing the method of knowledge resources acquisition based on the constraint satisfaction theory. Finally, match algorithms for text content are studied. Based on the above research achievements, a prototype system of a collaborative design and active knowledge service platform (C-AKSP) has been developed for providing a knowledge service and assisting product conceptual design. An example, the conceptual design of a machine tool spindle system, is used to validate the proposed theories for the model, the framework and the algorithm. As a result, C-AKSP can provide a superior knowledge service that meets the designer's knowledge needs.     

基于概念图的汉语语义计算的研究与实现

中文信息处理的发展迫切需要加强汉语语义理论的研究,尤其是汉语语义表示形式和语义计算的研究。针对目前汉语语义计算方法的计算结果并不准确的问题,提出了一种基于概念图的汉语语义计算方法。该方法以“知网”为语义知识资源,以概念图为知识表示方法,把自然语言文本转化为概念图,通过概念图的匹配实现语义计算,以改善语义计算的效果。实验结果表明该方法对汉语语义计算是有效的。     

Supporting connectivism in knowledge based engineering with graph theory,filtering techniques and model quality assurance

Mass-customization has forced manufacturing companies to put significant efforts to digitize and automate their engineering and production processes. When new products are to be developed and introduced the production is not alone to be automated. The application of knowledge regarding how the product should be designed and produced based on customer requirements also must be automated. One big academic challenge is helping industry to make sure that the background knowledge of the automated engineering processes still can be understood by its stakeholders throughout the product life cycle.The research presented in this paper aims to build an infrastructure to support a connectivistic view on knowledge in knowledge based engineering. Fundamental concepts in connectivism include network formation and contextualization, which are here addressed by using graph theory together with information filtering techniques and quality assurance of CAD-models. The paper shows how engineering knowledge contained in spreadsheets, knowledge-bases and CAD-models can be penetrated and represented as filtered graphs to support a connectivistic working approach. Three software demonstrators developed to extract filtered graphs are presented and discussed in the paper.     

An Algorithm for Partitioning a Set into Simple Parts

The paper describes a method for the structural analysis of abstract data and its applications. A finite set with two numberings, two order relations, and one symmetry relation is considered. An algorithm is proposed for partitioning this set into simple parts determined by compositions of given relations. Each simple part of the set is then partitioned into layers. This model can also be used for analyzing different data admitting similar formalization. It can be used for analyzing structure of some graphs (in particular, graphs describing molecular associations). The proposed algorithms are used for partitioning a complex family into simple ones determined by family relationships and for determining family generations. The algorithms can be applied to analyzing corporations with a family-like structure.