一种知识库校验工具PKBV的设计与实现

以Petri网建模基于规则的知识库,并据此开发出知识库校验工具PKBV,该工具通过对Petri网可达性及不变量的分析计算,来检查知识库中常见的完整性与一致性错误,针对具有多领域知识库的复杂系统,PKBV具有抽取多领域知识库之间的关联规则并进行校验的功能,满足了复杂知识系统的校验需求。     

Verification of Knowledge-Based Systems Using Predicate/Transition Nets

As expert-system technology gains broader acceptance, the need to build and maintain large-scale knowledge-based systems (KBSs) will assume greater importance. Traditional approaches to KBS verification generally contain no predicate/transition (PrT) net models, thus making them slow for the large-scale KBS with chained errors. This paper proposes an attractive alternative to KBS verification, in which the KBS is modeled as a PrT-net model. Then, the least fixpoint semantics of the PrT-net model can be introduced into the KBS for the purpose of speeding up the computations of the KBSs. The significance of this paper is that seven propositions are formulated to detect errors of redundancy, subsumption, unnecessary condition, circularity, inconsistency, dead end, and unreachable goal. Thus, the performance of a computer-aided-design tool for KBSs can be improved to some extent. Meanwhile, specification languages, including Programming in Logic, Frame-and-Rule-Oriented Requirements Specification Language, and the like, are suitable to this approach.     

Knowledge acquisition and knowledge representation with class: the object-oriented paradigm

Knowledge acquisition and knowledge representation are the fundamental building blocks of knowledge-based systems (KBSs). How to efficiently elicit knowledge from experts and transform this elicited knowledge into a machine usable format is a significant and time consuming problem for KBS developers. Object-orientation provides several solutions to persistent knowledge acquisition and knowledge representation problems including transportability, knowledge reuse, and knowledge growth. An automated graphical knowledge acquisition tool is presented, based upon object-oriented principles. The object-oriented graphical interface provides a modeling platform that is easily understood by experts and knowledge engineers. The object-oriented base for the automated KA tool provides a representation independent methodology that can easily be mapped into any other object-oriented expert system or other object-oriented intelligent tools.     

一个领域自然语言理解的知识获取工具的设计实现

本文介绍了一个基于知识的自然语言理解系统和系统的知识库中知识的表示模式,描述了知识库中领域过程树的知识获取过程。根据领域过程树的知识表示模式,本文设计并实现了一个知识获取工具,很好地提高了领域过程树知识获取的速度和准确度。     

Verifying ontological commitment in knowledge-based systems

An ontology defines the terminology of a domain of knowledge: the concepts that constitute the domain, and the relationships between those concepts. In order for two or more knowledge-based systems to interoperate—for example, by exchanging knowledge, or collaborating as agents in a co-operative problem-solving process—they must commit to the definitions in a common ontology. Verifying such commitment is therefore a prerequisite for reliable knowledge-based system interoperability. This article shows how existing knowledge base verification techniques can be applied to verify the commitment of a knowledge-based system to a given ontology. The method takes account of the fact that an ontology will typically be expressed using a different knowledge representation language to the knowledge base, by incorporating translation into the verification procedure. While the representation languages used are specific to a particular project, their features are general and the method has broad applicability.     

Parallel model representations

Most mathematical programming models and knowledge-based systems in optimization from exist in various representations; however, the user is frequently not aware of this. For example, a model which is developed with a knowledge-based system such as the PM system of Krishnan (1988) will have several representations in Prolog and then will be translated into another representation in Structured Modeling before it is solved. Also, a model which is developed in the GAMS language will be translated into an MPS input form internally before the problem is passed to a solver such as MINOS. The results from MINOS are then passed back to GAMS and the user sees the results in the style of the GAMS representation of the model. This could be called a vertical set of model representations since the user can modify only one representation and the models are passed down directly to the solver.

This paper argues that in considering knowledge-based systems with optimization we should begin to employ a set of parallel model representations, any one of which the user can see and modify. These can be called horizontal model representations. For example, a given model might be represented in graphical, knowledge base, modeling language, and mathematical forms. The user would be able to modify any of these versions and have the other representations altered automatically to reflect the changes.     

智能网络管理中一种基于Petri网的知识验证技术

知识库是智能网络管理系统中的重要组成部分,知识库的维护要求知识库系统必须具备知识的验证功能。智能网管系统中知识组织的动态性决定了知识的结构性验证必须正确、有效和及时。本文以有色Petri网为基础,针对智能网管系统中知识验证的主要内窝,以一种扩充的有色Petri网作为描述和分析工具,建立了相应的知识表示模型和知识验证模型,提出了一种简洁的、基于有色Petri网的知识验证方法,并给出了相应的判定准则。     

SDSS中空间知识库系统模型的设计

提出并实现了一个适用于智能化空间决策支持系统（SDSS）的空间知识库系统模型。在本知识库系统模型上，知识表示采用一阶谓词逻辑和案例两者相结合的方式，对于不同的知识表示方式，实现了相应的知识推理机制及相互间的切换，在此基础上，还设计实现了对案例知识的学习与获取方法。     

USING REENGINEERING FOR KNOWLEDGE-BASED SYSTEMS

Reverse engineering, also called reengineering, is used to modify systems that have functioned for many years, but which can no longer accomplish their intended tasks and, therefore, need to be updated. Reverse engineering can support the modification and extension of the knowledge in an already existing system. However, this can be an intricate task for a large, complex and poorly documented knowledge-based system. The rules in the knowledge base must be gathered, analyzed and understood, but also checked for verification and validation. We introduce an approach that uses reverse engineering for the knowledge in knowledge-based systems. The knowledge is encapsulated in rules, facts and conclusions, and in the relationships between them. Reverse engineering also collects functionality and source code. The outcome of reverse engineering is a model of the knowledge base, the functionality and the source code connected to the rules. These models are presented in diagrams using a graphic representation similar to Unified Modeling Language and employing ontology. Ontology is applied on top of rules, facts and relationships. From the diagrams, test cases are generated during the reverse engineering process and adopted to verify and validate the system.     

A knowledge based system for the integrated design and manufacture of round broach tools

A complete knowledge based procedure for the design and manufacture of a round hole broach tool is described. The knowledge based design system (KBDS) produces a tool specification from user inputs describing the task to be performed. These design results are then used by the knowledge base to generate a geometric CAD/CAM representation, which can be utilized directly to display a drawing of the tool or to generate a CNC program for producing it. The process of formulating a knowledge-based design system demonstrates: the integration of expertise from experts, handbooks and theory; the awareness of restrictions on the scope of design that can be handled by a given system: the use of failure handling mechanisms to detect design failures and either adjust the emerging design or indicate infeasibility.     

A high-level Petri nets-based approach to verifying task structures

As knowledge-based system technology gains wider acceptance, there is an increasing need to verify knowledge-based systems to improve their reliability and quality. Traditionally, attention has been given to verifying knowledge-based systems at the knowledge level, which only addresses structural errors such as redundancy, conflict and circularity in rule bases. No semantic errors (such as inconsistency at the requirements specification level) have been checked. In this paper, we propose the use of task structures for modeling user requirements and domain knowledge at the requirements specification level, and the use of high-level Petri nets for expressing and verifying the task structure-based specifications. Issues in mapping task structures onto high-level Petri nets are identified, e.g. the representation of task decomposition, constraints and the state model; the distinction between the "follow" and "immediately follow" operators; and the "composition" operator in task structures. The verification of task structures using high-level Petri nets is performed on model specifications of a task through constraint satisfaction and relaxation techniques, and on process specifications of the task based on the reachability property and the notion of specificity     

从经典逻辑知识构建ASP知识库的新方法

回答集程序设计(ASP)是一种主流的非单调知识表示工具。为了能够在利用ASP求解问题过程中使用现有的以经典逻辑表示的知识,给出了一种把以谓词逻辑公式表示的约束型知识和定义型知识转化为ASP程序或知识库的新方法,并以实例说明了其有效性。该方法满足转化后ASP程序的回答集与原公式集的模型具有一一对应关系。在实际应用中,该方法提供了一项从现存的以谓词逻辑为表示语言的知识库,构建以ASP为知识表示语言的非单调知识库的技术。     

Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems

This paper presents some results of integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems. The intention of this research is to use predicate transition nets as a specification method and to use first order temporal logic as a verification method so that their strengths — the easy comprehension of predicate transition nets and the reasoning power of first order temporal logic can be combined. In this paper, a theoretical relationship between the computation models of these two formalisms is presented; an algorithm for systematically translating a predicate transition net into a corresponding temporal logic system is outlined; and a special temporal refutation proof technique is proposed and illustrated in verifying various concurrent properties of the predicate transition net specification of the five dining philosophers problem.     

Foundation and application of knowledge base verification

Anomalies such as redundant, contradictory, and deficient knowledge in a knowledge base are symptoms of probable errors. Detecting anomalies is a well-established method for verifying knowledge-based systems. Although many tools have been developed to perform anomaly detection, several important issues have been neglected, especially the theoretical foundations and computational limitations of anomaly detection methods, and analyses of the utility of such tools in practical use. This article addresses these issues by presenting a theoretical foundation of anomaly detection methods, and by presenting empirical results obtained in applying one anomaly detection tool to perform verification on five real-world knowledge-based systems. the techniques presented apply specifically to verifying rule-based knowledge bases without numerical certainty measures. © 1994 John Wiley & Sons, Inc.