On the satisfiability of some simple probabilistic logics

DOI10.1145/2933575.2934526MaRDI QIDQ4635861zbMATH OpenOpenAlexWikidataFDO

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

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

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

(19)

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

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)