Some Varieties of Qualitative Probability
@inproceedings{Wellman1994SomeVO, title={Some Varieties of Qualitative Probability}, author={Michael P. Wellman}, booktitle={IPMU}, year={1994} }
In this essay I present a general characterization of qualitative probability, defining the concept of a qualitative probability language and proposing some bases for comparison. In particular, enumerating some of the distinctions that can be supported by a qualitative probability language induces a partial taxonomy of possible approaches. I discuss some of these in further depth, identify central issues, and suggest some general comparisons.
36 Citations
Research Issues in Qualitative and Abstract Probability
- Computer ScienceAI Mag.
- 1994
A workshop on qualitative and abstract probability brought together a mix of active researchers from academia, industry, and government interested in the practical and theoretical impact of these abstractions on techniques, methods, and tools for solving complex AI tasks.
An axiomatization of qualitative probability
- Computer Science2007 5th International Symposium on Intelligent Systems and Informatics
- 2007
This work presents a part of its work on the problem of sound, strongly complete and decidable axiomatization of the notion of qualitative probability of qualitative probabilities.
Qualitative Possibilities and Necessities
- MathematicsECSQARU
- 2009
The aim of this paper is to give a syntactical flavor to the subject providing a sound and complete axiomatization of qualitative possibility relations.
An Axiomatizatin of Qualitative Probability
- Computer Science
- 2008
This work presents a part of its work on the problem of sound, strongly complete and decidable axiomatization of the notion of qualitative probability of qualitative probabilities.
A logic for reasoning about qualitative probability
- Mathematics
- 2010
We offer extended completeness theorem for probabilistic logic that combines higher-order probabilities (nesting of probability operators) and the qualitative probability operator.
A Symbolic Approach To Uncertainty Management
- Computer ScienceApplied Intelligence
- 2004
A new symbolic approach to deal with the uncertainty encountered in common-sense reasoning is presented, which enables us to represent the uncertainty by using linguistic expressions of the interval [Certain, Totally uncertain].
Comparing normative argumentation to other probabilistic systemsSimon
- Philosophy
- 1996
This paper discusses a system of argu-mentation with a probabilistic semantics and compares it to two other probabilistic systems|Wellman's qualitative probabilis-tic networks and Neufeld's…
Defining Normative Systems for Qualitative Argumentation
- PhilosophyFAPR
- 1996
This paper attempts to combine the advantages of both approaches to providing a qualitative method for reasoning under uncertainty by defining systems of argumentation that have a probabilistic semantics.
Towards Temporal Reasoning Using Qualitative Probabilities
- Philosophy, Computer ScienceFLAIRS Conference
- 2002
A new abstraction is proposed here that represents probability changes over time using four values: increasing, decreasing, constant, and unknown.
Enrichment of Qualitative Beliefs for Reasoning under Uncertainty
- Computer Science2007 10th International Conference on Information Fusion
- 2007
This paper deals with enriched qualitative belief functions for reasoning under uncertainty and for combining information expressed in natural language through linguistic labels with q-operators, a direct extension of the classical qualitative operators proposed in the Dezert-Smarandache theory of plausible and paradoxist reasoning.
References
SHOWING 1-10 OF 23 REFERENCES
Research Issues in Qualitative and Abstract Probability
- Computer ScienceAI Mag.
- 1994
A workshop on qualitative and abstract probability brought together a mix of active researchers from academia, industry, and government interested in the practical and theoretical impact of these abstractions on techniques, methods, and tools for solving complex AI tasks.
Qualitative probability as an intensional logic
- PhilosophyJ. Philos. Log.
- 1975
The main aim of this paper is to study the logic of a binary sentential oper- ator ‘z=‘, with the intended meaning ‘is at least as probable as’, with a choice of axioms heavily dependent of a theorem due to Kraft et al.
Can Uncertainty Management be Realized in a Finite Totally Ordered Probability Algebra?
- MathematicsUAI
- 1989
A Symbolic Generalization of Probability Theory
- Computer ScienceAAAI
- 1992
This thesis proposes an abstract belief calculus that is not committed to numbers (nor to any specific set of degrees of belief) and yet has the key features of probability calculus.
Conditional independence and its representations
- Computer ScienceKybernetika
- 1989
Axiomatic and graphical representations are presented which are both sound and complete for specialized types of independence statements and their representations.
Efficient Reasoning in Qualitative Probabilistic Networks
- Computer ScienceAAAI
- 1993
A polynomial time algorithm for reasoning in QPNs is introduced, based on local sign propagation, that preserves the network structure and determines the effect of evidence on all nodes in the network.