Pages that link to "Item:Q1327387"
From MaRDI portal
The following pages link to Decidability and expressiveness for first-order logics of probability (Q1327387):
Displaying 22 items.
- A note on definability in fragments of arithmetic with free unary predicates (Q365661) (← links)
- Collapsing probabilistic hierarchies. I (Q384407) (← links)
- The well-designed logical robot: learning and experience from observations to the Situation Calculus (Q543604) (← links)
- A continuum-valued logic of degrees of probability (Q907883) (← links)
- Learning to assign degrees of belief in relational domains (Q1009279) (← links)
- Some first-order probability logics (Q1583250) (← links)
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws (Q2283277) (← links)
- Probabilistic sentence satisfiability: an approach to PSAT (Q2287193) (← links)
- Knowing-how under uncertainty (Q2289005) (← links)
- Reasoning about probabilistic sequential programs (Q2373709) (← links)
- Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence (Q2390651) (← links)
- Weakly complete axiomatization of exogenous quantum propositional logic (Q2495653) (← links)
- A logic for inductive probabilistic reasoning (Q2576405) (← links)
- The probability nesting game (Q2842598) (← links)
- Probabilistic Common Knowledge Among Infinite Number of Agents (Q3451209) (← links)
- Quantifying over events in probability logic: an introduction (Q4593244) (← links)
- PROBABILISTIC ROLE MODELS AND THE GUARDED FRAGMENT (Q5291329) (← links)
- Probabilistic Logic over Paths (Q5415665) (← links)
- Reasoning about knowledge and conditional probability (Q6064254) (← links)
- Elementary invariants for quantified probability logic (Q6095192) (← links)
- Probability logics for reasoning about quantum observations (Q6113689) (← links)
- IS CAUSAL REASONING HARDER THAN PROBABILISTIC REASONING? (Q6131225) (← links)
