Computational geometry: an introduction
Computational geometry: an introduction
Using possibility theory in expert systems
Fuzzy Sets and Systems
Inference in Possibilistic Hypergraphs
IPMU '90 Proceedings of the 3rd International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems: Uncertainty in Knowledge Bases
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Symbolic Evidence, Arguments, Supports and Valuation Networks
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Axioms for probability and belief-function proagation
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
International Journal of Approximate Reasoning
On the Use of Possibilistic Bases for Local Computations in Product-Based Possibilistic Networks
CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
| Hi-index | 0.00 |
Valuation based systems verifying an idempotent property are studied. A partial order is defined between the valuations giving them a lattice structure. Then, two different strategies are introduced to represent valuations: as infimum of the most informative valuations or as supremum of the least informative ones. It is studied how to carry out computations with both representations in an efficient way. The particular cases of finite sets and convex polytopes are considered.