Abstract
In this paper, we investigate the Probabilistic Satisfiability Problem, and its relation with the classical Satisfiability Problem, looking for a possible polynomial-time reduction. For this, we present an Atomic Normal Form to the probabilistic satisfiability problem and then we define a Probabilistic Entailment relation, showing its inherent properties. At the end, we enunciate and refute a conjecture that could lead to the desired polynomial-time reduction.
This work was supported by Fapesp Project 2008/03995-5 (LogProb).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boole, G.: An Investigation of the Laws of Thought, on which are Founded the Mathematical Theories of Logic and Probabilities. Walton and Maberley, Londres (1854); reprint: Dover, Nova York (1958)
Cook, S.: The Complexity of Theorem Proving Procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151–158. ACM, New York (1971)
de Finetti, B.: Problemi determinati e indeterminati nel calcolo delle probabilita. Rendiconti Reale Accademia dei Lincei 6(XII), 367–373 (1930)
Georgakopoulos, G., Kavvadias, D., Papadimitriou, C.H.: Probabilistic Satisfiability. Journal of Complexity 4, 1–11 (1988)
Hailperin, T.: Best possible inequalities for the probability of a logical function of events. Amor. Math. Monthly 72, 343–359 (1965)
Hansen, P., Jaumard, B.: Probabilistic satisfiability. Technical Report G-96-31, Les Cahiers du GERAD, École Polytechnique de Montréal (1996)
Hansen, P., Jaumard, B., Nguetse, G.D., Aragão, M.P.: Models and Algorithms for Probabilistic and Bayesian Logic. In: IJCAI 1995: Proceedings of the 14th International Joint Conference on Artificial Intelligence, p. 1868. Morgan Kaufmann, San Francisco (1995)
Nilsson, N.J.: Probabilistic Logic. Artificial Intelligence 28, 71–87 (1986)
Prasolov, V.V., Tikhomirov, V.M.: Geometry, Translations of Mathematical Monographs, vol. 200, pp. 43–44. American Mathematical Society, Providence (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Finger, M., De Bona, G. (2010). A Refuted Conjecture on Probabilistic Satisfiability. In: da Rocha Costa, A.C., Vicari, R.M., Tonidandel, F. (eds) Advances in Artificial Intelligence – SBIA 2010. SBIA 2010. Lecture Notes in Computer Science(), vol 6404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16138-4_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-16138-4_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16137-7
Online ISBN: 978-3-642-16138-4
eBook Packages: Computer ScienceComputer Science (R0)