Best Possible Inequalities for the Probability of a Logical Function of Events

Cited In (57)

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
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
Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
An anytime deduction algorithm for the probabilistic logic and entailment problems
Compatibility, desirability, and the running intersection property
Roots and (Re)sources of Value (In)definiteness Versus Contextuality
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
Polynomially Computable Bounds for the Probability of the Union of Events
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
Towards classifying propositional probabilistic logics
Boole's conditions of possible experience and reasoning under uncertainty
Generalizing inference rules in a coherence-based probabilistic default reasoning
Logical perspectives on the foundations of probability
Computing bounds for the probability of the union of events by different methods
Best second order bounds for two-terminal network reliability with dependent edge failures
Probabilized Sequent Calculus and Natural Deduction System for Classical Logic
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
Automatic derivation of probabilistic inference rules
Safe projections of binary data sets
Bounding the probability of the union of events by aggregation and disaggregation in linear programs
Single commodity stochastic network design under probabilistic constraint with discrete random variables
Tight Probability Bounds with Pairwise Independence
A combinatorial optimization approach to the selection of statistical units
Merging the local and global approaches to probabilistic satisfiability
Improved bounds on the probability of the union of events some of whose intersections are empty
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
An Extension of the Charnes-Cooper Method in Linear Fractional Programming
Probability logic in the twentieth century
The theory of interval probabilistic logic programs
Complexity of some graph-based bounds on the probability of a union of events
Probabilistic satisfiability with imprecise probabilities
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
Direct algorithms for checking consistency and making inferences from conditional probability assessments
Bonferroni-type inequalities; Chebyshev-type inequalities for the distributions on \([0, n]\)
Probability bounds given by hypercherry trees
Extremal Probability Bounds in Combinatorial Optimization
Sequent calculus for classical logic probabilized
Network reliability: Heading out on the highway
Probabilistic satisfiability and coherence checking through integer programming
The value of shape constraints in discrete moment problems: a review and extension
Polyhedral functions and multiparametric linear programming
Probabilistic logic with independence
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)