共查询到20条相似文献,搜索用时 125 毫秒
1.
Didier Dubois Lluis Godo Ramon López De Màntaras Henri Prade 《Journal of Intelligent Information Systems》1993,2(4):319-363
This paper investigates the possibility of performing automated reasoning in probabilistic knowledge bases when probabilities are expressed by means of linguistic quantifiers. Data are expressed in terms of ill-known conditional probabilities represented by linguistic terms. Each linguistic term is expressed as a prescribed interval of proportions. Then instead of propagating numbers, qualitative terms are propagated in accordance with the numerical interpretation of these terms. The quantified syllogism, modeling the chaining of probabilistic rules, is studied in this context. It is shown that a qualitative counterpart of this syllogism makes sense and is fairly independent of the thresholds defining the linguistically meaningful intervals, provided that these threshold values remain in accordance with the intuition. The inference power is less than a full-fledged probabilistic constraint propagation device but corresponds better to what could be thought of as commonsense probabilistic reasoning. Suggestions that may improve the inferencing power in the qualitative setting are proposed.This paper is an extended and revised version of a paper entitled A Symbolic Approach to Reasoning with Linguistic Quantifiers inProc. 8th Conf. Uncertainty in Artificial Intelligence Dubois, D., Wellman, M.P., D'Ambrosio, B., and Smets, Ph. (Eds.), Morgan Kaufmann, pp. 74–82, 1992. 相似文献
2.
Signed Systems for Paraconsistent Reasoning 总被引:3,自引:0,他引:3
We present a novel approach to paraconsistent reasoning, that is, to reasoning from inconsistent information. The basic idea is the following. We transform an inconsistent theory into a consistent one by renaming all literals occurring in the theory. Then, we restore some of the original contents of the theory by introducing progressively formal equivalences linking the original literals to their renamings. This is done as long as consistency is preserved. The restoration of the original contents of the theory is done by appeal to default logic. The overall approach provides us with a family of paraconsistent consequence relations.Our approach is semantical because it works at the level of the propositions; it deals with the semantical link between a proposition and its negation. The approach is therefore independent of the combination of the connectives that are actually applied to the propositions in order to form entire formulas. 相似文献
3.
4.
5.
We present a point-based spatiotemporal first-order logic for representing the qualitative and quantitative spatial temporal knowledge needed to reason about motion in a two-dimensional space. A feature of the logic is the uniform treatment of space and time. The knowledge of a simplified world, a two-dimensional street network with active traffic lights, is represented, and the reasoning problem of how a robot moves from one place to another in the world is formalized with the proposed logic. 相似文献
6.
7.
A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning 总被引:1,自引:0,他引:1
James Delgrande Torsten Schaub Hans Tompits Kewen Wang 《Computational Intelligence》2004,20(2):308-334
In recent years, there has been a large amount of disparate work concerning the representation and reasoning with qualitative preferential information by means of approaches to nonmonotonic reasoning. Given the variety of underlying systems, assumptions, motivations, and intuitions, it is difficult to compare or relate one approach with another. Here, we present an overview and classification for approaches to dealing with preference. A set of criteria for classifying approaches is given, followed by a set of desiderata that an approach might be expected to satisfy. A comprehensive set of approaches is subsequently given and classified with respect to these sets of underlying principles. 相似文献
8.
定性空间表示与定性空间的研究与发展 总被引:1,自引:2,他引:1
1 引言空间推理是指利用空间理论和人工智能技术对空间对象建模、描述和表示,并据此对空间对象间的空间关系进行的定性或定量的分析和处理过程。在描述和推断空间对象间的空间关系时,要获得精确、定量的数据通常是不可能的或不必要的,在这种情况下,可能要用到关于空间关系的定性空间推理。定性空间推理是一个 相似文献
9.
In this paper we discuss reasoning about reasoning in a multiple agent scenario. We consider agents that are perfect reasoners, loyal, and that can take advantage of both the knowledge and ignorance of other agents. The knowledge representation formalism we use is (full) first order predicate calculus, where different agents are represented by different theories, and reasoning about reasoning is realized via a meta-level representation of knowledge and reasoning. The framework we provide is pretty general: we illustrate it by showing a machine checked solution to the three wisemen puzzle. The agents' knowledge is organized into units: the agent's own knowledge about the world and its knowledge about other agents are units containing object-level knowledge; a unit containing meta-level knowledge embodies the reasoning about reasoning and realizes the link among units. In the paper we illustrate the meta-level architecture we propose for problem solving in a multi-agent scenario; we discuss our approach in relation to the modal one and we compare it with other meta-level architectures based on logic. Finally, we look at a class of applications that can be effectively modeled by exploiting the meta-level approach to reasoning about knowledge and reasoning. 相似文献
10.
方向关系的定性表示与推理 总被引:4,自引:0,他引:4
方向关系是GIS中的一个重要的理论问题。本文重点讨论方向关系的定性表示与推理。文章首先讨论了基于井字空间的方向关系定性表示,然后介绍了基于方向关系组合运算表的方向关系定性推理,最后对我们现在和将来的一些研究进行了叙述,并对我们的工作做了总结。 相似文献
11.
12.
13.
Informational Logic as a Tool for Automated Reasoning 总被引:2,自引:0,他引:2
Paola Forcheri Paolo Gentilini Maria Teresa Molfino 《Journal of Automated Reasoning》1998,20(1-2):167-190
A logical entropy-based Informational Logic is presented which provides new tools for probabilistic automated reasoning and knowledge representation. Applications in automated theorem proving are examined, and a decision theory for probabilistic theorems is proposed. 相似文献
14.
15.
Juan Carlos Augusto 《Artificial Intelligence Review》2001,16(4):301-333
Temporal reasoning started to be considered as a subject of study in artificial intelligence in the late 1970's. Since then several ways to represent and use temporal knowledge have been suggested. As a result of that, there are several formalisms capable of coping with temporal notions in some way or other. They range from isolated proposals to complex systems where the temporal aspect is used together with other important features for the task of modelling an intelligent agent. The purposes of this article are to summarize logic-based temporal reasoning research and give a glance on the different research tracks envisaging future lines of research. It is intended to be useful to those who need to be involved in systems having these characteristics and also an occasion to present newcomers some problems in the area that still waits for a solution. 相似文献
16.
We present a general approach for representing and reasoning with sets of defaults in default logic, focusing on reasoning about preferences among sets of defaults. First, we consider how to control the application of a set of defaults so that either all apply (if possible) or none do (if not). From this, an approach to dealing with preferences among sets of default rules is developed. We begin with an ordered default theory , consisting of a standard default theory, but with possible preferences on sets of rules. This theory is transformed into a second, standard default theory wherein the preferences are respected. The approach differs from other work, in that we obtain standard default theories and do not rely on prioritized versions of default logic. In practical terms this means we can immediately use existing default logic theorem provers for an implementation. Also, we directly generate just those extensions containing the most preferred applied rules; in contrast, most previous approaches generate all extensions, then select the most preferred. In a major application of the approach, we show how semimonotonic default theories can be encoded so that reasoning can be carried out at the object level. With this, we can reason about default extensions from within the framework of a standard default logic. Hence one can encode notions such as skeptical and credulous conclusions, and can reason about such conclusions within a single extension. 相似文献
17.
根据作战方案评估要素对评估系统的要求进行了系统功能需求分析,根据该分析设计了作战方案评估系统的总体架构,采用面向对象知识表示法构建了评估系统的知识库,设计了基于规则推理方法的系统推理机,并给出了解释子系统的解释机制。该系统能够利用军事专家的经验和军事决策规则对作战方案进行评估,降低了人的主观因素对评估结果的影响,同时提高了评估结论的可信度。 相似文献
18.
Nilsson教授首先提出了代数格应用于概念知识表示的思想.其优点在于知识表示的代数特性和图示特性,在此基础上.表文把代数格与PROLOG相结合.定义了一种基于概念的逻辑编程语言.其语言具有比PROLOG更抽象、更方便的编程风格.此外.给出了该逻辑编程语言的匹配算法. 相似文献
19.
定性映射是从哲学上事物的质-量互变规律出发,以感觉特征抽取为依托而建立的脑思维数学模型。文章以定性映射基本定义为基础讨论了属性Petri网的基本模型,给出了其形式定义和基本运行机制,描述了基于属性Petri网的知识表示模式,最后给出了属性Petri网的相应推理算法。该模型在以定性判断为特点的诊断系统中能得到较好地应用。 相似文献