Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
From MaRDI portal
Publication:5477458
DOI10.1093/LOGCOM/EXI077zbMATH Open1102.03022OpenAlexW2014322692MaRDI QIDQ5477458
Publication date: 3 July 2006
Published in: Journal Of Logic And Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exi077
Probability and inductive logic (03B48) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Cited In (16)
- Probabilistic temporal logic with countably additive semantics
- A survey on temporal logics for specifying and verifying real-time systems
- Probability logics for reasoning about quantum observations
- Probabilization of logics: completeness and decidability
- Decidability of finite probabilistic propositional dynamic logics
- Complexity Results for Probabilistic Datalog
- \textsf{PFL}: a probabilistic logic for fault trees
- A propositional linear time logic with time flow isomorphic to \(\omega^2\)
- Logics with Probability Operators
- Hierarchies of probabilistic logics
- A propositional probabilistic logic with discrete linear time for reasoning about evidence
- Probabilistic Logic over Paths
- No finite model property for logics of quantified announcements
- Probabilistic Temporal Logics
- Probabilistic logic with independence
- Introduction: Combining probability and logic
This page was built for publication: Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5477458)
