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