Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity

DOI10.1093/LOGCOM/EXI077MaRDI QIDQ5477458zbMATH OpenOpenAlexFDO

Authors Zoran Ognjanović

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

zbMATH Keywords

decidabilityaxiomatizationtemporal logicprobabilistic logic

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Recommendations

• scientific article; zbMATH DE number 3869302
• Probabilistic propositional temporal logics
• A decidable probability logic for timed probabilistic systems
• A logic for reasoning about time and reliability
• scientific article; zbMATH DE number 1948170

Cited in

(20)

• Hierarchies of probabilistic logics
• Decidability of finite probabilistic propositional dynamic logics
• A decidable probability logic for timed probabilistic systems
• A propositional probabilistic logic with discrete linear time for reasoning about evidence
• Logics with Probability Operators
• A survey on temporal logics for specifying and verifying real-time systems
• scientific article; zbMATH DE number 3869302 (Why is no real title available?)
• A propositional linear time logic with time flow isomorphic to \(\omega^2\)
• \textsf{PFL}: a probabilistic logic for fault trees
• Probability logics for reasoning about quantum observations
• Probabilistic logic with independence
• Probabilization of logics: completeness and decidability
• Probabilistic logic over paths
• Introduction: Combining probability and logic
• No finite model property for logics of quantified announcements
• Probabilistic propositional temporal logics
• scientific article; zbMATH DE number 1929309 (Why is no real title available?)
• Complexity Results for Probabilistic Datalog
• Probabilistic Temporal Logics
• Probabilistic temporal logic with countably additive semantics

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)