Complexity of Inferences in Polytree-shaped Semi-Qualitative Probabilistic Networks

Semi-qualitative probabilistic networks (SQPNs) merge two important graphical model formalisms: Bayesian networks and qualitative probabilistic networks. They provide a very general modeling framework by allowing the combination of numeric and qualitative assessments over a discrete domain, and can be compactly encoded by exploiting the same factorization of joint probability distributions that are behind the Bayesian networks. This paper explores the computational complexity of semi-qualitative probabilistic networks, and takes the polytree-shaped networks as its main target. We show that the inference problem is coNP-Complete for binary polytrees with multiple observed nodes. We also show that inferences can be performed in time linear in the number of nodes if there is a single observed node. Because our proof is constructive, we obtain an efficient linear time algorithm for SQPNs under such assumptions. To the best of our knowledge, this is the first exact polynomial-time algorithm for SQPNs. Together these results provide a clear picture of the inferential complexity in polytree-shaped SQPNs.

[1]  Janneke H. Bolt,et al.  Upgrading Ambiguous Signs in QPNs , 2003, UAI.

[2]  Enrico Fagiuoli,et al.  2U: An Exact Interval Propagation Algorithm for Polytrees with Binary Variables , 1998, Artif. Intell..

[3]  L. C. van der Gaag,et al.  Exploiting non-monotonic influences in qualitative belief networks , 2000 .

[4]  Linda C. van der Gaag,et al.  Monotonicity in Bayesian Networks , 2004, UAI.

[5]  Marek J. Druzdzel,et al.  Belief Propagation in Qualitative Probabilistic Networks , 1993 .

[6]  Simon Parsons,et al.  Context-specific sign-propagation in qualitative probabilistic networks , 2001, Artif. Intell..

[7]  Janneke H. Bolt,et al.  Introducing Situational Influences in QPNs , 2003, ECSQARU.

[8]  Simon Parsons,et al.  A semiqualitative approach to reasoning in probabilistic networks , 1993, Appl. Artif. Intell..

[9]  Silja Renooij,et al.  From Qualitative to Quantitative Probabilistic Networks , 2002, UAI.

[10]  Fabio Gagliardi Cozman,et al.  Belief Updating and Learning in Semi-Qualitative Probabilistic Networks , 2005, UAI.

[11]  Simon Parsons,et al.  Propagation of Multiple Observations in QPNs Revisited , 2002, ECAI.

[12]  Marek J. Druzdzel,et al.  Efficient Reasoning in Qualitative Probabilistic Networks , 1993, AAAI.

[13]  Cassio Polpo de Campos.  Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence New Complexity Results for MAP in Bayesian Networks , 2022 .

[14]  Michael P. Wellman.  Fundamental Concepts of Qualitative Probabilistic Networks , 1990, Artif. Intell..

[15]  Denis Deratani Mauá,et al.  The Complexity of Approximately Solving Influence Diagrams , 2012, UAI.

[16]  Silja Renooij,et al.  Talking probabilities: communicating probabilistic information with words and numbers , 1999, Int. J. Approx. Reason..