Pages that link to "Item:Q1424351"
From MaRDI portal
The following pages link to Reasoning about probabilistic sequential programs in a probabilistic logic (Q1424351):
Displaying 14 items.
- Similarity mass and approximate reasoning (Q382476) (← links)
- Value-passing CCS with noisy channels (Q428864) (← links)
- \(L\)-fuzzy strongest postcondition predicate transformers as \(L\)-idempotent linear or affine operators between semimodules of monotonic predicates (Q690918) (← links)
- Domain semantics of possibility computations (Q1031684) (← links)
- Semantics of non-deterministic possibility computation (Q1759727) (← links)
- An assertion-based program logic for probabilistic programs (Q2323970) (← links)
- Reasoning about probabilistic sequential programs (Q2373709) (← links)
- \(\pi\)-calculus with noisy channels (Q2570971) (← links)
- Efficient probabilistic reasoning in BNs with mutual exclusion and context-specific independence (Q3156891) (← links)
- Predicate transformers for extended probability and non-determinism (Q3636909) (← links)
- Reasoning about Recursive Probabilistic Programs (Q4635928) (← links)
- Preprocessing for Optimization of Probabilistic-Logic Models for Sequence Analysis (Q4649725) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5473985) (← links)
- Demonic, angelic and unbounded probabilistic choices in sequential programs (Q5925822) (← links)
