面向概念的通用知识获取系统

本文提出的面向概念的知识获取系统是一个能理解基本逻辑和自然语言的通用知识获取环境。系统结合了人工智能(ai)、面向对象的程序设计(oop)和逻辑程序设计(Lp)等技术。系统以概念为知识基元,由概念描述器(cd)予以描述。cd是一个类框架和类对象 的结构,它由一组概念特性和属性,逻辑约束和函数式等支持。这些特性可由具体的应用而赋于实际的含义。知识库中的概念集是一个层次式的继承网络。另外系统还附有一些语义子系统,如一阶逻辑系统和简单的自然语言系统,用以各种类型的语法检查及知识的冗余、互斥及非一致性检查。系统主     

自然语言处理中的逻辑文法

逻辑文法是指用谓词逻辑来表达的文法。它属于计算语言学的范畴,是逻辑程序设计和现代语言学相结合的产物。在人工智能的自然语言处理等领域里,谓词逻辑通常用来描述知识和逻辑推理。70年代,逻辑用于程序设计的思想以Prolog语言的形式投入应用以来,谓词逻辑不再仅仅用于描述这些问题,还作为逻辑程序设计的工具去描述解决问题的过程。PROLOG语言使得逻辑和程序设计这     

ILP在语义Web数据挖掘研究中的应用

语义网络数据挖掘是基于语义网络环境的数据挖掘,它给数据挖掘技术的应用研究提出了新的课题.归纳逻辑程序设计是由机器学习与逻辑程序设计交叉所形成的一个研究领域,它为知识工程等人工智能的应用领域提供了新的强有力的技术支持.分析了现有几种常用数据挖掘技术在语义Web环境下应用的局限性,提出了采用归纳逻辑程序设计(ILP)作为语义Web上适合的数据挖掘技术,给出了应用这种技术的算法描述,通过具体实例验证了其可行性.     

知识推理描述语言MLND的归约实现模型RMND

本文主要描述采用归约式计算机体系结构来支持知识推理描述语言MLND中函数式和逻辑式风格结合的程序设计,内容包括MLND的概要,基语言设计,系统运行和功效分析等。     

逻辑模拟智能教学写作环境的研究

基于智能教学系统(ITS)模型,本文将数字系统自动化设计逻辑模拟的抽象级概念、描述工具及模拟算法等问题引入到计算机辅助教学研究领域,在对逻辑模拟教学环境进行分析的基础上,提出了一个由辅助教学系统写作环境支持下设计ITS教学策略、实现领城知识表示的方法,并将逻辑模拟ITS写作环境定义为二元组AE=(T,R),进而讨论了逻辑描述、逻辑图构造、指令负载描述、操纵逻辑模型运行的模拟机制以及为获取模型相关组织说明的学习机制的设计等问题。     

ILP在语义Web数据挖掘研究中的应用

语义网络数据挖掘是基于语义网络环境的数据挖掘,它给数据挖掘技术的应用研究提出了新的课题。归纳逻辑程序设计是由机器学习与逻辑程序设计交叉所形成的一个研究领域,它为知识工程等人工智能的应用领域提供了新的强有力的技术支持。分析了现有几种常用数据挖掘技术在语义Web环境下应用的局限性,提出了采用归纳逻辑程序设计(ILP)作为语义Web上适合的数据挖掘技术,给出了应用这种技术的算法描述,通过具体实例验证了其可行性。     

一种用于基于知识系统开发的形式化模型*

LKo是一个将面向对象和逻辑范型相结合，用于基于知识系统的形式化开发模型，其中逻辑对象是集状态、约束、行为、继承于一体的抽象实体．它支持框架、规则、语义网络、黑板等多种知识表示，因而可用来形式地描述基于知识系统的需求规范．在知识获取过程中通过对形式规范反复地修改、验证及确认而形成软件原型．     

专家系统的建造与知识表达——~(13)C NMR推断香茶菜二萜化合物结构的专家系统

XCC(Xiang Cha Cai-香茶菜)专家系统是用于推理香茶菜属二萜类化合物结构的智能软件系统。该系统已经在IBM-PS/280上实现,程序设计是用Turbo PROLOG 1.1。本文主要描述XCC专家系统的建造与知识表达。从问题定义、知识抽象、知识概念及形式化到知识表达方法都做了详细论述。     

基于知识的可重用构件查询系统KCQ

本文提出了一个基于知识的、支持面向对象程序设计方法的软件重用构件查询系统，本系统采用了语义网络知识表示模型，提供了构件知识表示语言ＣＫＲＬ，来描述可重用构件的特征和用于检索的知识．提供了语义网络联想式查询、条件查询和构件评价．     

基于描述逻辑的策略系统建模方法研究

采用基于策略的方法对安全管理,服务质量等进行监管,已经得到广泛应用.描述逻辑是一种基于对象的知识表示形式.本文提供了一种基于描述逻辑的策略系统建模方式,将策略定义为两种类型,即授权策略和义务策略.根据其性质特点建立主体、客体、角色、动作、事件、约束条件等概念,结合概念之间的关系,最终得到基于描述逻辑的策略系统模型.借助描述逻辑的推理技术,可以对策略系统模型进行分析.并举例说明了这种基于描述逻辑的策略规格方法.     

Intelligent Fril/SQL interrogator

The intelligent Fril/SQL interrogator is an object‐oriented and knowledge‐based support query system, which is implemented by the set of logic objects linking one another. These logic objects integrate SQL query, support logic programming language—Fril and Fril query together by processing them in sequence in slots of each logic object. This approach therefore takes advantage of both object‐oriented system and a logic programming‐based system. Fuzzy logic data mining and a machine learning tool kit built in the intelligent interrogator can automatically provide a knowledge base or rules to assist a human to analyze huge data sets or create intelligent controllers. Alternatively, users can write or edit the knowledge base or rules according to their requirements, so that the intelligent interrogator is also a support logic programming environment where users can write and run various Fril programs through these logic objects. © 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 279–302, 2007.     

一个基于逻辑程序设计范例的专家数据库开发工具

ＧＫＤ－ＥＤＳＴ是一个集成型专家数据库系统开发工具,本文着重介绍该工具的设计思想与实现方法。     

USING META-PROGRAMMING,CONSTRAINT LOGIC PROGRAMMING AND APPROXIMATE REASONING FOR EXPERT SYSTEMS DESIGN

Abstract

This paper presents an enhancement of the CARESS system—A Constraint Approximative Reasoning System Support—introduced in (Popescu and Roventa, 1994). CARESS is an experimental system with primarily two objectives:

(1)knowledge representation and manipulation techniques and to implement them in PROLOG III, and

(2) to develop a knowledge programming environment for building expert systems. We discuss here the use of meta-programming, constraint logic programming and approximate reasoning for the design of expert systems

It has already been proven that meta-programming and logic programming are powerful techniques for expert system design. Fuzzy logic can be used to model one kind of uncertainty. Constraint logic programming is useful for dealing with the constraints given by operations using fuzzy sets.     

Odyssey: A knowledge-based assistant

We describe an investigation into the representation and use of task domain knowledge to assist with the acquisition of data in an office information system. In particular, a demonstration system called Odyssey is described which assists with the filling out of a collection of electronic forms in the preparation for a business trip. The system uses knowledge about trip planning to maintain consistency of the acquired data, infer additional values and data base records, reformat field entries on the forms, correct spelling errors, etc. We discuss the ‘frame oriented’ style of programming used to design and implement Odyssey that combines ‘frame-structured’ knowledge representation and ‘object oriented’ programming. We focus on the problems involved with allowing the user at any time to enter or change information in any of the forms. A dependency maintenance facility is described that deals with those problems by allowing the application of domain knowledge to data whenever it enters the data base, and the removal of derived results whenever the data used in the derivation is removed or changed.     

一种基于PC机的高速16位并行数据采集接口

介绍了一种在PC机上实现的高速16位并行数据采集接口。该接口由高速光电隔离电路,双端口FIFO存储缓冲器电路及由FPGA芯片构成的计算机接口逻辑与控制电路等组成。该接口电路将终端显示处理系统与前端数据处理系统通过光电耦合器隔离开来,避免了它们之间的相互干扰,较好地解决了16位并行数据高速传输中存在的电磁干扰问题和大数据量实时有效传输问题。采用现场可编码门阵列FPGA芯片,使硬件设计软件化,既实现了复杂逻辑功能设计,又减少了硬件电路规模,提高了系统的可靠性,在雷达、声纳等复杂系统中具有良好的应用价值。     

External sources of knowledge and value invention in logic programming

The issue of value invention in logic programming embraces many scenarios, such as logic programming with function symbols, object oriented logic languages, inter-operability with external sources of knowledge, or set unification. This work introduces a framework embedding value invention in a general context. The class of programs having a suitable (but, in general, not decidable) ‘finite grounding property’ is identified, and the class of ‘value invention restricted’ programs is introduced. Value invention restricted programs have the finite grounding property and can be decided in polynomial time. They are a very large polynomially decidable class having this property, when no assumption can be made about the nature of invented values (while this latter is the case in the specific literature about logic programming with function symbols). Relationships with existing formalisms are eventually discussed, and the implementation of a system supporting the class of such programs is described.