On the satisfiability of some simple probabilistic logics

DOI10.1145/2933575.2934526MaRDI QIDQ4635861zbMATHOpenAlexWikidataFDO

Authors Souymodip Chakraborty, Joost-Pieter Katoen

Publication date 23 April 2018

Published in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2933575.2934526

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Probability and inductive logic (03B48) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Recommendations

• The satisfiability problem for unbounded fragments of probabilistic CTL
• A Logic of Probability with Decidable Model Checking
• Decidability and complexity for \(\omega \)-regular properties of stochastic systems
• scientific article; zbMATH DE number 1948170
• Probabilistic propositional temporal logics

Cited in

(17)

• The satisfiability problem for a quantitative fragment of PCTL
• Applications of Logics About Simple Probabilities
• Satisfiability of quantitative probabilistic CTL: rise to the challenge
• scientific article; zbMATH DE number 4172426 (Why is no real title available?)
• The satisfiability problem for a quantitative fragment of PCTL
• Bounded satisfiability for PCTL
• Probabilistic \(\mu\)-calculus: decidability and complete axiomatization
• The satisfiability problem for unbounded fragments of probabilistic CTL
• A Logic of Probability with Decidable Model Checking
• On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees
• On standard completeness and finite model property for a probabilistic logic on Łukasiewicz events
• scientific article; zbMATH DE number 6987096 (Why is no real title available?)
• Coalgebraic satisfiability checking for arithmetic \(\mu\)-calculi
• scientific article; zbMATH DE number 1948170 (Why is no real title available?)
• Decidability and complexity for \(\omega \)-regular properties of stochastic systems
• The complexity of satisfiability in non-iterated and iterated probabilistic logics
• Computability of validity and satisfiability in probability logics over finite and countable models

This page was built for publication: On the satisfiability of some simple probabilistic logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635861)