Abstract
Determining satisfiability of sets of formula formulated in a Nilsson style probabilistic logic (PSAT) by reduction to a system of linear (in)equations has been extensively studied, esp. in the propositional setting. The basic technique for coping with the potentially exponentially large (in terms of the formulae) linear system is column generation, which has been successful (in various forms) in solving problems of around 1000 formulae. Common to existing techniques is that the column generation model explicitly encodes all classical, i.e., non-probabilistic, knowledge. In this paper we introduce a straightforward but new hybrid method for PSAT that makes use of a classical solver in the column generation process. The benefits of this technique are twofold: first, we can, in practice, accommodate inputs with significantly larger classical parts, and thus which are overall larger, and second, we can accommodate inputs with supra-propositional classical parts, such as propositionally complete description logics. We validate our approach with an extensive series of experiments which show that our technique is competitive with traditional non-hybrid approaches in spite of scaling the expressivity of the classical part to the description logic \(\mathcal{SROIQ}\).
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
Hansen, P., Jaumard, B.: Probabilistic satisfiability. In: Handbook of Defeasible Reasoning and Uncertainty Management Systems, Algorithms for Uncertainty and Defeasible Reasoning, vol. 5, pp. 321–367. Kluwer, Dordrecht (2000)
Hansen, P., Jaumard, B., Nguetsé, G.B.D., de Aragão, M.P.: Models and algorithms for probabilistic and Bayesian logic. In: International Joint Conference on Artificial Intelligence, pp. 1862–1868 (1995)
Hansen, P., Perron, S.: Merging the local and global approaches to probabilistic satisfiability. International Journal of Approximate Reasoning 47(2), 125–140 (2008)
Hooker, J.N.: Quantitative approach to logical reasoning. Decision Support Systems 4, 45–69 (1988)
Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible \(\mathcal{SROIQ}\). In: KR, pp. 57–67 (2006)
Jaumard, B., Hansen, P., de Aragão, M.P.: Column generation methods for probabilistic logic. In: IPCOC, pp. 313–331 (1990)
Jaumard, B., Hansen, P., de Aragão, M.P.: Column generation methods for probabilistic logic. INFORMS Journal on Computing 3(2), 135–148 (1991)
Kazakov, Y.: SRIQ and SROIQ are harder than SHOIQ. In: KR, pp. 274–284 (2008)
Klinov, P., Parsia, B.: Probabilistic modeling and OWL: A user oriented introduction into P-\(\mathcal{SHIQ}\)(D). In: OWLED (2008)
Klinov, P., Parsia, B.: Practical reasoning in Probabilistic Description Logic. Tech.rep., University of Manchester (2011), http://www.cs.man.ac.uk/~klinovp/pubs/2011/psroiq-eval-report.pdf
Klinov, P., Parsia, B., Picado-Muiño, D.: The consistency of the medical expert system CADIAG-2: A probabilistic approach. Journal of Information Technology Research 4(1), 1–20 (2011)
Lukasiewicz, T.: Expressive probabilistic description logics. Artificial Intelligence 172(6-7), 852–883 (2008)
Nilsson, N.J.: Probabilistic logic. Artificial Intelligence 28(1), 71–87 (1986)
Reiter, R.: A theory of diagnosis from first principles. Artificial Intelligence 32, 57–95 (1987)
Sirin, E., Parsia, B., Grau, B.C., Kalyanpur, A., Katz, Y.: Pellet: A practical OWL-DL reasoner. Journal of Web Semantics 5(2), 51–53 (2007)
de Souza Andrade, P.S., da Rocha, J.C.F., Couto, D.P., da Costa Teves, A., Cozman, F.G.: A toolset for propositional probabilistic logic. In: Encontro Nacional de Inteligencia Artificial, pp. 1371–1380 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klinov, P., Parsia, B. (2011). A Hybrid Method for Probabilistic Satisfiability. In: Bjørner, N., Sofronie-Stokkermans, V. (eds) Automated Deduction – CADE-23. CADE 2011. Lecture Notes in Computer Science(), vol 6803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22438-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-22438-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22437-9
Online ISBN: 978-3-642-22438-6
eBook Packages: Computer ScienceComputer Science (R0)