A programmable approach to maintenance of a finite knowledge base

In this paper,we present a programmable method of revising a finite clause set.We first present a procedure whose formal parameters are a consistent clause set Γand a clause A and whose output is a set of minimal subsets of Γwhich are inconsistent with A.The maximal consistent subsets can be generated from all minimal inconsistent subsets.We develop a prototype system based on the above procedure,and discuss the implementation of knowledge base maintenance.At last,we compare the approach presented in this paper with other related approaches,The main characteristic of the approach is that it can be implemented by a computer program.     

Renaming a set of non-Horn clauses

Several extensions of the logic programming language Prolog to nonHorn clauses use case analysis to handle non-Horn clauses.In this paper,analytical and emprirical evidences are presented to show that,by making a set of clauses less “non-Horn“ using predicated renaming.the performance of these case-analysis based procedures can be improved significantly.In addition,the paper also investigated the problem of efficeiently constructing a predicate renaming that reduces the degree of “non-Hornness“ of a clause set maximally.It is shown that this problem of finding a redicate renaming to achieve minimal “non-Hornness“ is NP -complete.     

Formalization of correctness of recursive definitions

We use the fixpoint approach to formalize the correctness of recursive definitions within the framework of first-order predicate calculus. Although the least fixpoint semantics is used, our results suggest some general methods of proving the correctness of recursive definitions without knowing their least fixpoints explicitly.     

On the strict logic foundation of fuzzy reasoning

This paper focuses on the logic foundation of fuzzy reasoning. At first, a new complete first-order fuzzy predicate calculus system K^* corresponding to the formal system L^* is built. Based on the many-sort system K_ms^* corresponding to K^*, the triple I methods of FMP and FMT for fuzzy reasoning and their consistency are formalized, thus fuzzy reasoning is put completely and rigorously into the logic framework of fuzzy logic.The author is indebted to anonymous referee for his useful comments which have helped to improve the paper.     

Deep Web查询接口选择

越来越多的信息隐藏在Web查询接口之后，在此情况下如何寻找与用户查询最相关的数据源接口就变得越来越重要。文中提出了一种Deep Web查询接口选择算法，该算法是完全依赖于查询接口特征的。给定大量异构的Deep Web数据源，目标是选择与用户查询最相关的查询接口集。通过对实际查询接口特征的观察，发现了查询接口上谓词间的相关性。基于此发现，设计了一种基于共同出现谓词相关度模型的数据源选择算法，用于选择与用户查询最相关的查询接口集。     

基于Visual Prolog 6.3内核的专家系统实现

针对目前构建专家系统开发环境的局限性造成开发周期长的问题,提出了利用传统语言调用逻辑程序设计语言的动态链接库构建专家系统的方法,通过两类语言优势互补,实现高效开发专家系统。详细论述了Visual Prolog 6.3动态链接库的生成过程、调用方式、调用约定以及编码转换,并介绍了利用VB.net如何调用Visual Prolog 6.3生成的动态链接库构建专家系统。通过实例验证了该方法的可行性,并具有良好的应用前景。     

XSIEQ-一种立即计算的XML流查询系统

XSIEQ是一种立即计算谓词并即时输出的XML流查询系统．它利用前缀共享的方法由多个XPath式构造一个NFA，并对NFA状态进行分类和添加索引．使得在运行时能快速确定谓词计算和数据缓存等的时机，XSIEQ还提供在运行时惰性地构造DFA进行查询．陈述了XSIEQ的查询机制以及多重匹配问题的解决方案，最后给出了XSIEQ的两种自动机和YFilter的查询性能对比及分析．     

谓词逻辑在人工智能中的应用

谓词逻辑是一种基于谓词分析的高度形式化的语言及其推理,是人工智能产生和发展的最重要的理论基础。本文从具体事例出发,解析了谓词逻辑在人工智能领域中两个主要应用:知识表示和消解原理。并在结束语提出谓词逻辑的局限,希望有更多的学者参加逻辑学的研究。     

Software watermarking via opaque predicates: Implementation,analysis, and attacks

Within the software industry software piracy is a great concern. In this article we address this issue through a prevention technique called software watermarking. Depending on how a software watermark is applied it can be used to discourage piracy; as proof of authorship or purchase; or to track the source of the illegal redistribution. In particular we analyze an algorithm originally proposed by Geneviève Arboit in A Method for Watermarking Java Programs via Opaque Predicates. This watermarking technique embeds the watermark by adding opaque predicates to the application. We have found that the Arboit technique does withstand some forms of attack and has a respectable data-rate. However, it is susceptible to a variety of distortive attacks. One unanswered question in the area of software watermarking is whether dynamic algorithms are inherently more resilient to attacks than static algorithms. We have implemented and empirically evaluated both static and dynamic versions within the SandMark framework. This work is supported by the NSF under grant CCR-0073483, by the AFRL under contract F33615-02-C-1146, and the GAANN Fellowship. Ginger Myles is currently a research scientist at IBM’s Almaden Research Center and is finishing her Ph.D. degree in computer science at the University of Arizona. She received a B.A. in mathematics from Beloit College in Beloit, Wisconsin and an M.S. in computer science from the University of Arizona. Her research focuses on all aspects of content protection. Christian Collberg received his PhD from the Department of Computer Science at the University of Lund, Sweden, after which he was on the faculty at the University of Auckland, New Zealand. He is currently an Associate Professor at the University of Arizona. His primary research area is the protection of software from reverse engineering, tampering, and piracy. In particular, the SandMark tool (sandmark.cs.arizona.edu) developed at the University of Arizona is the premier tool for the study of software protection algorithms.     

一阶模糊谓词逻辑公式的有限解释真度和可数解释真度的理论及其应用

通过引进公式变元集赋值的新概念给出了一阶模糊谓词逻辑（或一阶模糊语言）公式的有限解释真度及可数解释真度的定义,并讨论了它们的一系列性质及其在近似推理中的应用,从而为一阶谓词逻辑的近似推理理论提供了一种带度量的框架.