A comparative study of compilation-based inference methods for min-based possibilistic networks

  • Authors:
  • Raouia Ayachi;Nahla Ben Amor;Salem Benferhat

  • Affiliations:
  • LARODEC, Institut Supérieur de Gestion Tunis, Le Bardo, Tunisie,CRIL-CNRS, Université d'Artois, France;LARODEC, Institut Supérieur de Gestion Tunis, Le Bardo, Tunisie;CRIL-CNRS, Université d'Artois, France

  • Venue:
  • ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Min-based possibilistic networks, which are compact representations of possibility distributions, are powerful tools for representing and reasoning with uncertain and incomplete information in the possibility theory framework. Inference in these graphical models has been recently the focus of several researches, especially under compilation. It consists in encoding the network into a Conjunctive Normal Form (CNF) base and compiling this latter to efficiently compute the impact of an evidence on variables. The encoding strategy of such networks can be either locally using local structure or globally using possibilistic local structure. This paper emphasizes on a comparative study between these strategies for compilation-based inference approaches in terms of CNF parameters, compiled bases parameters and inference time.