Skip to main content

A First-Order Dynamic Probability Logic

  • Conference paper
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2013)

Abstract

We introduce a Hilbert-style first-order dynamic probability logic and prove the strong completeness theorem for the class of rigid measurable models.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Doder, D., Ognjanović, Z., Marković, Z.: An Axiomatization of a First-order Branching Time Temporal Logic. Journal of Universal Computer Science 16(11), 1439–1451 (2010)

    MathSciNet  MATH  Google Scholar 

  2. Feldman, Y.A., Harel, D.: A Probabilistic Dynamic Logic. Journal of Computer and System Sciences 28, 193–215 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  3. Guelev, D.P.: A Propositional Dynamic Logic with Qualitative Probabilities. Journal of Philosophical Logic 28, 575–605 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Halpern, J.Y.: An Analysis of First-order Logics of Probability. Artificial Intelligence 46, 311–350 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kooi, B.P.: Probabilistic Dynamic Epistemic Logic. Journal of Logic, Language and Information 12, 381–408 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ognjanović, Z., Rašković, M.: Some First-order Probability Logics. Theoretical Computer Science 247(1-2), 191–212 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ognjanović, Z.: Completeness Theorem for a First Order Linear-time Logic. Publications de L’institut Mathématique, Nouvelle Série 69(83), 1–7 (2001)

    Google Scholar 

  8. Ognjanović, Z.: Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity. Journal of Logic and Computation 16(2), 257–285 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ognjanović, Z., Doder, D., Marković, Z.: A Branching Time Logic with Two Types of Probability Operators. In: Benferhat, S., Grant, J. (eds.) SUM 2011. LNCS, vol. 6929, pp. 219–232. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Renardel de Lavalette, G., Kooi, B., Verburgge, R.: Strong Completeness and Limited Canonicity for PDL and Similar Logics. Journal of Logic, Language and Information 17(1), 69–87 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Sack, J.: Extending Probabilistic Dynamic Epistemic Logic. Synthese 169(2), 241–257 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Stirling, C.: Modal and temporal logic. In: Handbook of Logic in Computer Science, vol. 2, pp. 477–563 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ognjanović, Z., Perović, A., Doder, D. (2013). A First-Order Dynamic Probability Logic. In: van der Gaag, L.C. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2013. Lecture Notes in Computer Science(), vol 7958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39091-3_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39091-3_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39090-6

  • Online ISBN: 978-3-642-39091-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics