Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
From MaRDI portal
Publication:5477458
DOI10.1093/logcom/exi077zbMath1102.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
Logic in artificial intelligence (68T27) Probability and inductive logic (03B48) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Related Items
Probabilistic logic with independence, Introduction: Combining probability and logic, A propositional probabilistic logic with discrete linear time for reasoning about evidence, A survey on temporal logics for specifying and verifying real-time systems, Probability logics for reasoning about quantum observations, \textsf{PFL}: a probabilistic logic for fault trees, A propositional linear time logic with time flow isomorphic to \(\omega^2\), Hierarchies of probabilistic logics, Probabilistic Logic over Paths, Probabilization of logics: completeness and decidability, Logics with Probability Operators, Probabilistic Temporal Logics