Name
Abstract | ||
|---|---|---|
Qualitative possibilistic networks, also known as min-based possibilistic networks, are important tools for handling uncertain information in the possibility theory frame- work. Despite their importance, only the junction tree adaptation has been proposed for exact reasoning with such networks. This paper explores alternative algorithms using compilation techniques. We first propose possibilistic adaptations of standard compilation-based probabilistic methods. Then, we develop a new, purely possibilistic, method based on the transformation of the initial network into a possibilistic base. A comparative study shows that this latter performs better than the possibilistic adap- tations of probabilistic methods. This result is also confirmed by experimental results. |
Year | Venue | DocType |
|---|---|---|
2010 | UAI | Conference |
Volume | Citations | PageRank |
abs/1203.3465 | 13 | 0.72 |
References | Authors | |
5 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Raouia Ayachi | 1 | 52 | 8.02 |
| Nahla Ben Amor | 2 | 467 | 50.72 |
| Salem Benferhat | 3 | 2585 | 216.23 |
| Rolf Haenni | 4 | 371 | 33.39 |