DBpedia – Linked Data Fragments

Matches in DBpedia 2016-04 for { ?s ?p "In probabilistic logic, the Fréchet inequalities, also known as the Boole–Fréchet inequalities, are rules implicit in the work of George Boole and explicitly derived by Maurice Fréchet that govern the combination of probabilities about logical propositions or events logically linked together in conjunctions (AND operations) or disjunctions (OR operations) as in Boolean expressions or fault or event trees common in risk assessments, engineering design and artificial intelligence. These inequalities can be considered rules about how to bound calculations involving probabilities without assuming independence or, indeed, without making any dependence assumptions whatsoever. The Fréchet inequalities are closely related to the Boole–Bonferroni–Fréchet inequalities, and to Fréchet bounds.If Ai are logical propositions or events, the Fréchet inequalities areProbability of a logical conjunction (&)max(0, P(A1) + P(A2) + ... + P(An) − (n − 1)) ≤ P(A1 & A2 & ... & An) ≤ min(P(A1), P(A2), ..., P(An)),Probability of a logical disjunction (∨)max(P(A1), P(A2), ..., P(An)) ≤ P(A1 ∨ A2 ∨ ... ∨ An) ≤ min(1, P(A1) + P(A2) + ... + P(An)),where P( ) denotes the probability of an event or proposition. In the case where there are only two events, say A and B, the inequalities reduce toProbability of a logical conjunction (&)max(0, P(A) + P(B) − 1) ≤ P(A & B) ≤ min(P(A), P(B)),Probability of a logical disjunction (∨)max(P(A), P(B)) ≤ P(A ∨ B) ≤ min(1, P(A) + P(B)).The inequalities bound the probabilities of the two kinds of joint events given the probabilities of the individual events. For example, if A is \"has lung cancer\", and B is \"has mesothelioma\", then A & B is \"has both lung cancer and mesothelioma\", and A ∨ B is \"has lung cancer or mesothelioma or both diseases\", and the inequalities relate the risks of these events.Note that logical conjunctions are denoted in various ways in different fields, including AND, &, ∧ and graphical AND-gates. Logical disjunctions are likewise denoted in various ways, including OR, |, ∨, and graphical OR-gates. If events are taken to be sets rather than logical propositions, the set-theoretic versions of the Fréchet inequalities areProbability of an intersection of eventsmax(0,P(A) + P(B) − 1) ≤ P(A ∩ B) ≤ min(P(A), P(B)),Probability of a union of eventsmax(P(A), P(B)) ≤ P(A ∪ B) ≤ min(1, P(A) + P(B)).↑ ↑ ↑ ↑"@en }

• Fréchet_inequalities abstract "In probabilistic logic, the Fréchet inequalities, also known as the Boole–Fréchet inequalities, are rules implicit in the work of George Boole and explicitly derived by Maurice Fréchet that govern the combination of probabilities about logical propositions or events logically linked together in conjunctions (AND operations) or disjunctions (OR operations) as in Boolean expressions or fault or event trees common in risk assessments, engineering design and artificial intelligence. These inequalities can be considered rules about how to bound calculations involving probabilities without assuming independence or, indeed, without making any dependence assumptions whatsoever. The Fréchet inequalities are closely related to the Boole–Bonferroni–Fréchet inequalities, and to Fréchet bounds.If Ai are logical propositions or events, the Fréchet inequalities areProbability of a logical conjunction (&)max(0, P(A1) + P(A2) + ... + P(An) − (n − 1)) ≤ P(A1 & A2 & ... & An) ≤ min(P(A1), P(A2), ..., P(An)),Probability of a logical disjunction (∨)max(P(A1), P(A2), ..., P(An)) ≤ P(A1 ∨ A2 ∨ ... ∨ An) ≤ min(1, P(A1) + P(A2) + ... + P(An)),where P( ) denotes the probability of an event or proposition. In the case where there are only two events, say A and B, the inequalities reduce toProbability of a logical conjunction (&)max(0, P(A) + P(B) − 1) ≤ P(A & B) ≤ min(P(A), P(B)),Probability of a logical disjunction (∨)max(P(A), P(B)) ≤ P(A ∨ B) ≤ min(1, P(A) + P(B)).The inequalities bound the probabilities of the two kinds of joint events given the probabilities of the individual events. For example, if A is \"has lung cancer\", and B is \"has mesothelioma\", then A & B is \"has both lung cancer and mesothelioma\", and A ∨ B is \"has lung cancer or mesothelioma or both diseases\", and the inequalities relate the risks of these events.Note that logical conjunctions are denoted in various ways in different fields, including AND, &, ∧ and graphical AND-gates. Logical disjunctions are likewise denoted in various ways, including OR, |, ∨, and graphical OR-gates. If events are taken to be sets rather than logical propositions, the set-theoretic versions of the Fréchet inequalities areProbability of an intersection of eventsmax(0,P(A) + P(B) − 1) ≤ P(A ∩ B) ≤ min(P(A), P(B)),Probability of a union of eventsmax(P(A), P(B)) ≤ P(A ∪ B) ≤ min(1, P(A) + P(B)).↑ ↑ ↑ ↑".