Cao Cungen

Progress in the development of national knowledge infrastructure

This paper presents the recent process in a long-term research project, called National Knowledge Infrastructure (or NKI). Initiated in the early 2000, the project aims to develop a multi-domain shareable knowledge base for knowledge-intensive applications. To develop NKI, we have used domain-specific ontologies as a solid basis, and have built more than 600 ontologies. Using these ontologies and our knowledge acquisition methods, we have extracted about 1.1 millions of domain assertions. For users to access our NKI knowledge, we have developed a uniform multi-modal human-knowledge interface. We have also implemented a knowledge application programming interface for various applications to share the NKI knowledge.This paper presents the recent process in a long-term research project, called National Knowledge Infrastructure (or NKI). Initiated in the early 2000, the project aims to develop a multi-domain shareable knowledge base for knowledge-intensive applications. To develop NKI, we have used domain-specific ontologies as a solid basis, and have built more than 600 ontologies. Using these ontologies and our knowledge acquisition methods, we have extracted about 1.1 millions of domain assertions. For users to access our NKI knowledge, we have developed a uniform multi-modal human-knowledge interface. We have also implemented a knowledge application programming interface for various applications to share the NKI knowledge.

Immune Genetic Algorithm for Weapon-Target Assignment Problem

An Immune Genetic Algorithm (IGA) is used to solve weapon-target assignment problem (WTA). The used immune system serves as a local search mechanism for genetic algorithm. Besides, in our implementation, a new crossover operator is proposed to preserve good information contained in the chromosome. A comparison of the proposed algorithm with several existing search approaches shows that the IGA outperforms its competitors on all tested WTA problems.

Extracting and sharing knowledge from medical texts

In recent years, we have been developing a new framework for acquiring medical knowledge from Encyclopedic texts. This framework consists of three major parts. The first part is an extended high-level conceptual language (called HLCL 1.1) for use by knowledge engineers to formalize knowledge texts in an encyclopedia. The other part is an HLCL 1.1 compiler for parsing and analyzing the formalized texts into knowledge models. The third part is a set of domain-specific ontologies for sharing knowledge.In recent years, we have been developing a new framework for acquiring medical knowledge from Encyclopedic texts. This framework consists of three major parts. The first part is an extended high-level conceptual language (called HLCL 1.1) for use by knowledge engineers to formalize knowledge texts in an encyclopedia. The other part is an HLCL 1.1 compiler for parsing and analyzing the formalized texts into knowledge models. The third part is a set of domain-specific ontologies for sharing knowledge.

Establishment of the TCM Meta Conceptual Model Based on Domain Ontology

Abstract Informatics methods and techniques have been increasingly developed and applied in the field of the traditional Chinese medicine (TCM). However, because of the lack of research on the conceptual information model of the TCM and the absence of theoretical guidance to the top-level model, the current TCM information research is usually demand oriented and hardly reflects the characteristics and advantages of the TCM. This article analyzes the theoretical foundation and research status of the TCM conceptual information model and makes a proposal to establish the conceptual information model of the TCM based on domain ontology. This proposal emphasizes the motion law of the TCM information, including the generation and variation law of human self information, the influence and variation law of human bodies induced by natural information and social information, and the mutual influence and association law of external information, natural information, and social information, based on which the TCM conceptual information model can be established.

Designing a top-level ontology of human beings: a multi-perspective approach

Knowledge about human beings is an integral part of any intelligent agent of considerable significance. Delimiting, modeling and acquiring such knowledge are the central topics of this paper. Because of the tremendous complexity in knowledge of human beings, we introduce a top-level ontology of human beings from the perspectives of psychology, sociology, physiology and pathology. This ontology is not only an explicit conceptualization of human beings, but also an efficient way of acquiring and organizing relevant knowledge.Knowledge about human beings is an integral part of any intelligent agent of considerable significance. Delimiting, modeling and acquiring such knowledge are the central topics of this paper. Because of the tremendous complexity in knowledge of human beings we introduce a top-level ontology of human beings from the perspectives of psychology, sociology, physiology and pathology. This ontology is not only an explicit conceptualization of human beings, but also an efficient way of acquiring and organizing relevant knowledge.

The Description Logic for Relational Databases

Description logics are widely used to express structured data and provide reasoning facility to query and integrate data from different databases. This paper presents a many-sorted description logic \({\cal MDL}\) to represent relational databases. We give a translation from relational databases to the description logic \({\cal MDL}\), and show this translation completely and faithfully captures the information in the relational database. Moreover, we show that some relational algebra operations could be expressed in \({\cal MDL}\).Description logics are widely used to express structured data and provide reasoning facility to query and integrate data from different databases. This paper presents a many-sorted description logic MDL to represent relational databases. We give a translation from relational databases to the description logic MDL, and show this translation completely and faithfully captures the information in the relational database. Moreover, we show that some relational algebra operations could be expressed in MDL.

A framework for automated test generation in intelligent tutoring systems

Intelligent tutoring systems have being extensively researched, and are viewed as cost-effective alternatives to traditional education. However, it has been long recognized that development of such systems is labor-intensive and time-consuming, and that a certain degree of automation in the development process is necessary. This paper proposes a framework for automating test generation – one of the key components in an intelligent tutoring system. The core of the framework is a domain conceptual model, a collection of testing goals, and a collection of test-generation rules, and the latter two are formulated from an analysis of various modes of error and on the basis of the domain conceptual model.

The Variant Gentzen System for the Propositional Logic

The Gentzen system for the propositional logic is a deduction system which is logically equivalent to the corresponding axiomatic system. In the Gentzen system, the validity and provability of a sequence Γ ⇒ Δ are considered. The validity(⊨) corresponds to the provability(⊢). In this paper, we propose the variant Gentzen system which is a dual-system of the Gentzen system. A co-sequence Γ|Δ is introduced, and the variant Gentzen system is defined such that the satisfiability(⊨^co) of the co-sequence corresponds to the provability(⊢^co) of it. And another dual-Gentzen system is given such that the unsatisfiable of the co-sequence corresponds to the provability. The soundness and the completeness theorems of the both system are proved.

The B4-valued propositional Belnap-Dunn logic1

A B4-valued propositional Belnap-Dunn logic will be proposed in this paper which there are two unary connectives [ ], [⊥] to represent the two middle values , ⊥, respectively, and a Gentzen-typed deduction system will be given so that the system is sound and complete with the four-valued semantics of the propositional Belnap-Dunn logic.

A General Approach to Extracting Full Names and Abbreviations for Chinese Entities from the Web

Identifying Full names/abbreviations for entities is a challenging problem in many applications, e.g. question answering and information retrieval. In this paper, we propose a general extraction method of extracting full names/abbreviations from Chinese Web corpora. For a given entity, we construct forward and backward query items and commit them to a search engine (e.g. Google), and utilize search results to extract full names and abbreviations for the entity. To verify the results, filtering and marking methods are used to sort all the results. Experiments show that our method achieves precision of 84.7% for abbreviations, and 77.0% for full names.