Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Andersen, K.A., Characterizing Consistency for a Subclass of Horn Clauses, Mathematical Programming, 66, 257–271, 1994.
Andersen, K.A., and J.N. Hooker, Bayesian Logic, Decision Support Systems 11, 191–210, 1994.
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).
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.
Chen, P.C., P. Hansen and B. Jaumard, Partial Pivoting in Vertex Enumeration, GERAD Research Report 92-15, Montréal, 1992.
Crama, Y. P., P. Hansen and B. Jaumard, The Basic Algorithm for Pseudo-Boolean Programming Revisited, Discrete Applied Mathematics 29 (1990) 171–186.
Dyer, M.E., On the Complexity of Vertex Enumeration Methods, Mathematics of Operations Research 8(3) (1983) 381–402.
Frisch, A. M., and P. Haddawy, Anytime Deduction for Probabilistic Logic, Artificial Intelligence 69 (1994) 93–122.
Georgakopoulos, G., D. Kavvadias and C.H.Papadimitriou, Probabilistic Satisfiability, Journal of Complexity 4 (1988) 1–11.
Hailperin, T., Best Possible Inequalities for the Probability of a Logical Function of Events, American Mathematical Monthly 72 (1965) 343–359.
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).
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.
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.
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.
Jaumard, B., P. Hansen and M. Poggi de Aragão, Column Generation Methods for Probabilistic Logic, ORSA Journal on Computing 3 (1991) 135–148.
Kavvadias, D., and C.H. Papadimitriou, Linear Programming Approach to Reasoning about Probabilities, Annals of Mathematics and Artificial Intelligence 1 (1990) 189–205.
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).
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.
Nilsson, N.J., Probabilistic Logic, Artificial Intelligence 28 (1986) 71–87.
Nilsson, N.J., Probabilistic Logic Revisited, Artificial Intelligence 59 (1993) 39–42.
Pearl, J., Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Mateo, California, 1988.
Shachter, R., Evaluating Influence Diagrams, Operations Research 34 (1986) 871–882.
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.
Van der Gaag, L.C., Probability-Based Models for Plausible Reasoning, Ph.D. Thesis, University of Amsterdam, 1990.
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.
Zemel, E., Polynomial Algorithms for Estimating Networks Reliability, Networks 12, 439–452, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Douanya Nguetsé, GB., Hansen, P., Jaumard, B. (1995). Probabilistic satisfiability and decomposition. In: Froidevaux, C., Kohlas, J. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1995. Lecture Notes in Computer Science, vol 946. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60112-0_18
Download citation
DOI: https://doi.org/10.1007/3-540-60112-0_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60112-8
Online ISBN: 978-3-540-49438-6
eBook Packages: Springer Book Archive