Titlebook: Uncertainty in Knowledge-Based Systems; International Confer B. Bouchon,R. R. Yager Conference proceedings 1987 Springer-Verlag Berlin Heid

linear

Possibilistic qualification and default rules,tatements. We investigate the representation of possibility qualified statements via the theory of approximate reasoning. We apply our representation scheme to some examples. In particular, we show that this scheme gives reasonable results for a knowledge base in which we have "normally Quakers are

Largess

Propagation of uncertainties and inaccuracies in knowledge-based system,s. We study several fuzzy implications and combination operators used to define a generalized modus ponens in the case where observations are slightly different from the premise of rules of the knowledge base, but a conclusion is required. We compare the properties of these tools to provide indicati

Landlocked

The principle of minimum specificity as a basis for evidential reasoning,ility and plausibility attached to statements specify a class of bodies of evidence. Using newly appeared measures of specificity, a principle is stated in order to select, among these bodies of evidence, the one which suitably represents the available information in the least arbitrary way. It is s

BIBLE

cuticle

endure

O-theory: A probabilistic alternative to fuzzy set theory,lism, which is extended to include a complete set of basic operations for handling uncertainties in a set-theoretic framework. The new operator theory, O-Theory, retains the probabilistic flavor of Dempster‘s original point-to-set mappings but includes the potential for defining a range of operators

Brochure

Efficient deduction in fuzzy logic,ent and consequent parts. Though it is a very powerful approximate reasoning tool (from a theoretical point of view), this technique may result in unacceptably slow executions if inappropriately implemented. There are several ways to avoid the inefficiency bottleneck. One of them, that is the object

arrogant

GENUS

焦慮