Probabilistic satisfiability and decomposition

  • Guy-Blaise Douanya Nguetsé
  • Pierre Hansen
  • Brigitte Jaumard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 946)


Given a set of logical sentences together with probabilities that these sentences are true, the probabilistic satisfiability (psat) problem consists, in its decision version, in finding whether these probabilities are consistent, and in its optimization version in determining best possible lower and upper bounds on the probability that an additional sentence be true. Van der Gaag recently proposed a partially quantified belief network model which may be viewed as a decomposition-oriented version of psat. Both models give the same bounds, which implies that psat implicitly takes into account some independence relations. A column-generation algorithm is proposed for the decomposition form of psat and shown to have several advantages over a similar algorithm for the usual form, mainly in the exploitation of the sparsity of the matrix of coefficients.


Probabilistic Satisfiability Decomposition Belief Network 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Andersen, K.A., Characterizing Consistency for a Subclass of Horn Clauses, Mathematical Programming, 66, 257–271, 1994.Google Scholar
  2. [2]
    Andersen, K.A., and J.N. Hooker, Bayesian Logic, Decision Support Systems 11, 191–210, 1994.Google Scholar
  3. [3]
    Boole, G., An Investigation of the Laws of Thought, on which are Founded the Mathematical Theories of Logic and Probabilities, London: Walton and Maberley, 1854 (reprint New York: Dover 1958).Google Scholar
  4. [4]
    Chen, P.C., P. Hansen and B. Jaumard, On-Line and Off-Line Vertex Enumeration by Adjacency Lists, Operations Research Letters 10(7) (1991) 403–409.Google Scholar
  5. [5]
    Chen, P.C., P. Hansen and B. Jaumard, Partial Pivoting in Vertex Enumeration, GERAD Research Report 92-15, Montréal, 1992.Google Scholar
  6. [6]
    Crama, Y. P., P. Hansen and B. Jaumard, The Basic Algorithm for Pseudo-Boolean Programming Revisited, Discrete Applied Mathematics 29 (1990) 171–186.Google Scholar
  7. [7]
    Dyer, M.E., On the Complexity of Vertex Enumeration Methods, Mathematics of Operations Research 8(3) (1983) 381–402.Google Scholar
  8. [8]
    Frisch, A. M., and P. Haddawy, Anytime Deduction for Probabilistic Logic, Artificial Intelligence 69 (1994) 93–122.Google Scholar
  9. [9]
    Georgakopoulos, G., D. Kavvadias and C.H.Papadimitriou, Probabilistic Satisfiability, Journal of Complexity 4 (1988) 1–11.CrossRefGoogle Scholar
  10. [10]
    Hailperin, T., Best Possible Inequalities for the Probability of a Logical Function of Events, American Mathematical Monthly 72 (1965) 343–359.Google Scholar
  11. [11]
    Hailperin, T., Boole's Logic and Probability, Studies in Logic and Foundations of Mathematics 85, New York: North Holand, 1986, 2nd edition (first edition, 1976).Google Scholar
  12. [12]
    Hansen, P., B. Jaumard and M. Poggi de Aragão, Mixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem, Integer Programming and Combinatorial Optimization II, (Balas, E., G. Cornuejols and R. Kannan, Editors), Pittsburgh: Carnegie Mellon University, 165–180, 1992.Google Scholar
  13. [13]
    Hansen, P., B. Jaumard and M. Poggi de Aragão, Boole's Conditions of Possible Experience and Reasoning Under Uncertainty, to appear in Discrete Applied Mathematics, 1995.Google Scholar
  14. [14]
    Hansen, P., B. Jaumard and G.B. Douanya Nguetsé, Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures, GERAD Research Report G-94-01, February 1994.Google Scholar
  15. [15]
    Jaumard, B., P. Hansen and M. Poggi de Aragão, Column Generation Methods for Probabilistic Logic, ORSA Journal on Computing 3 (1991) 135–148.Google Scholar
  16. [16]
    Kavvadias, D., and C.H. Papadimitriou, Linear Programming Approach to Reasoning about Probabilities, Annals of Mathematics and Artificial Intelligence 1 (1990) 189–205.Google Scholar
  17. [17]
    Kachian, L.G., A Polynomial Algorithm in Linear Programming (in Russian), Doklady Akademii Nauk SSSR 224 (1979) 1093–1096 (English translation: Soviet Mathematics Doklady 20 (1979) 191–194).Google Scholar
  18. [18]
    Lauritzen, S.L., and D.J. Spiegelhalter, Local Computations with Probabilities on Graphical Structures and their Applications to Expert Systems, Journal of the Royal Statistical Society B50 (1988) 157–224.Google Scholar
  19. [19]
    Nilsson, N.J., Probabilistic Logic, Artificial Intelligence 28 (1986) 71–87.CrossRefGoogle Scholar
  20. [20]
    Nilsson, N.J., Probabilistic Logic Revisited, Artificial Intelligence 59 (1993) 39–42.MathSciNetGoogle Scholar
  21. [21]
    Pearl, J., Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Mateo, California, 1988.Google Scholar
  22. [22]
    Shachter, R., Evaluating Influence Diagrams, Operations Research 34 (1986) 871–882.Google Scholar
  23. [23]
    Tarjan, R.E., and M. Yannakakis, Simple Linear-time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs and Selectively Reduce Acyclic Hypergraphs, SIAM Journal of Computing 13 (1984) 566–579.Google Scholar
  24. [24]
    Van der Gaag, L.C., Probability-Based Models for Plausible Reasoning, Ph.D. Thesis, University of Amsterdam, 1990.Google Scholar
  25. [25]
    Van der Gaag, L.C., Computing Probability Intervals Under Independency Constraints, in P.P. Bonissone, M. Henrion, L.N. Kanal and J.F. Lemmer (Editors) Uncertainty in Artificial Intelligence 6 (1991) 457–466.Google Scholar
  26. [26]
    Zemel, E., Polynomial Algorithms for Estimating Networks Reliability, Networks 12, 439–452, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Guy-Blaise Douanya Nguetsé
    • 1
  • Pierre Hansen
    • 2
  • Brigitte Jaumard
    • 3
  1. 1.École Polytechnique de MontréalCanada
  2. 2.GERAD and École des Hautes Études Commerciales de MontréalCanada
  3. 3.GERAD and École Polytechnique de MontréalCanada

Personalised recommendations