Default reasoning and belief revision: A syntax-independent approach

As an important variant of Reiter‘s default logic.Poole(1988) developed a nonmonotonic reasoning framework in the classical first-order language,Brewka and Nebel extended Poole‘s approach in order to enable a representation of priorities between defaults.In this paper a general framework for default reasoning is presented,which can be viewed as a generalization of the three approaches above.It is proved that the syntax-independent default reasoning in this framework is identical to the general belief revision operation introduced by Zhang et al.(1997).This esult provides a solution to the problem whether there is a correspondence between belief revision and default logic for the infinite case .As a by-product,an answer to the the question,raised by Mankinson and Gaerdenfors(1991),is also given about whether there is a counterpart contraciton in nonmonotonic logic.     

A logic programming system for nonmonotonic reasoning

The evolution of logic programming semantics has included the introduction of a new explicit form of negation, beside the older implicit (or default) negation typical of logic programming. The richer language has been shown adequate for a spate of knowledge representation and reasoning forms.The widespread use of such extended programs requires the definition of a correct top-down querying mechanism, much as for Prolog wrt. normal programs. One purpose of this paper is to present and exploit a SLDNF-like derivation procedure, SLX, for programs with explicit negation under well-founded semantics (WFSX) and prove its soundness and completeness. (Its soundness wrt. the answer-sets semantics is also shown.) Our choice ofWFSX as the base semantics is justi-fied by the structural properties it enjoys, which are paramount for top-down query evaluation.Of course, introducing explicit negation requires dealing with contradiction. Consequently, we allow for contradiction to appear, and show moreover how it can be removed by freely changing the truth-values of some subset of a set of predefined revisable literals. To achieve this, we introduce a paraconsistent version ofWFSX, WFSX _p , that allows contradictions and for which our SLX top-down procedure is proven correct as well.This procedure can be used to detect the existence of pairs of complementary literals inWESX _p simply by detecting the violation of integrity rulesf L, -L introduced for eachL in the language of the program. Furthermore, integrity constraints of a more general form are allowed, whose violation can likewise be detected by SLX.Removal of contradiction or integrity violation is accomplished by a variant of the SLX procedure that collects, in a formula, the alternative combinations of revisable literals' truth-values that ensure the said removal. The formulas, after simplification, can then be satisfied by a number of truth-values changes in the revisable, among true, false, and undefined. A notion of minimal change is defined as well that establishes a closeness relation between a program and its revisions. Forthwith, the changes can be enforced by introducing or deleting program rules for the revisable literals.To illustrate the usefulness and originality of our framework, we applied it to obtain a novel logic programming approach, and results, in declarative debugging and model-based diagnosis problems.     

Abductive logics in a belief revision framework

Abduction was first introduced in the epistemological context of scientific discovery. It was more recently analyzed in artificial intelligence, especially with respect to diagnosis analysis or ordinary reasoning. These two fields share a common view of abduction as a general process of hypotheses formation. More precisely, abduction is conceived as a kind of reverse explanation where a hypothesis H can be abduced from events E if H is a good explanation of E. The paper surveys four known schemes for abduction that can be used in both fields. Its first contribution is a taxonomy of these schemes according to a common semantic framework based on belief revision. Its second contribution is to produce, for each non-trivial scheme, a representation theorem linking its semantic framework to a set of postulates. Its third contribution is to present semantic and axiomatic arguments in favor of one of these schemes, ordered abduction, which has never been vindicated in the literature.     

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.     

Dualities between alternative semantics for logic programming and nonmonotonic reasoning

The Gelfond-Lifschitz operator associated with a logic program (and likewise the operator associated with default theories by Reiter) exhibits oscillating behavior. In the case of logic programs, there is always at least one finite, nonempty collection of Herbrand interpretations around which the Gelfond-Lifschitz operator bounces around. The same phenomenon occurs with default logic when Reiter's operator is considered. Based on this, a stable class semantics and extension class semantics has been proposed. The main advantage of this semantics was that it was defined for all logic programs (and default theories), and that this definition was modelled using the standard operators existing in the literature such as Reiter's operator. In this paper our primary aim is to prove that there is a very interestingduality between stable class theory and the well-founded semantics for logic programming. In the stable class semantics, classes that were minimal with respect to Smyth's power-domain ordering were selected. We show that the well-founded semantics precisely corresponds to a class that is minimal w.r.t. Hoare's power domain ordering: the well-known dual of Smyth's ordering. Besides this elegant duality, this immediately suggests how to define a well-founded semantics for default logic in such a way that the dualities that hold for logic programming continue to hold for default theories. We show how the same technique may be applied to strong autoepistemic logic: the logic of strong expansions proposed by Marek and Truszczynski.     

智能体行动推理中的信念修正

信念修正中的加强修正算法在保留低秩非矛盾信念时存在不足,流演算由于其表示公式的局限,无法较好的与信念修正结合来进行行动推理。针对以上不足,提出了依赖信念修正算法和Strategy-Axiom-Reasoning模型。该算法满足Ind假设并且较好的保留了条件信念和低秩非矛盾信念,SAR模型继承并改进了流演算的公理系统,用公式集表示信念集,较好的实现了与信念修正的结合。最后将依赖信念修正算法运用到SAR模型中,用实验证明了其可行性。     

Deductive efficiency,belief revision and acting

Abstract

The SNePS inference engine is optimized for deductive efficiency, i.e. all beliefs acquired via inference are added to the agent's beliefs so that future queries may be answered by a retrieval rather than rederivation. An assumption-based truth maintenance system keeps track of the derivation histories of derived beliefs. We show how such an architecture simplifies the ontology of prepositional representations of plans; acts; preconditions, and effects of actions. In addition, the deductive efficiency of the basic system automatically extends itself to efficient search of plans, and hierarchical plan decompositions.     

逻辑等价度量下的模糊推理系统的鲁棒性

给出了基于模糊逻辑等价度量的模糊集的扰动的定义,讨论了模糊集扰动与模糊连接词及蕴涵算子扰动之间的关系,针对若干特殊的模糊连接词及蕴涵算子的扰动情形,给出了模糊推理系统的扰动的估计,并讨论了模糊推理系统的鲁棒性。     

Normative conflicts in legal reasoning

This article proposes a formal analysis of a fundamental aspect of legal reasoning: dealing with normative conflicts. Firstly, examples are illustrated concerning the dynamics of legal systems, the application of rules and exceptions, and the semantic indeterminacy of legal sources. Then two approaches to cope with conflicting information are presented: the preferred theories of Brewka, and the belief change functions of Alchourrón, Gärdenfors, and Makinson. The relations between those approaches are closely examined, and some aspects of a model of reasoning with normative conflicts are outlined. Since this model takes into account an ordering of the involved regulations, criteria to order legal norms are finally specified.     

直觉模糊推理机的设计及其推理算子选择研究*

首先引入直觉模糊集下的模糊蕴涵算子运算方法,设计应用直觉模糊蕴涵算子的直觉模糊推理机模型的设计,阐述模型的运行机理,通过实例验证直觉模糊推理机模型的有效性和正确性.提出选择模糊蕴涵算子的贴近度法,在具体应用领域中可根据比较结果作具体选择.     

Robustness of fuzzy reasoning via logically equivalence measure

In this paper, we discuss robustness of fuzzy reasoning. After proposing the definition of perturbation of fuzzy sets based on some logic-oriented equivalence measure, we present robustness results for various fuzzy logic connectives, fuzzy implication operators, inference rules and fuzzy reasoning machines, and discuss the relations between the robustness of fuzzy reasoning and that of fuzzy conjunction and implication operators. The robustness results are presented in terms of δ-equalities of fuzzy sets based on some logic-oriented equivalence measure, and the maximum of δ (which ensures the corresponding δ-equality holds) is derived.     

Entailment for intuitionistic fuzzy sets based on generalized belief structures

Entailment for measure-based belief structures can extend the possible probability value range of variables on a space and obtain more information from variables. However, if the variable space comes from intuitionistic fuzzy sets, the classical entailment for measure-based belief structures will not work in this issue. To deal with this situation, we propose the entailment for intuitionistic fuzzy sets based on generalized belief structures in this paper to apply the entailment for measure based belief structures on space, which is made up of non-membership degree, membership degree and hesitancy degree of a given intuitionistic fuzzy sets. Numerical examples are mentioned to prove the effectively and flexibility of this proposed entailment model. The experimental results indicate that the proposed algorithm can extend the possible probability value range of variables of space efficiently and obtain more information from intuitionistic fuzzy sets.     

基于直觉模糊推理的目标识别方法

针对目标识别特征值的不确定性问题,提出一种基于直觉模糊推理的目标识别方法．首先,分析现有目标识别方法的不确定性与局限性,并对空中目标识别问题及目标特征进行描述;然后,设计系统状态属性变量的隶属度函数与非隶属度函数;最后,建立直觉模糊推理规则,设计推理合成算法和解模糊算法,并检验所建规则的合理性．仿真实例验证了所提方法的有效性与适用性．     

直觉模糊集的模糊蕴含式运算方法

与经典模糊集相比,直觉模糊集具有更强的表达能力和灵活性.针对直觉模糊集的模糊推理,将经典的模糊集的模糊蕴含式拓展到直觉模糊集中,提出基于扩展二值逻辑的直觉模糊集下各种模糊蕴含式运算方法,通过实例验证直觉模糊集模糊蕴含式运算方法的有效性和正确性.     

Faithful representation of nonmonotonic patterns of inference

Recently, John Bell has proposed that a specific conditional logic, C, be considered as a serious candidate for formally representing and faithfully capturing various (possibly all) formalized notions of nonmonotonic inference. The purpose of the present paper is to develop evaluative criteria for critically assessing such claims. Inference patterns are described in terms of the presence or absence of residual classical monotonicity and intrinsic nonmonotonicity. The concept of a faithful representation is then developed for a formalism purported to encode a pattern of nonmonotonic inference already captured by another. In the main body of the paper these evaluative criteria are applied to assess (negatively) whether C or any conditional logic provides a faithful representation for nonmonotonic patterns of inference captured by inference operators and relations modeling the dynamics of belief change.     

Fuzzy multiattribute group decision making based on intuitionistic fuzzy sets and evidential reasoning methodology

In this paper, we propose a new fuzzy multiattribute group decision making method based on intuitionistic fuzzy sets and the evidential reasoning methodology. First, the proposed method uses the evidential reasoning methodology to aggregate each decision maker’s decision matrix and the weights of the attributes to get the aggregated decision matrix of each decision maker. Then, it uses the obtained aggregated decision matrices of the experts, the weights of the experts and the evidential reasoning methodology to get the aggregated intuitionistic fuzzy value of each alternative. Finally, it calculates the transformed value of the obtained intuitionistic fuzzy value of each alternative. The smaller the transformed value, the better the preference order of the alternative. The proposed method can overcome the drawbacks of the existing methods for fuzzy multiattribute group decision making in intuitionistic fuzzy environments.     

直觉模糊神经网络的函数逼近能力

运用直觉模糊集理论,建立了自适应神经-直觉模糊推理系统（ANIFIS）的控制模型,并证明了该模型具有全局逼近性质.首先将Zadeh模糊推理神经网络变为直觉模糊推理网络,建立一个多输入单输出的T-S型ANIFIS模型;然后设计了系统变量的属性函数和推理规则,确定了各层的输入输出计算关系,以及系统输出结果的合成计算表达式;最后通过证明所建模型的输出结果计算式满足Stone-Weirstrass定理的3个假设条件,完成了该模型的全局逼近性证明.