Belief extrapolation (or how to reason about observations and unpredicted change)

We give a logical framework for reasoning with observations at different time points. We call belief extrapolation the process of completing initial belief sets stemming from observations by assuming minimal change. We give a general semantics and we propose several extrapolation operators. We study some key properties verified by these operators and we address computational issues. We study in detail the position of belief extrapolation with respect to revision and update: in particular, belief extrapolation is shown to be a specific form of time-stamped belief revision. Several related lines of work are positioned with respect to belief extrapolation.     

基于Flash“加减运算”教育游戏的设计与开发

在教学中运用教育游戏,能够引发学习者的好奇心,激发学习者的兴趣,从而获得较好的教学效果。本文详细阐述了如何运用Flash软件,设计并开发适合小学数学教学,界面友好、操作方便的加减运算教育游戏。     

Towards a temporal coherence management in real-time knowledge-based systems

The multi-agent system paradigm emerges as an interesting approach in the Knowledge-Based System (KBS) field when distributed problem-solving techniques are required. On the other hand, temporal representation and reasoning problems arise in a wide range of KBS application areas where time plays a crucial role. In this paper, we show that when agents run concurrently and access common temporal data, some problems of coherence arise. We analyse the different cases in which an incoherence in temporal information can occur and provide a method to tackle this problem. In this method, conflict management is handled by means of exception handlers and control rules allowing the users to explicitly define their own strategy for temporal coherence solving.     

The measurement of ranks and the laws of iterated contraction

Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper shows how to reconstruct a ranking function from its iterated contraction behavior uniquely up to multiplicative constant and thus how to measure ranks on a ratio scale. Thereby, it also shows how to completely axiomatize that behavior. The complete set of laws of iterated contraction it specifies amend the laws hitherto discussed in the literature.     

Formal models of coherence and legal epistemology

This paper argues that formal models of coherence are useful for constructing a legal epistemology. Two main formal approaches to coherence are examined: coherence-based models of belief revision and the theory of coherence as constraint satisfaction. It is shown that these approaches shed light on central aspects of a coherentist legal epistemology, such as the concept of coherence, the dynamics of coherentist justification in law, and the mechanisms whereby coherence may be built in the course of legal decision-making.

Diversity of Agents and Their Interaction

Diversity of agents occurs naturally in epistemic logic, and dynamic logics of information update and belief revision. In this paper we provide a systematic discussion of different sources of diversity, such as introspection ability, powers of observation, memory capacity, and revision policies, and we show how these can be encoded in dynamic epistemic logics allowing for individual variation among agents. Next, we explore the interaction of diverse agents by looking at some concrete scenarios of communication and learning, and we propose a logical methodology to deal with these as well. We conclude with some further questions on the logic of diversity and interaction. This work was supported by the Chinese National Social Science Foundation (Grant Number: 04CZX011) and the Dutch Science Organization NWO.     

环保服装设计的加减法——创新与再生的博弈

"环保",这一渗透到各行各业的全球化名词如今已不再是人们用来标榜自身的简单口号。当人们越来越多意识到环境危机为自身带来的威胁已成不可逆转的趋势影响着这个世界,环保便成为时下最深入人心的生活方式。而与人们接触最为紧密的衣生活无可厚非成为环保最先关注的领域。文章主要以服装设计为载体,以加减法为喻体,结合国内外环保服装设计等实例,对环保服装设计中最为常见的高科技创新方法与资源再生方法进行解读和分析,以探讨环保服装设计在中国的未来发展趋势。     

实现区域"交"、"差"、"并"操作的研究及软件开发

介绍了一个能实现区域“交”、“差”、“并”操作的软件,其中区域可由多个凹多边形组成,并且每个多边形可带多个内孔。由于曲线可以由小线段组成的多边形来逼近表示,因此还可以实现任何边界区域间的 “交”、“差”、“并”操作。该软件以高效基础算法为基础,现已投入使用。     

用C语言实现超长整数的加减乘除四则运算

通过对 C语言链表、字符串的应用 ,解决了高级程序设计语言处理数据存储空间的问题 ,实现了高级语言数据类型无法完成的超长整数、高精度加减乘除四则运算 ,并对其实现算法进行了简要的分析和介绍     

Driving a Wedge Between Evidence and Beliefs: How Online Ideological News Exposure Promotes Political Misperceptions

This article has 2 goals: to provide additional evidence that exposure to ideological online news media contributes to political misperceptions, and to test 3 forms this media‐effect might take. Analyses are based on representative survey data collected during the 2012 U.S. presidential election (N = 1,004). Panel data offer persuasive evidence that biased news site use promotes inaccurate beliefs, while cross‐sectional data provide insight into the nature of these effects. There is no evidence that exposure to ideological media reduces awareness of politically unfavorable evidence, though in some circumstances biased media do promote misunderstandings of it. The strongest and most consistent influence of ideological media exposure is to encourage inaccurate beliefs regardless of what consumers know of the evidence.     

A probabilistic reasoning model: Formulation and control strategy

It has been recognized that past experiences of a decision maker often plays a pivotal role in solving new problem instances. Therefore, the ability to model human reasoning processes has become an important subject of research in recent years. In many applications, the reasoning process must deal with uncertainty inherent in the problem domain. This research addresses the issue of supporting the model formulation and data acquisition processes for situations that (i) operate under uncertain conditions, and (ii) utilize evidential information that is gathered in stages. A theoretical framework is presented for the probabilistic formulation of the reasoning process that incorporates past experiences. The model is validated by testing its performance on simulated data, and is shown to work well when a sufficiently large number of cases are available for estimating probabilities. The probabilistic reasoning system can revise beliefs in an intuitively appealing and theoretically sound manner when information is acquired in an incremental fashion. Two dynamic information gathering strategies are discussed for such a reasoning system, one using information theoretic techniques, and the other using decision theoretic techniques.     

Authorware7.0在CAI课件制作中的方法和技巧

近几年来,随着现代科学技术的飞速发展,计算机软件的功能越来越强,课件的使用越来越普遍。本文就Authorware7.0在制作多媒体课件的过程中常用的方法与技巧进行分析,以提高广大教师开发多媒体课件的技术水平。     

Plausible Justification Trees: A Framework for Deep and Dynamic Integration of Learning Strategies

This article describes a framework for the deep and dynamic integration of learning strategies. The framework is based on the idea that each single-strategy learning method is ultimately the result of certain elementary inferences (like deduction, analogy, abduction, generalization, specialization, abstraction, concretion, etc.). Consequently, instead of integrating learning strategies at a macro level, we propose to integrate the different inference types that generate individual learning strategies. The article presents a concept-learning and theory-revision method that was developed in this framework. It allows the system to learn from one or from several (positive and/or negative) examples, and to both generalize and specialize its knowledge base. The method integrates deeply and dynamically different learning strategies, depending on the relationship between the input information and the knowledge base. It also behaves as a single-strategy learning method whenever the applicability conditions of such a method are satisfied.     

An anytime revision operator for large and uncertain geographic data sets

 The environmental data are in general imprecise and uncertain, but they are located in space and therefore obey to spatial constraints. The “spatial analysis” is a (natural) reasoning process through which geographers take advantage of these constraints to reduce this uncertainty and to improve their beliefs. Trying to automate this process is a really hard problem. We propose here the design of a revision operator able to perform a spatial analysis in the context of one particular “application profile”: it identifies objects bearing a same variable bound through local constraints. The formal background, on which this operator is built, is a decision algorithm from Reiter [9]; then the heuristics, which help this algorithm to become tractable on a true scale application, are special patterns for clauses and “spatial confinement” of conflicts. This operator is “anytime”, because it uses “samples” and works on small (tractable) blocks, it reaggregates the partial revision results on larger blocks, thus we name it a “hierarchical block revision” operator. Finally we illustrate a particular application: a flooding propagation. Of course this is among possible approaches of “soft-computing” for geographic applications. On leave at: Centre de Recherche en Géomatique Pavillon Casault, Université Laval Québec, Qc, Canada – G1K 7P4 Université de Toulon et du Var, Avenue de l'Université, BP 132, 83957 La Garde Cedex, France This work is currently supported by the European Community under the IST-1999-14189 project.