The problem of finding a semantic strategy for focusing inference rules

This article is the fifteenth of a series of articles discussing various open research problems in automated reasoning. Here we focus on finding a strategy — other than a simple syntactic one — that can be used for focusing the attention of the inference rule(s) in use. The problem proposed for research asks one to find semantic criteria for selecting the clauses needed to complete the application of an inference rule. Suggestions for test problems are included. We note that Yuan Yu has solved two of these problems using a rather different approach with the Boyer-Moore theorem prover; his work is reported elsewhere in this issue of the Journal of Automated Reasoning.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract W-31-109-Eng-38.     

The problem of choosing between using and avoiding equality predicates

This article is the twentieth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find criteria for effectively choosing between using and avoiding equality predicates. Since there exist inference rules (such as paramodulation) that enable an automated reasoning program to treat equality as understood, the discovery of such criteria would mark an important advance for the field. For evaluating a proposed solution to this research problem, we suggest possible test problems from group theory, ring theory, and Boolean algebra.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract W-31-109-Eng-38.     

The problem of choosing between predicate and function notation for problem representation

This article is the sixteenth of a series of articles discussing various open research problems in automated reasoning. Here we focus on choosing between the use of predicates and the use of functions for representing information to an automated reasoning program. The problem proposed for research asks one to find criteria that dictate the most effective choice of notation-functions or predicates-for presenting the question to be studied. The criteria must reflect the close coupling between inference rule, strategy, and representation. We suggest possible test problems for evaluating a proposed solution to this research problem.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract W-31-109-Eng-38.     

The problem of reasoning from inequalities

This article is the twenty-first of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find an inference rule that performs as paramodulation does, but with the focus on inequalities rather than on equalities. Since, too often, inequalities that are present in the input play a passive role during a reasoning program's attempt to complete an assignment, such an inference rule would markedly add to program effectiveness by giving inequalities the potential of playing a key role. For evaluating a proposed solution to this research problem, we suggest as possible test problems theorems from group theory and theorems from ring theory. This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract W-13-109-Eng-38.     

The problem of finding an inference rule for set theory

This article is the ninth of a series of articles discussing various open research problems in automated reasoning. Here we focus on finding an inference rule for set theory. The problem proposed for research asks one to find a means for building in set-theoretic reasoning in a manner similar to the way paramodulation builds in equality-oriented reasoning. For evaluating a proposed solution to this research problem, we include suggestions concerning possible test problems.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38.     

分层格值命题逻辑系统中几类推理规则的讨论

在基于格值逻辑的不确定性推理的研究中,推理规则的选取是其重要研究内容之一。基于分层格值命题逻辑系统,提出了几类既包含有语义又含有语法的推理规则,且这些推理规则具备协调水平的特性;同时也证明了这几类推理规则在一定程度上有闭性。     

The problem of hyperparamodulation and nuclei

This article is the thirty-third of a series of articles discussing various open research problems in automated reasoning. The problem for research asks one to establish criteria for allowing certain — but not all — new clauses to become nuclei when using the inference rule hyperparamodulation or hyperresolution.This work was supported by the Office of Scientific Computing, U.S. Department of Energy, under Contract W-31-109-Eng-38.     

The problem of choosing the inference rule to employ

This article is the second of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research focuses on finding criteria or metarules for choosing the inference rule(s) to be employed by the automated reasoning program in use when instructing the program to complete a specific assignment. We include actual experiments that illustrate the difficulty of making an appropriate choice.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38.     

TRADE‐OFF BETWEEN APPROXIMATION ACCURACY AND COMPLEXITY FOR TS FUZZY MODELS

This paper proposes a transformation method that serves the trade‐off between the modelling complexity and accuracy of multi‐variable Takagi‐Sugeno fuzzy inference operator‐based modelling (TS fuzzy modelling). The relation between the number of fuzzy rules and the modelling accuracy is defined in the paper. The proposed transformation method is capable of finding the minimal number of fuzzy rules for a given accuracy of a given TS fuzzy model. A case study, focusing on a benchmark problem of fault diagnosis, developed in the framework of EC‐founded Research Training Network DAMADICS, of an actuator in a sugar factory, is presented to provide feasibility of the proposed method.     

Parallel inference in dynamic decision support systems of a semiotic type

The organization of parallel inference in dynamic decision support systems (DDSS) of a semiotic type, oriented towards a solving of ill-formed problems in dynamic applied domains, is considered. As a knowledge representation model, there are used production rules reflecting expert knowledge about a problem domain, an environment and decision making processes. The main concepts and assertions defining possibility and impossibility of parallel executing the production rules are given. Several types of parallelism in an inference process are introduced. The corresponding algorithm of parallel inference is described. Thus, the purpose of this paper is to develop and to research parallel inference methods and procedures that provide efficient processing a large amount of production rules for DDSS of a semiotic type.     

改进的模糊推理规则图像边缘检测算法

图像边缘检测是数字图像处理领域的关键技术,边缘检测的结果决定了图像后续处理的质量。模糊推理规则边缘检测算法具有较强的边缘检测能力,并且具备一定的抗噪效果。但是,这种算法只在高斯噪声较小时有效,当高斯噪声较大时它的边缘检测效果甚至比Canny等算子的效果还差。针对模糊推理规则算法在强高斯噪声时效果较差的问题,提出一种改进的模糊边缘检测算法。该算法能够根据图像含噪情况调整边缘检测方案：当噪声较弱时,使用模糊推理规则边缘检测算法;当噪声较强时,为提高算法抑制噪声的能力,使用改进的模糊推理规则边缘检测算法。实验结果表明,该方法具有更好的抗噪性能和边缘检测能力。     

Fuzzy truck control scheme for obstacle avoidance

The fuzzy system can be a good solution when a mathematical model of the system is either unavailable or too complex. Truck backer-upper control problem is one example of a standard highly nonlinear control problem. Bearing this in mind the control scheme that considers obstacles near the truck is much more complex than other conventional approaches. In this paper a fuzzy truck control system for obstacle avoidance, using newly designed 33 fuzzy inference rules for steering control and 13 rules for speed control, is proposed. Through simulations of various real world situations, we observed that the proposed fuzzy controller could drive the truck to the goal smoothly while avoiding the obstacles, and showed a reasonably good trajectory. This flexible and applicable fuzzy control logic can be adapted to provide easy interaction with the driver for state-of-the-art intelligent cruise control systems.     

一种分层递阶的定性拓扑推理方法

文章针对现有的定性表示方法和拓扑推理算法存在的问题,提出了一种新的方法.首先,提出了基于概念邻域结构的定性表示方法.然后,给出了不同粒度层次上拓扑关系复合表的计算方法.最后,设计得出分层递阶的拓扑推理算法.文章给出的方法具有较高的认知合理性,所提出的推理算法可根据问题来选择合适的表示和推理层次,在已有推理算法给不出解的情况下,可以给出问题的合理解,对一般定性推理研究有参考价值.     

The problem of choosing the representation,inference rule,and strategy

This article is the nineteenth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find guidelines for simultaneously choosing the most effective representation, inference rule, and strategy. Since the three areas are tightly coupled, formulation of such guidelines requires understanding the precise nature of this coupling. For evaluating a proposed solution to this research problem, we suggest possible test problems from group theory, Gödel's finite axiomatization of set theory, and program verification.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract W-31-109-Eng-38.     

A NOTE ON STRUCTURAL INFERENCE IN SYSTEMS THEORY

The paper deals with one of the main issues of systems theory, i.e. the relationship between the part and the whole. This issue is discussed within the framework of the structural inference. The problem of discovering those properties of systems that remain invariant under a given type of connection is considered. A solution of this problem is proposed for the parallel and serial connections of automata, due to an application of some appropriately formulated rules of the structural inference.     

模糊推理的合成规则及其合成运算的选择研究

本文首先提出当知识库中含有多条取自于同论域上的模糊推理规则时，应用通常的六条合成推理规则所推得的结论将随着模糊推理规则数的增多而越来越偏离真实度这一问题。本文针对该问题对通常的六条合成推理规则及其三角模下的六条推广合成推理规则进行了理论比较研究，并对合成运算进行了比较研究。研究表明：合成推理规则（或Ｒ￣４）以合成运算ｍａｘ－Ｔ０是克服上述问题的最佳选择。这一重要结果对于模糊知识库的设计具有指导意义。     

The problem of strategy and hyperresolution

This article is the thirty-first of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find a strategy that can be coupled with the inference rule hyperresolution to control the behavior of an automated reasoning program as effectively as does paramodulation.This work was supported by the Office of Scientific Computing, U.S. Department of Energy, under Contract W-31-109-Eng-38.     

The problem of naming and function replacement

This article is the twenty-eighth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find criteria that an automated reasoning program can profitably use to remove functions present in the representation and replace them with appropriate predicates or constants thatname the entities that werenamed by the functions. The notation used to present a problem to a reasoning program can have a profound effect on the likelihood of the program's success.This work was supported by the Office of Scientific Computing, U.S. Department of Energy, under Contract W-31-109-Eng-38.     

数据库推理通道的动态控制

数据库推理问题是数据库安全研究的重要组成部分,主要研究推理通道的检测方法和控制策略。该文提出一种动态控制推理通道的方法。该方法为每个推理通道建立一个标识集合,利用集合中元素和推理通道中对象的关联来控制查询的处理,使用户能灵活地访问数据但又得不到足够的信息来推理。与以前提出的方案不同,该方案保证了数据的最大可用性,同时有效地阻止推理并保持了快速的查询处理能力。     

Efficient Graph-Based Algorithms for Discovering and Maintaining Association Rules in Large Databases

In this paper, we study the issues of mining and maintaining association rules in a large database of customer transactions. The problem of mining association rules can be mapped into the problems of finding large itemsets which are sets of items brought together in a sufficient number of transactions. We revise a graph-based algorithm to further speed up the process of itemset generation. In addition, we extend our revised algorithm to maintain discovered association rules when incremental or decremental updates are made to the databases. Experimental results show the efficiency of our algorithms. The revised algorithm is a significant improvement over the original one on mining association rules. The algorithms for maintaining association rules are more efficient than re-running the mining algorithms for the whole updated database and outperform previously proposed algorithms that need multiple passes over the database. Received 4 August 1999 / Revised 18 March 2000 / Accepted in revised form 18 October 2000