Pages that link to "Item:Q5341341"

The following pages link to Best Possible Inequalities for the Probability of a Logical Function of Events (Q5341341):

Displaying 50 items.

• Generalizing inference rules in a coherence-based probabilistic default reasoning (Q432972) (← links)
• Bounds for increasing multi-state consecutive \(k\)-out-of-\(r\)-from-\(n\): \(F\) system with equal components probabilities (Q554719) (← links)
• Sequential decision making with partially ordered preferences (Q646545) (← links)
• A combinatorial optimization approach to the selection of statistical units (Q747022) (← links)
• Computational complexity of queries based on itemsets (Q844194) (← links)
• Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation (Q899162) (← links)
• An anytime deduction algorithm for the probabilistic logic and entailment problems (Q962834) (← links)
• The theory of interval probabilistic logic programs (Q1039578) (← links)
• Bivalent trees and forests or upper bounds for the probability of a union revisited (Q1051331) (← links)
• Polyhedral functions and multiparametric linear programming (Q1078087) (← links)
• Scharfe untere und obere Schranken für die Wahrscheinlichkeit der Realisation von k unter n Ereignissen (Q1159401) (← links)
• Correlation polytopes: Their geometry and complexity (Q1176573) (← links)
• Bonferroni-type inequalities; Chebyshev-type inequalities for the distributions on \([0, n]\) (Q1207629) (← links)
• Das maximale Signifikanzniveau des Tests: ''Lehne \(H_0\) ab, wenn \(k\) unter \(n\) gegebenen Tests zur Ablehnung führen'' (Q1251037) (← links)
• Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem (Q1296804) (← links)
• Probabilistic satisfiability with imprecise probabilities (Q1605686) (← links)
• Sequent calculus for classical logic probabilized (Q1712933) (← links)
• Complexity of some graph-based bounds on the probability of a union of events (Q1752603) (← links)
• Bounding the probability of the union of events by aggregation and disaggregation in linear programs (Q1765524) (← links)
• Improved bounds on the probability of the union of events some of whose intersections are empty (Q1785461) (← links)
• Direct algorithms for checking consistency and making inferences from conditional probability assessments (Q1888857) (← links)
• Boole's conditions of possible experience and reasoning under uncertainty (Q1894361) (← links)
• Computing bounds for the probability of the union of events by different methods (Q1945070) (← links)
• Best second order bounds for two-terminal network reliability with dependent edge failures (Q1961463) (← links)
• Compatibility, desirability, and the running intersection property (Q1989412) (← links)
• The value of shape constraints in discrete moment problems: a review and extension (Q2095900) (← links)
• A logic and computation for Popper's conditional probabilities (Q2146066) (← links)
• Towards classifying propositional probabilistic logics (Q2250552) (← links)
• Merging the local and global approaches to probabilistic satisfiability (Q2270380) (← links)
• Probabilistic sentence satisfiability: an approach to PSAT (Q2287193) (← links)
• Probabilistic satisfiability and coherence checking through integer programming (Q2344365) (← links)
• New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions (Q2357784) (← links)
• Probabilistic logic with independence (Q2379311) (← links)
• Fréchet optimal bounds on the probability of a union with supplementary information (Q2474522) (← links)
• Safe projections of binary data sets (Q2491217) (← links)
• The differential of probabilistic entailment (Q2662693) (← links)
• Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables (Q2797468) (← links)
• Probability logic in the twentieth century (Q3356294) (← links)
• The development of probability logic from leibniz to maccoll (Q3807151) (← links)
• An Extension of the Charnes-Cooper Method in Linear Fractional Programming (Q3833883) (← links)
• Upper and lower bounds for the probability that <i>r</i> events occur (Q3835655) (← links)
• Probability bounds given by hypercherry trees (Q4709731) (← links)
• Logics with Probability Operators (Q5024712) (← links)
• Probabilized Sequent Calculus and Natural Deduction System for Classical Logic (Q5024718) (← links)
• Probabilistic inequalities and measurements in bipartite systems (Q5051145) (← links)
• Extremal Probability Bounds in Combinatorial Optimization (Q5051383) (← links)
• Roots and (Re)sources of Value (In)definiteness Versus Contextuality (Q5119677) (← links)
• Polynomially Computable Bounds for the Probability of the Union of Events (Q5247622) (← links)
• PROBABILISTIC ROLE MODELS AND THE GUARDED FRAGMENT (Q5291329) (← links)
• Extension of the concept of propositional deduction from classical logic to probability: An overview of probability-selection approaches (Q5939690) (← links)