A New Method for Reasoning about Action

Reasoning about action is an important aspect of common sense reasoning and planning.It gives rise to three classical problems:the frame problem,the qualification problem and the ramification problem.Existing approaches cannot deal with these problems efficiently.This paper presents a new method which uses the stratified ATMS for reasoning about action to overcome the limitations of these approaches.     

非单调推理的研究现状

一、引言 早在1959年,McCart~[1]就发现常识和常识推理很难处理,因为在常识推理中当前得出的结论,可能会由于以后新事实的加入而被取消.这就是所谓的“非单调性”。     

基于非单调推理的领域专家知识库的研究

1.知识表示及推理概况知识库在人工智能研究中占有重要地位。Gins-berg等人介绍了多种知识库更新方法,其中一类是基于模型的方法,一类是基于公式的方法,但所有这些方法在通常情况下都是难解的(intractable)。对基于模型的方法,Eiter指出,当知识库是Horn公式的集合,新知识是Horn公式且长度有一常数上界时,存在多项式时间算法。马绍汉提出一类树型知识库的更新算法,在树型的束图智能方式表示下,该算法通过一个自底向上的过程,得到更新后的知识库。确定推理的研究是基于经典的二值逻辑,因而,具有相当牢固的基础,而不确定推理的研究却是另一种情形。不确定推理的基础比确定推理的基础要弱得多。到目前为止,甚至还没有获得人们普遍接受的基础。不确定推理面对下面几个问题:(1)如何正确地、定性地刻画一个命题的不确定性?(2)如何适当地度量一个命题的不确定性?     

基于标记逻辑的非单调推理（II）

本文研究不循环ＡＬＰ的说明语义，利用依赖关系的非自反应性，把程序的Ｈｅｒｂａｒａｎｄ基分类成一系列不相交集合，在此基础上，引进多重极限的概念，并证明，不循环程序存在唯一的支持模型，该模型就是程序的ｋ重极限，其中ｋ是程序中自由子句的个数。     

ATMS的模型论基础

本文将每个ＡＴＭＳ Ｋ转化为一阶语言ＬＫ的模型ＭＫ，模型ＭＫ是语言ＬＫ的一阶理论ＴＫ的模型，应用非单调推理理论中的谓词限定的技巧，可以构造出ＬＫ的理论ＴＫ＾ＰＣ，使得ＭＫ是ＴＫ＾ＰＣ的唯一模型。同时，语言ＬＫ还包含关系符号ξ，使得对每个ｎ，｛Ｅ│ＭＫ│＝ｎξＥ｝是ｎ相对于ＡＴＭＳ Ｋ的标号。     

可废除推理研究

非单调推理是针对常识推理而提出的,但是标准非单调逻辑都存在可计算性问题,如何提出一种     

利用XML和JDOM实现ATMS

利用XML结构与语义自描述的特性,结合JDOM对XML文件操作的清晰性和简便性,实现了基于假设的真值维护系统(ATMS)的基本结构的表示和标记更新算法,并提供了问题求解器的接口以便将其扩充成一个完整的推理系统。     

THE LazyRMS: AVOIDING WORK IN THE ATMS

The basic algorithms involved in reason maintenance in the standard ATMS is known to have a computational complexity that is exponential in the worst case. Yet, also in average-case problem solving, the ATMS often lays claim to a major part of the computational effort spent by a problem solver/ATMS system. In this paper, we argue that within the limits of the worst-case computational complexity, it is possible to improve on the average-case complexity of reason maintenance and query processing by eliminating computation that is of no relevance to the problem solver's performance. To this purpose, we present a set of algorithms designed to control the effort spent by the ATMS on label updating. The basic idea underlying these algorithms is that of lazy evaluation: labels are not automatically maintained on all datums but are computed only when needed (either directly or indirectly) by the problem solver. The algorithms have been implemented in the LazyRMS with which we have experimented in the context of model-based diagnosis; our experiments show a substantial saving in the computational effort spent on reason maintenance.     

基于ATMS和证据理论的不确定性推理方法

本文提出了一种新的不确定性推理方法ＨＵＩＭ．这种方法把基于假设的真值维持系统（ＡＴＭＳ）和Ｄｅｍｐｓｔｅｒ—Ｓｈａｆｅｒ的证据理论有机地结合在一起，使得ＡＴＭＳ这种符号代数系统可用来处理以数值形式表示的不确定性信息．将该方法应用于基于规则的系统，可以弥补这类系统在不确定性推理方面所存在的某些不足．     

ATMS在计算机辅助中医诊断中的应用*

计算机辅助诊断是当前人工智能和信息技术研究的热点之一。针对计算机辅助中医诊断的特殊性,结合ATMS这一人工智能推理系统,以脾虚证的计算机辅助诊断研究为契机,讨论了运用ATMS进行中医辅助诊断规则的表示、挖掘、查询和更新的问题。     

Generalized resolution for 0–1 linear inequalities

We show how the resolution method of theorem proving can be extended to obtain a procedure for solving a fundamental problem of integer programming, that of finding all valid cuts of a set of linear inequalities in 0-1 variables. Resolution generalizes to two cutting plane operations that, when applied repeatedly, generate all strongest possible or prime cuts (analogous to prime implications in logic). Every valid cut is then dominated by at least one of the prime cuts. The algorithm is practical when restricted to classes of inequalities within which one can easily tell when one inequality dominates another. We specialize the algorithm to several such classes, including inequalities representing logical clauses, for which it reduces to classical resolution.Supported in part by Air Force Office of Scientific Research, Grant number AFOSR-87-0292.     

标记模态归结的推广

本文将作者提出的高效的命题模态Ｄ逻辑的标记模态归结方法推广到了命题模态逻辑Ｋ,Ｋ４,Ｄ４,Ｔ,Ｓ４系统,建立了上述命题模态逻辑的标记归结形式系统ＭＲＫ,ＭＲＫ４,ＭＲＤ４,ＭＲＴ,ＭＲＳ４,并用转移子句模式的方法,借助于标记模态归结对命题模态Ｄ逻辑的可靠性结果,证明了标记模态归结系统ＭＲＫ,ＭＲＫ４,ＭＲＤ４,ＭＭＲＴ,ＭＲＳ４分别关于命题模式逻辑Ｋ,Ｋ４、Ｄ４,Ｔ,Ｓ４的可靠性,进而得到了它们的     

基于模糊逻辑的指纹滤波器参数选择

滤波器参数的选择是指纹图像增强中最为关键的一步。本文根据指纹图像的特性,分别定义了反映指纹脊线局部特征的曲率、对称性和笔直性这三个概念,并在此基础上提出了利用模糊逻辑选择滤波器参数的方法,实验表明了算法的有效性。