Knowledge,Assertion, and Inference

This paper argues that three plausible principles are mutually inconsistent: (KA) One ought to assert only what one knows; (AP) If it is proper to assert some proposition q, then it is, barring special and not very common circumstances, proper to assert any proposition p from which q has been competently inferred; and (AKN) Some propositions are both properly assertible and known by competent inference from propositions which one does not know. Each pair of two principles constitutes an argument against the remaining principle, but which principle should one drop?     

Common Belief with the Logic of Individual Belief

The logic of common belief does not always reflect that of individual beliefs. In particular, even when the individual belief operators satisfy the KD45 logic, the common belief operator may fail to satisfy axiom 5. That is, it can happen that neither is A commonly believed nor is it common belief that A is not commonly believed. We identify the intersubjective restrictions on individual beliefs that are incorporated in axiom 5 for common belief.     

Awareness, Belief, and Communication Reaching Consensus

This article studies graph-theoretical conditions under which communication will lead to consensus among players about their decisions in circumstances where there are more than two players and they interact in pair without public announcement. It is shown that consensus on their decisions can be guaranteed if the communication graph contains no cycle. Where none of the requirements for player's knowledge is imposed as in the standard model of knowledge with partitional information structure.     

Thought Structure, Belief Content, and Possession Conditions

According to Peacocke, concepts are individuated by their possession conditions, which are specified in terms of conditions in which certain propositions containing those concepts are believed. In support, Peacocke tries to explain what it is for a thought to have a structure and what it is for a belief to have a propositional content. I show that the possession condition theory cannot answer such fundamental questions. Peacocke’s theory founders because concepts are metaphysically fundamental. They individuate the propositions and thoughts containing them, which in turn individuate the propositional attitudes that are relations to those propositions or thoughts.

Belief structures,weight generating functions and decision-making

We describe the Dempster–Shafer belief structure and provide some of its basic properties. We introduce the plausibility and belief measures associated with a belief structure. We note that these are not the only measures that can be associated with a belief structure. We describe a general approach for generating a class of measures that can be associated with a belief structure using a monotonic function on the unit interval, called a weight generating function. We study a number of these functions and the measures that result. We show how to use weight-generating functions to obtain dual measures from a belief structure. We show the role of belief structures in representing imprecise probability distributions. We describe the use of dual measures, other then plausibility and belief, to provide alternative bounding intervals for the imprecise probabilities associated with a belief structure. We investigate the problem of decision making under belief structure type uncertain. We discuss two approaches to this decision problem. One of which is based on an expected value of the OWA aggregation of the payoffs associated with the focal elements. The second approach is based on using the Choquet integral of a measure generated from the belief structure. We show the equivalence of these approaches.     

Fully Coprime Comodules and Fully Coprime Corings

Prime objects were defined as generalization of simple objects in the categories of rings (modules). In this paper we introduce and investigate what turns out to be a suitable generalization of simple corings (simple comodules), namely fully coprime corings (fully coprime comodules). Moreover, we consider several primeness notions in the category of comodules of a given coring and investigate their relations with the fully coprimeness and the simplicity of these comodules. These notions are applied then to study primeness and coprimeness properties of a given coring, considered as an object in its category of right (left) comodules. Supported by King Fahd University of Petroleum and Minerals, Research Project # INT/296.     

Anti-Substitution Intuitions and the Content of Belief Reports

Philosophers of language traditionally take it that anti-substitution intuitions teach us about the content of belief reports. Jennifer Saul [1997, 2002 (with David Braun), 2007] challenges this lesson. Here I offer a response to Saul’s challenge. In the first two sections of the article, I present a common sense justification for drawing conclusions about content from anti-substitution intuitions. Then, in Sect. 3, I outline Saul’s challenge—what she calls ‘the Enlightenment Problem’. Finally, in Sect. 4, I argue that Saul’s challenge does not undermine the common sense justification presented in Sects. 1 and 2. I avoid the challenge by arguing that anti-substitution intuitions are not directly sensitive to the content of the sentences that produce them, but rather to the possibility that one could have distinct ways of thinking about an object.     

On the Logic of Common Belief

We investigate an axiomatization of the notion of common belief (knowledge) that makes use of no rules of inference (apart from Modus Ponens and Necessitation) and highlight the property of the set of accessibility relations that characterizes each axiom. Mathematics Subject Classification: 03B45, 68T25.     

遥操作系统的稳定性与透明性分析

遥操作机器人系统的通信通道中存在通信时延,而且机器人模型存在不确定性,以致可能造成系统不稳定和操作性能降低.针对通信时延和系统不确定性,利用鲁棒控制理论,提出用力、位置和速度反馈的控制方法,使得系统稳定,且具有良好的透明性.仿真结果表明了该方法的有效性.     

Fully Optimal Bases and the Active Bijection in Graphs,Hyperplane Arrangements,and Oriented Matroids

In this note, we present the main results of a series of forthcoming papers, dealing with bi-jective generalizations of some counting formulas. New intrinsic constructions in oriented matroids on a linearly ordered set of elements establish notably structural links between counting regions and linear programming. We introduce fully optimal bases, which have a simple combinatorial characterization, and strengthen the well-known optimal bases of linear programming. Our main result is that every bounded region of an ordered hyperplane arrangement, or ordered oriented matroid, has a unique fully optimal basis, providing the active bijection between bounded regions and uniactive internal bases. The active bijec-tion is extended to an activity preserving mapping between all reorientations and all bases of an ordered oriented matroid. It gives a bijective interpretation of the equality of two expressions for the Tutte polynomial, as well as a new expression of this polynomial in terms of beta invariants of minors. There are several refinements, such as an activity preserving bijection between regions (acyclic reorientations) and no-broken-circuit subsets, and others in terms of hyperplane arrangements, graphs, and permutations.     

Moore's Paradox in Belief and Desire

Is there a Moore’s paradox in desire? I give a normative explanation of the epistemic irrationality, and hence absurdity, of Moorean belief that builds on Green and Williams’ normative account of absurdity. This explains why Moorean beliefs are normally irrational and thus absurd, while some Moorean beliefs are absurd without being irrational. Then I defend constructing a Moorean desire as the syntactic counterpart of a Moorean belief and distinguish it from a ‘Frankfurt’ conjunction of desires. Next I discuss putative examples of rational and irrational desires, suggesting that there are norms of rational desire. Then I examine David Wall’s groundbreaking argument that Moorean desires are always unreasonable. Next I show against this that there are rational as well as irrational Moorean desires. Those that are irrational are also absurd, although there seem to be absurd desires that are not irrational. I conclude that certain norms of rational desire should be rejected.     

Fully commutative elements and Kazhdan-Lusztig cells in the finite and affine Coxeter groups, II

Let be an irreducible finite or affine Coxeter group and let be the set of fully commutative elements in . We prove that the set is closed under the Kazhdan-Lusztig preorder if and only if is a union of two-sided cells of .

     

Belief revision and organisational knowledge dynamics

It is widely accepted nowadays that the ability of a firm to display sustained competitive advantage, relies heavily on its efficiency in managing organisational knowledge, and keeping it up-to-date with internal and external developments. It is therefore imperative to develop a deeper understanding of organisational knowledge evolution. In this paper, we propose the use of methods and techniques from the area of Belief Revision in studying organisational knowledge dynamics. Belief Revision lies at the intersection of Formal Philosophy and Computer Science, and studies the process by which a rational agent changes her beliefs in the light of new information. The formal models that have been developed in this area are intuitive and elegant, and in this paper we show how they can be imported into the context of organisational knowledge management.     

Fully Nonlinear Parabolic Equations and the Dini Condition

Interior regularity results for viscosity solutions of fully nonlinear uniformly parabolic equations under the Dini condition, which improve and generalize a result due to Kovats, are obtained by the use of the approximation lemma. Received November 21, 2000, Accepted April 27, 2001     

Fully nonlinear elliptic equations and the dini condition

Abstract

We investigate transmission problems with strongly Lipschitz interfaces for the Dirac equation by establishing spectral estimates on an associated boundary singular integral operator, the rotation operator. Using Rellich estimates we obtain angular spectral estimates on both the essential and full spectrum for general bi-oblique transmission problems. Specializing to the normal transmission problem, we investigate transmission problems for Maxwell's equations using a nilpotent exterior/interior derivativeoperator. The fundamental commutation properties for this operator with the two basic reflection operators are proved. We show how the L ₂spectral estimates are inherited for the domain of the exterior/interior derivative operator and prove some complementary eigenvalue estimates. Finally we use a general algebraic theorem to prove a regularity property needed for Maxwell's equations.     

基于和积和最大积的信念传播算法的收敛性分析

在介绍马尔可夫网络和标准信念传播(Belief Propagation,BP)算法的基础上,以具有4个隐含结点的无环马尔可夫网络为例,详细分析了基于和积和最大积的BP算法收敛性,结果表明,在网络为无环马尔可夫网络时,基于和积的BP算法收敛于全局最优解,而基于最大积的BP算法在任何初值条件下,只要经过有限次迭代,BP算法必收敛到唯一固定点,若算法有唯一最优点,则此固定点为最优点.以实证分析为工具,研究BP算法收敛性,可作为BP算法基础理论研究的一次有益尝试.