Universal triple I fuzzy reasoning algorithm of function model based on quotient space

Aiming at the deficiencies of analysis capacity from different levels and fuzzy treating method in product function modeling of conceptual design,the theory of quotient space and universal triple I fuzzy reasoning method are introduced,and then the function modeling algorithm based on the universal triple I fuzzy reasoning method is proposed.Firstly,the product function granular model based on the quotient space theory is built,with its function granular representation and computing rules defined at the same time.Secondly,in order to quickly achieve function granular model from function requirement,the function modeling method based on universal triple I fuzzy reasoning is put forward.Within the fuzzy reasoning of universal triple I method,the small-distance-activating method is proposed as the kernel of fuzzy reasoning;how to change function requirements to fuzzy ones,fuzzy computing methods,and strategy of fuzzy reasoning are respectively investigated as well;the function modeling algorithm based on the universal triple I fuzzy reasoning method is achieved.Lastly,the validity of the function granular model and function modeling algorithm is validated.Through our method,the reasonable function granular model can be quickly achieved from function requirements,and the fuzzy character of conceptual design can be well handled,which greatly improves conceptual design.     

基于粒语义推理的粒归结研究

粒归结方法和粒语义推理均是针对粒计算与逻辑推理相互融合研究的成果.粒语义推理能否作为粒归结方法的推理基础,或粒归结方法是否为粒语义推理的另一种形式是值得探究的问题.研究表明,粒归结方法中的粒归结序列是粒语义推理的充分条件.但对粒归结方法推广后,所得到的特殊粒归结序列是粒语义推理的充分必要条件.于是粒归结方法具有了推理的基础,粒语义推理也存在了其它的形式.这样粒归结方法与粒语义推理便具有相互支撑的紧密关系.     

Granular Neural Networks With Evolutionary Interval Learning

To deal with different membership functions of the same linguistic term, a new interval reasoning method using new granular sets is proposed based on Yin Yang methodology. To make interval-valued granular reasoning efficiently and optimize interval membership functions based on training data effectively, a granular neural network (GNN) with a new high-speed evolutionary interval learning is designed. Simulation results in nonlinear function approximation and bioinformatics have shown that the GNN with the evolutionary interval learning is able to extract interval-valued granular rules effectively and efficiently from training data by using the new evolutionary interval learning algorithm.     

Default logic and specification of nonmonotonic reasoning

In this paper constructions leading to the formation of belief sets by agents are studied. The focus is on the situation when possible belief sets are built incrementally in stages. An infinite sequence of theories that represents such a process is called a reasoning trace. A set of reasoning traces describing all possible reasoning scenarios for the agent is called a reasoning frame. Default logic by Reiter is not powerful enough to represent reasoning frames. In the paper a generalization of default logic of Reiter is introduced by allowing infinite sets of justifications. This formalism is called infinitary default logic. In the main result of the paper it is shown that every reasoning frame can be represented by an infinitary default theory. A similar representability result for antichains of theories (belief frames) is also presented.     

Quantum Mereotopology

While mereotopology – the theory of boundaries, contact and separation built up on a mereological foundation – has found fruitful applications in the realm of qualitative spatial reasoning, it faces problems when its methods are extended to deal with those varieties of spatial and non-spatial reasoning which involve a factor of granularity. This is because granularity cannot easily be represented within a mereology-based framework. We sketch how this problem can be solved by means of a theory of granular partitions, a theory general enough to comprehend not only the familiar sorts of spatial partitions but also a range of coarse-grained partitions of other, non-spatial sorts. We then show how these same methods can be extended to apply to finite sequences of granular partitions evolving over time, or to what we shall call coarse- and fine-grained histories.     

粒及粒计算在逻辑推理中的应用

讨论了信息粒的结构及其实例。基于Rough集方法定义了决策规则粒,构造了决策规则粒库,它被用作逻辑推理。定义了粒语言,描述了这种语言的语法、语义、粒语句的运算法则和粒之相关的几个性质。定义了粒之间的相互包含(inclusion)和相似(closeness)。基于这些概念,构造了一种逻辑推理的新模型。这种推理模式的特点在于它既是逻辑的又是集合论的。所谓逻辑的就是说推理是遵循一种逻辑运算;所谓集合论的是指这种推理可利用对应于这种逻辑公式的意义集的运算进行推理,还用实例说明了这种推理模式是可行和有效的。     

A Computational Framework for Practical Social Reasoning

This article describes a framework for practical social reasoning designed to be used for analysis, specification, and implementation of the social layer of agent reasoning in multiagent systems. Our framework, called the expectation strategy behavior (ESB) framework, is based on (i) using sets of update rules for social beliefs tied to observations (so‐called expectations), (ii) bounding the amount of reasoning to be performed over these rules by defining a reasoning strategy, and (iii) influencing the agent's decision‐making logic by means of behaviors conditioned on the truth status of current and future social beliefs. We introduce the foundations of ESB conceptually and present a formal framework and an actual implementation of a reasoning engine, which is specifically combined with a general (belief–desire–intention‐based) practical reasoning programming system. We illustrate the generality of ESB through select case studies, which show that it is able to represent and implement different typical styles of social reasoning. The broad coverage of existing social reasoning methods, the modularity that derives from its declarative nature, and its focus on practical implementation make ESB a useful tool for building advanced socially reasoning agents.     

A multicontext architecture for formalizing complex reasoning

We propose multicontext systems (MC systems) as a formal framework for the specification of complex reasoning. MC systems provide the ability to structure the specification of “global” reasoning in terms of “local” reasoning subpatterns. Each subpattern is modeled as a deduction in a context, formally defined as an axiomatic formal system. the global reasoning pattern is modeled as a concatenation of contextual deductions via bridge rules, i.e., inference rules that infer a fact in one context from facts asserted in other contexts. Besides the formal framework, in this article we propose a three-layer architecture designed to specify and automatize complex reasoning. At the first level we have object-level contexts (called s-contexts) for domain specifications. Problem-solving principles and, more in general, meta-level knowledge about the application domain is specified in a distinct context, called Problem-Solving Context (PSC). On top of s-contexts and PSC, we have a further context, called MT, where it is possible to specify strategies to control multicontext reasoning spanning through s-contexts and PSC. We show how GETFOL can be used as a computer tool for the implementation of MC systems and for the automatization of multicontext deductions. © 1995 John Wiley & Sons, Inc.     

基于属性粒度商空间的本体形式化与检验

针对传统的本体形式化过程中从一个本体层次空间跳转到另一个本体层次空间存在的问题,将粒度计算思想引入本体建模领域,利用属性粒度商空间理论构建本体形式化模型,定义模型的各个部分,在此基础上对基于属性粒度商空间的本体形式化模型进行检验,验证该模型可以较好地满足本体层次之间的跳转及推理关系。     

A new approach to fuzzy reasoning

 Over the last years fuzzy control has become a very popular and successful control paradigm. The basic idea of fuzzy control is to incorporate human expert knowledge. This expert knowledge is specified in a rule based manner on a high and granular level of abstraction. By using vague predicates a fuzzy rule base neglects useless details and concentrates on important relations. Following L.A. Zadeh’s famous principle of incompatibility, this technique is most promising when applied to large and complex problems. Nevertheless, nowadays most fuzzy rule bases are small and represent simple knowledge. From our point of view this surprising and somewhat disappointing observation is due to a major lack of understanding how to handle a fuzzy rule base. In this paper we present a new theory for fuzzy reasoning. This theory is twofold. In general, a fuzzy rule base is both partially inconsistent and partially incomplete. This is the price to pay for abstraction and granularization. We show that if a fuzzy rule base maximizes consistency at the cost of completeness, the well-known possibilistic approach to fuzzy inference is the right choice. For a fuzzy rule base that maximizes completeness at the cost of consistency, we derive a new type of inference called σ-reasoning. Together, both mechanisms form an embracing theory for fuzzy reasoning in general. We propose a combined approach to be applied in order to manage complex rule bases.     

A new modal logic for reasoning about space: spatial propositional neighborhood logic

It is widely accepted that spatial reasoning plays a central role in artificial intelligence, for it has a wide variety of potential applications, e.g., in robotics, geographical information systems, and medical analysis and diagnosis. While spatial reasoning has been extensively studied at the algebraic level, modal logics for spatial reasoning have received less attention in the literature. In this paper we propose a new modal logic, called spatial propositional neighborhood logic (SpPNL for short) for spatial reasoning through directional relations. We study the expressive power of SpPNL, we show that it is able to express meaningful spatial statements, we prove a representation theorem for abstract spatial frames, and we devise a (non-terminating) sound and complete tableaux-based deduction system for it. Finally, we compare SpPNL with the well-known algebraic spatial reasoning system called rectangle algebra.      

An Interactive Deformation System for Granular Material

Computer Graphics (CG) animations of natural phenomena are currently widely used for movies and in video games. Granular materials occur widely in nature, and therefore it is necessary that CG animations represent ground surfaces composed of a granular material as well as model deformations when the granular material comes into contact with other physical rigid objects (called solid objects). In this paper, we propose a deformation algorithm for ground surfaces composed of granular material. The deformation algorithm is divided into three steps: (1) detection of the collision between a solid object and the ground surface, (2) displacement of the granular material and (3) erosion of the material at steep slopes. The proposed algorithm can handle solid objects of various shapes, including concave polyhedra by additionally using a layered data structure called the Height Span Map. Furthermore, a texture sliding technique is presented to render the motion of granular materials. In addition, our implementation of the deformation algorithm can be used at interactive frame rates.     

Fuzzy reasoning model under quotient space structure

In this paper, we present a theoretical framework of fuzzy reasoning model under quotient space structure. It consists of (1) introducing quotient space structure into fuzzy sets, i.e., constructing fuzzy set representations of different grain-size spaces and their relationships; (2) introducing the concept of fuzzy sets into quotient space theory, i.e., introducing fuzzy equivalence relation and discussing its corresponding reasoning in different grain-size spaces; and (3) discussing the relationship and transformation among different granular computing methodologies. The framework proposed is aimed to combine two powerful abilities in order to enhance the efficiency of fuzzy reasoning: one is the ability of computing with words based on fuzzy set methodology, the other is the ability of hierarchical problem solving based on quotient space approach.     

A mean field neural network mechanizing complex causal reasoning problems

A neural model for causal reasoning (also called abduction) is proposed in the open, independent, and incompatibility classes. The reasoning process is characterized in these classes by an explicit energy/target function. Potts spin mean field theory annealing methods are used to derive the mechanics of this model. Application of the model to an actual case in legal reasoning and an experimental-based comparison with a recent proposal reveal its efficiency and swiftness in computing the best solutions.     

Principles of continuous analogical reasoning

Abstract

This paper presents evidence supporting the view of analogical reasoning as a continuous process. The phrase continuous analogical reasoning refers to the continuous flow of information between the three stages in analogical reasoning: selection, mapping and evaluation. This paper presents the motivations behind the development of the continuous analogical reasoning approach, along with evidence of the interactions between stages from the psychological community. Implications for discrete analogical reasoning systems are discussed. The implementation of a continuous analogical reasoning system called ASTRA is presented and discussed in terms of the interactions between the stages.     

多主体系统中对其它主体的研究

多主体系统是当前人工智能研究后一个热点，其中，关于知识和动作的推理是一个重要的课题，文中给出了一种知识表示框架，称为ＲＡＯ逻辑，用来对其它主体研究时表示概念和规则，我们从日常推理中抽象出换位原则的规则（ＰＥＰ），ＰＥＰ是ＲＡＯ是的一条公理模式，并且为主体研究其它主体的一个基本规则，它与知识逻辑中的分离规则和（Ｋ）公理具有相似的形式和作用。     

On nonmonotonic reasoning with the method of sweeping presumptions

Reasoning almost always occurs in the face of incomplete information. Such reasoning is nonmonotonic in the sense that conclusions drawn may later be withdrawn when additional information is obtained. There is an active literature on the problem of modeling such nonmonotonic reasoning, yet no category of method-let alone a single method-has been broadly accepted as the right approach. This paper introduces a new method, called sweeping presumptions, for modeling nonmonotonic reasoning. The main goal of the paper is to provide an example-driven, nontechnical introduction to the method of sweeping presumptions, and thereby to make it plausible that sweeping presumptions can usefully be applied to the problems of nonmonotonic reasoning. The paper discusses a representative sample of examples that have appeared in the literature on nonmonotonic reasoning, and discusses them from the point of view of sweeping presumptions.     

Contextual reasoning distilled

In this paper we provide a foundation of a theory of contextual reasoning from the perspective of a theory of knowledge representation. Starting from the so-called metaphor of the box, we firstly show that the mechanisms of contextual reasoning proposed in the literature can be classified into three general forms (called localized reasoning, push and pop, and shifting). Secondly, we provide a justification of this classification, by showing that each mechanism corresponds to operating on a fundamental dimension along which context dependent representations may vary (namely, partiality, approximation and perspective). From the previous analysis, we distill two general principles of a logic of contextual reasoning. Finally, we show that these two principles can be adequately formalized in the framework of MultiContext Systems. In the last part of the paper, we provide a practical illustration of the ideas discussed in the paper by formalising a simple scenario, called the Magic Box problem.     

Interactive Case-Based Planning for Forest Fire Management

This paper describes an AI system for planning the first attack on a forest fire. This planning system is based on two major techniques, case-based reasoning, and constraint reasoning, and is part of a decision support system called CHARADE. CHARADE is aimed at supporting the user in the whole process of forest fire management. The novelty of the proposed approach is mainly due to the use of a local similarity metric for case-based reasoning and the integration with a constraint solver in charge of temporal reasoning.