Skip to main content
Log in

Multi-agent Logics for Reasoning About Higher-Order Upper and Lower Probabilities

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

We present a propositional and a first-order logic for reasoning about higher-order upper and lower probabilities. We provide sound and complete axiomatizations for the logics and we prove decidability in the propositional case. Furthermore, we show that the introduced logics generalize some existing probability logics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. The notation is motivated by the logic \({\mathsf {LUPP}}\) from Savić et al. (2017b), where LUP stands for “lower and upper probability”, while the second P indicates that the logic is propositional. We add I to denote iteration of upper and lower operators.

  2. Also, note that the notions conjunctive and disjunctive are relative in this specific context, since the type of connective is closely related to the type of inequality that an operator uses. For example, the definition \(U_{\ge s}^G\alpha \equiv \bigvee _{a \in G}U_{\ge s}^a\alpha \) is equivalent to the “conjunctive’ definition \(U_{\le s}^G\alpha \equiv \bigwedge _{a \in G}U_{\le s}^a\alpha \).

  3. Here, for simplicity, we can assume that all the singletons are in \(\mathcal G\), in order to capture the operators indexed by individual agents.

References

  • Anger, B., & Lembcke, J. (1985). Infinitely subadditive capacities as upper envelopes of measures. Zeitschrift fur Wahrscheinlichkeitstheorie und Verwandte Gebiete, 68, 403–414.

    Article  Google Scholar 

  • de Cooman, G., & Hermans, F. (2008). Imprecise probability trees: Bridging two theories of imprecise probability. Artificial Intelligence, 172(11), 1400–1427.

    Article  Google Scholar 

  • Doder, D., Marković, Z., Ognjanović, Z., Perović, A., & Rašković, M. (2010). A probabilistic temporal logic that can model reasoning about evidence. In Proceedings of FoIKS. Lecture notes in computer science (pp. 9–24). Berlin: Springer.

  • Doder, D., Savić, N., & Ognjanović, Z. (2018). A decidable multi-agent logic with iterations of upper and lower probability operators. In Proceedings of FoIKS. Lecture notes in computer science (pp. 170–185). Berlin: Springer.

  • Dubois, D., & Prade, H. (1988). Possibility theory. New York: Plenum Press.

    Book  Google Scholar 

  • Fagin, R., & Halpern, J. (1994). Reasoning about knowledge and probability. Journal of the ACM, 41(2), 340–367.

    Article  Google Scholar 

  • Fagin, R., Halpern, J., & Megiddo, N. (1990). A logic for reasoning about probabilities. Information and Computation, 87(1–2), 78–128.

    Article  Google Scholar 

  • Fattorosi-Barnaba, M., & Amati, G. (1989). Modal operators with probabilistic interpretations I. Studia Logica, 46(4), 383–393.

    Article  Google Scholar 

  • Frish, A., & Haddawy, P. (1994). Anytime deduction for probabilistic logic. Artificial Intelligence, 69, 93–122.

    Article  Google Scholar 

  • Halpern, J. Y. (1990). An analysis of first-order logics of probability. Artificial Intelligence, 46, 311–350.

    Article  Google Scholar 

  • Halpern, J. Y., & Pucella, R. (2002). A logic for reasoning about upper probabilities. Journal of Artificial Intelligence Research, 17, 57–81.

    Article  Google Scholar 

  • Halpern, J., & Shore, R. (2004). Reasoning about common knowledge with infinitely many agents. Information and Computation, 191, 1–40.

    Article  Google Scholar 

  • Heifetz, A., & Mongin, P. (2001). Probability logic for type spaces. Games and Economic Behavior, 35, 31–53.

    Article  Google Scholar 

  • Huber, P. J. (1981). Robust statistics. New York: Wiley.

    Book  Google Scholar 

  • Hughes, G. E., & Cresswell, M. J. (1984). A companion to modal logic. London: Methuen.

    Google Scholar 

  • Kokkinis, I. (2018). The complexity of satisfiability in non-iterated and iterated probabilistic logics. Annals of Mathematics and Artificial Intelligence, 83(3–4), 351–382.

    Article  Google Scholar 

  • Kyburg, H. E. (1961). Probability and the logic of rational belief. Middletown, CT: Wesleyan University Press.

    Google Scholar 

  • Levi, I. (1980). The enterprise of knowledge. London: MIT Press.

    Google Scholar 

  • Lorentz, G. G. (1952). Multiply subadditive functions. Canadian Journal of Mathematics, 4(4), 455–462.

    Article  Google Scholar 

  • Meier, M. (2012). An infinitary probability logic for type spaces. Israel Journal of Mathematics, 192(1), 1–58.

    Article  Google Scholar 

  • Miranda, E. (2008). A survey of the theory of coherent lower previsions. International Journal of Approximate Reasoning, 48(2), 628–658.

    Article  Google Scholar 

  • Ognjanović, Z., & Rašković, M. (1999). Some probability logics with new types of probability operators. Journal of Logic and Computation, 9(2), 181–195.

    Article  Google Scholar 

  • Ognjanović, Z., & Rašković, M. (2000). Some first-order probability logics. Theoretical Computer Science, 247(1–2), 191–212.

    Article  Google Scholar 

  • Ognjanović, Z., Rasković, M., & Marković, Z. (2016). Probability logics: Probability-based formalization of uncertain reasoning. Berlin: Springer.

    Book  Google Scholar 

  • Rašković, M., Marković, Z., & Ognjanović, Z. (2008). A logic with approximate conditional probabilities that can model default reasoning. International Journal of Approximate Reasoning, 49(1), 52–66.

    Article  Google Scholar 

  • Savić, N., Doder, D., & Ognjanović, Z. (2017a). Logics with lower and upper probability operators. International Journal of Approximate Reasoning, 88, 148–168.

    Article  Google Scholar 

  • Savić, N., Doder, D., & Ognjanović, Z. (2017b). A first-order logic for reasoning about higher-order upper and lower probabilities. In Proceedings of ECSQARU. Lecture notes in artificial intelligence (pp. 491–500). Berlin: Springer.

  • Shafer, G. (1976). A mathematical theory of evidence. Princeton, NJ: Princeton University Press.

    Google Scholar 

  • Tomović, S., Ognjanović, Z., & Doder, D. (2015). Probabilistic common knowledge among infinite number of agents. In Proceedings of ECSQARU. Lecture notes in artificial intelligence (pp. 496–505). Berlin: Springer.

  • van der Hoek, W. (1997). Some consideration on the logics \(P_{F}D\). Journal of Applied Non-Classical Logics, 7(3), 287–307.

    Article  Google Scholar 

  • Walley, P. (1991). Statistical reasoning with imprecise probabilities. London: Chapman and Hall.

    Book  Google Scholar 

  • Walley, P. (2000). Towards a unified theory of imprecise probability. International Journal of Approximate Reasoning, 24(2–3), 125–148.

    Article  Google Scholar 

  • Zadeh, L. A. (1978). Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems, 1, 3–28.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nenad Savić.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was supported by the SNSF Project 200021_165549 Justifications and non-classical reasoning, by the Serbian Ministry of Education and Science through Projects ON174026, III44006 and ON174008, and by ANR-11-LABX-0040-CIMI.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Doder, D., Savić, N. & Ognjanović, Z. Multi-agent Logics for Reasoning About Higher-Order Upper and Lower Probabilities. J of Log Lang and Inf 29, 77–107 (2020). https://doi.org/10.1007/s10849-019-09301-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10849-019-09301-7

Keywords

Navigation