ON POSSIBILISTIC AND PROBABILISTIC APPROXIMATIONS OF UNRESTRICTED BELIEF FUNCTIONS BASED ON THE CONCEPT OF FUZZY T-PREORDER
DOI10.1142/S0218488502001417zbMATH Open1084.68898OpenAlexW4241569392MaRDI QIDQ4822682FDOQ4822682
Authors: Enric Hernández, J. Recasens
Publication date: 25 October 2004
Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218488502001417
Recommendations
Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30)
Cites Work
- Fuzzy sets as a basis for a theory of possibility
- Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
- Consonant approximations of belief functions
- On the structure of F-indistinguishability operators
- Similarity relations and fuzzy orderings
- A computationally efficient approximation of Dempster-Shafer theory
Cited In (6)
- Consonant approximations of belief functions
- An uncertainty interchange format with imprecise probabilities
- APPROXIMATION OF BELIEF FUNCTIONS
- A MAP CHARACTERIZING THE FUZZY POINTS AND COLUMNS OF A T-INDISTINGUISHABILITY OPERATOR
- Semantics of the relative belief of singletons
- Approximation by Filter Functions
This page was built for publication: ON POSSIBILISTIC AND PROBABILISTIC APPROXIMATIONS OF UNRESTRICTED BELIEF FUNCTIONS BASED ON THE CONCEPT OF FUZZY T-PREORDER
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4822682)