Compiling Possibilistic Networks: Alternative Approaches to Possibilistic Inference

Details Compiling Possibilistic Networks: Alternative Approaches to Possibilistic Inference Compiling Possibilistic Networks: Alternative Approaches to Possibilistic Inference

2012-03-15

arxiv.org/abs/1203.3465v1

Computer Science

Artificial Intelligence

Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Compiling Possibilistic Networks: Alternative Approaches to Possibilistic Inference does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compiling Possibilistic Networks: Alternative Approaches to Possibilistic Inference, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compiling Possibilistic Networks: Alternative Approaches to Possibilistic Inference will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-32056