Compiling min-based possibilistic causal networks: a mutilated-based approach

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

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

  • Venue:
  • ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Qualitative causal possibilistic networks are important tools for handling uncertain information in the possibility theory framework. Despite their importance, no compilation has been performed to ensure causal reasoning in possibility theory framework. This paper proposes two compilation-based inference algorithms for min-based possibilistic causal networks. The first is a possibilistic adaptation of the probabilistic inference method [8] and the second is a purely possibilistic approach. Both of them are based on an encoding of the network into a propositional theory and a compilation of this output in order to efficiently compute the effect of both observations and interventions, while adopting a mutilation strategy.