Abstract
The paper presents a sound and strongly complete axiomatization of reasoning about polynomial weight formulas. In addition, the PSPACE decision procedure for polynomial weight formulas developed by Fagin, Halpern and Megiddo works for our logic as well. The introduced formalism allows the expression of qualitative probability statements, conditional probability and Bayesian inference.
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
Canny, J.: Some algebraic and geometric computations in PSPACE. In: Proc. of XX ACM Symposium on theory of computing, pp. 460–467 (1978)
Fagin, R., Halpern, J., Megiddo, N.: A logic for reasoning about probabilities. Information and Computation 87(1–2), 78–128 (1990)
Heifetz, A., Mongin, P.: Probability logic for type spaces. Games and economic behavior 35, 31–53 (2001)
Lehmann, D.: Generalized qualitative probability: Savage revisited. In: Horvitz, E., Jensen, F. (eds.) UAI 1996. Procs. of 12th Conference on Uncertainty in Artificial Intelligence, pp. 381–388 (1996)
Lukasiewicz, T.: Probabilistic Default Reasoning with Conditional Constraints. Annals of Mathematics and Artificial Intelligence 34, 35–88 (2002)
Lukasiewicz, T.: Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: Complexity, algorithms, and implementation. International Journal of Approximate Reasoning 44(3), 301–321 (2007)
Marchioni, E., Godo, L.: A Logic for Reasoning about Coherent Conditional Probability: A Modal Fuzzy Logic Approach. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 213–225. Springer, Heidelberg (2004)
Meier, M.: An infinitary probability logic for type spaces. Israel J. of Mathematics, ∞
Narens, L.: On qualitative axiomatizations for probability theory. Journal of Philosophical Logic 9(2), 143–151 (1980)
Nilsson, N.: Probabilistic logic. Artificial intelligence 28, 71–87 (1986)
Ognjanović, Z., Rašković, M.: A logic with higher order probabilities. Publications de l’institut mathematique, Nouvelle série, tome 60(74), 1–4 (1996)
Ognjanović, Z., Rašković, M.: Some probability logics with new types of probability operators. J. Logic Computat. 9(2), 181–195 (1999)
Ognjanović, Z., Rašković, M.: Some first-order probability logics. Theoretical Computer Science 247(1–2), 191–212 (2000)
Ognjanović, Z., Timotijević, T., Stanojević, A.: Database of papers about probability logics. Mathematical institute Belgrade (2005), http://problog.mi.sanu.ac.yu/
Ognjanović, Z., Marković, Z., Rašković, M.: Completeness Theorem for a Logic with imprecise and conditional probabilities. Publications de L’Institute Matematique (Beograd) 78(92), 35–49 (2005)
Ognjanović, Z., Perović, A., Rašković, M.: Logic with the qualitative probability operator. Logic journal of IGPL, doi:10.1093/jigpal/jzm031
Rašković, M.: Classical logic with some probability operators. Publications de l’institut mathematique, Nouvelle série, tome 53(67), 1–3 (1993)
Rašković, M., Ognjanović, Z.: A first order probability logic LP Q . Publications de l’institut mathematique, Nouvelle série, tome 65(79), 1–7 (1999)
Rašković, M., Ognjanović, Z., Marković, Z.: A logic with Conditional Probabilities. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 226–238. Springer, Heidelberg (2004)
van der Hoek, W.: Some considerations on the logic P F D: a logic combining modality and probability. Journal of Applied Non-Classical Logics 7(3), 287–307 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perović, A., Ognjanović, Z., Rašković, M., Marković, Z. (2008). A Probabilistic Logic with Polynomial Weight Formulas. In: Hartmann, S., Kern-Isberner, G. (eds) Foundations of Information and Knowledge Systems. FoIKS 2008. Lecture Notes in Computer Science, vol 4932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77684-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-77684-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77683-3
Online ISBN: 978-3-540-77684-0
eBook Packages: Computer ScienceComputer Science (R0)