A propositional probabilistic logic with discrete linear time for reasoning about evidence
From MaRDI portal
Publication:1928821
DOI10.1007/s10472-012-9307-9zbMath1269.03033OpenAlexW2011593799MaRDI QIDQ1928821
Miodrag Rašković, Zoran Marković, Dragan Doder, Aleksandar Perović, Zoran Ognjanović
Publication date: 4 January 2013
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-012-9307-9
Related Items (8)
Probabilistic Common Knowledge Among Infinite Number of Agents ⋮ Logics with lower and upper probability operators ⋮ Multi-agent logics for reasoning about higher-order upper and lower probabilities ⋮ Reasoning About Degrees of Confirmation ⋮ An epistemic probabilistic logic with conditional probabilities ⋮ Logics with Probability Operators ⋮ Probabilistic Temporal Logics ⋮ Applications of Logics About Simple Probabilities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the strength of temporal proofs
- Corrigendum to: ``The power of temporal proofs
- Probabilistic logic
- The power of temporal proofs
- The logic of time. A model-theoretic investigation into the varieties of temporal ontology and temporal discourse.
- Two views of belief: Belief as generalized probability and belief as evidence
- Axiomatising extended computation tree logic
- A logic for reasoning about probabilities
- A logic with approximate conditional probabilities that can model default reasoning
- An axiomatization of full Computation Tree Logic
- Coherent Conditional Probability in a Fuzzy Logic Setting
- Deciding full branching time logic
- “Sometimes” and “not never” revisited
- Probability logic
- Propositional temporal logics: decidability and completeness
- An intuitionistic logic with probabilistic operators
- A Probabilistic Logic with Polynomial Weight Formulas
- Completeness theorem for a logic with imprecise and conditional probabilities
- Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
This page was built for publication: A propositional probabilistic logic with discrete linear time for reasoning about evidence