Best Possible Inequalities for the Probability of a Logical Function of Events
From MaRDI portal
Publication:5341341
Cited in
(61)- Probabilistic logic with independence
- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
- Ultra-quantum coherent states in a single finite quantum system
- Extension of the concept of propositional deduction from classical logic to probability: An overview of probability-selection approaches
- An anytime deduction algorithm for the probabilistic logic and entailment problems
- Compatibility, desirability, and the running intersection property
- Das maximale Signifikanzniveau des Tests: Lehne \(H_0\) ab, wenn \(k\) unter \(n\) gegebenen Tests zur Ablehnung führen
- PROBABILISTIC ROLE MODELS AND THE GUARDED FRAGMENT
- Computational complexity of queries based on itemsets
- Bounds for increasing multi-state consecutive \(k\)-out-of-\(r\)-from-\(n\): \(F\) system with equal components probabilities
- Boole's conditions of possible experience and reasoning under uncertainty
- Towards classifying propositional probabilistic logics
- Generalizing inference rules in a coherence-based probabilistic default reasoning
- Computing bounds for the probability of the union of events by different methods
- Logical perspectives on the foundations of probability
- Extremal probability bounds in combinatorial optimization
- Best second order bounds for two-terminal network reliability with dependent edge failures
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
- Probabilized Sequent Calculus and Natural Deduction System for Classical Logic
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs
- Safe projections of binary data sets
- Automatic derivation of probabilistic inference rules
- Single commodity stochastic network design under probabilistic constraint with discrete random variables
- Tight Probability Bounds with Pairwise Independence
- On the complete description of entangled systems. I: Exploring hidden variables and context communication cost in simulating quantum correlations
- Generalizing probabilistic material implication and Bayesian conditionals
- A combinatorial optimization approach to the selection of statistical units
- Polynomially computable bounds for the probability of the union of events
- Roots and (re)sources of value (in)definiteness \textit{versus} contextuality
- Improved bounds on the probability of the union of events some of whose intersections are empty
- Merging the local and global approaches to probabilistic satisfiability
- Logics with Probability Operators
- Probabilistic inequalities and measurements in bipartite systems
- Scharfe untere und obere Schranken für die Wahrscheinlichkeit der Realisation von k unter n Ereignissen
- The differential of probabilistic entailment
- Sequential decision making with partially ordered preferences
- Upper and lower bounds for the probability that r events occur
- The theory of interval probabilistic logic programs
- Probability logic in the twentieth century
- An Extension of the Charnes-Cooper Method in Linear Fractional Programming
- Sharp bounds for the probability that exactly k-out-of-n events occur with unimodal distributions
- Clusters of high-dimensional interval data and related Boolean functions of events in Euclidean space
- A generalization of Hunter's bound to hypergraphs
- Probabilistic satisfiability with imprecise probabilities
- Complexity of some graph-based bounds on the probability of a union of events
- Probabilistic sentence satisfiability: an approach to PSAT
- The development of probability logic from leibniz to maccoll
- New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions
- Bivalent trees and forests or upper bounds for the probability of a union revisited
- A logic and computation for Popper's conditional probabilities
- Fréchet optimal bounds on the probability of a union with supplementary information
- Bonferroni-type inequalities; Chebyshev-type inequalities for the distributions on \([0, n]\)
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- Probability and natural deduction
- Sequent calculus for classical logic probabilized
- Probability bounds given by hypercherry trees
- Probabilistic satisfiability and coherence checking through integer programming
- Network reliability: Heading out on the highway
- The value of shape constraints in discrete moment problems: a review and extension
- Polyhedral functions and multiparametric linear programming
- Correlation polytopes: Their geometry and complexity
This page was built for publication: Best Possible Inequalities for the Probability of a Logical Function of Events
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5341341)
