Search results for " statistica"

showing 10 items of 2672 documents

Probability Propagation in Selected Aristotelian Syllogisms

2019

This paper continues our work on a coherence-based probability semantics for Aristotelian syllogisms (Gilio, Pfeifer, and Sanfilippo, 2016; Pfeifer and Sanfilippo, 2018) by studying Figure III under coherence. We interpret the syllogistic sentence types by suitable conditional probability assessments. Since the probabilistic inference of $P|S$ from the premise set ${P|M, S|M}$ is not informative, we add $p(M|(S ee M))>0$ as a probabilistic constraint (i.e., an ``existential import assumption'') to obtain probabilistic informativeness. We show how to propagate the assigned premise probabilities to the conclusion. Thereby, we give a probabilistic meaning to all syllogisms of Figure~III. We…

Discrete mathematicsSettore MAT/06 - Probabilita' E Statistica Matematica05 social sciencesProbabilistic logicSyllogismConditional probability02 engineering and technologyCoherence (statistics)Settore MAT/01 - Logica MatematicaImprecise probabilityAristotelian syllogismFigure III050105 experimental psychologyConstraint (information theory)Premise0202 electrical engineering electronic engineering information engineeringImprecise probability020201 artificial intelligence & image processing0501 psychology and cognitive sciencesConditional eventDefault reasoningCoherenceSentenceMathematics
researchProduct

Conjunction and Disjunction Among Conditional Events

2017

We generalize, in the setting of coherence, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. Given a prevision assessment on the conjunction of two conditional events, we study the set of coherent extensions for the probabilities of the two conditional events. Then, we introduce by a progressive procedure the notions of conjunction and disjunction for n conditional events. Moreover, by defining the negation of conjunction and of disjunction, we show that De Morgan’s Laws still hold. We also show that the associative and commutative properties are satisfied. Finally, we examine in detail the conjunction for a family \(\mathcal F\) of t…

Discrete mathematicsSettore MAT/06 - Probabilita' E Statistica MatematicaComputer scienceConditional events · Conditional random quantities · Con- junction · Disjunction · Negation · Quasi conjunction · Coherent previ- sion assessments · Coherent extensions · De Morgan’s Laws02 engineering and technologyCoherence (philosophical gambling strategy)Settore MAT/01 - Logica Matematica01 natural sciencesDe Morgan's lawsConjunction (grammar)Set (abstract data type)010104 statistics & probabilitysymbols.namesakeNegation0202 electrical engineering electronic engineering information engineeringsymbols020201 artificial intelligence & image processing0101 mathematicsAlgorithmCommutative propertyAssociative propertyEvent (probability theory)
researchProduct

Probabilistic entailment and iterated conditionals

2020

In this paper we exploit the notions of conjoined and iterated conditionals, which are defined in the setting of coherence by means of suitable conditional random quantities with values in the interval $[0,1]$. We examine the iterated conditional $(B|K)|(A|H)$, by showing that $A|H$ p-entails $B|K$ if and only if $(B|K)|(A|H) = 1$. Then, we show that a p-consistent family $\mathcal{F}=\{E_1|H_1,E_2|H_2\}$ p-entails a conditional event $E_3|H_3$ if and only if $E_3|H_3=1$, or $(E_3|H_3)|QC(\mathcal{S})=1$ for some nonempty subset $\mathcal{S}$ of $\mathcal{F}$, where $QC(\mathcal{S})$ is the quasi conjunction of the conditional events in $\mathcal{S}$. Then, we examine the inference rules $A…

Discrete mathematicsSettore MAT/06 - Probabilita' E Statistica MatematicaIterated functionInterval (graph theory)Settore MAT/01 - Logica MatematicaCoherence Conditional random quantities p-entailment Inference rules.MathematicsStrict conditional
researchProduct

Conditional Random Quantities and Compounds of Conditionals

2013

In this paper we consider finite conditional random quantities and conditional previsions assessments in the setting of coherence. We use a suitable representation for conditional random quantities; in particular the indicator of a conditional event $E|H$ is looked at as a three-valued quantity with values 1, or 0, or $p$, where $p$ is the probability of $E|H$. We introduce a notion of iterated conditional random quantity of the form $(X|H)|K$ defined as a suitable conditional random quantity, which coincides with $X|HK$ when $H \subseteq K$. Based on a recent paper by S. Kaufmann, we introduce a notion of conjunction of two conditional events and then we analyze it in the setting of cohere…

Discrete mathematicsSettore MAT/06 - Probabilita' E Statistica MatematicaLogicImport–Export principleProbability (math.PR)Probabilistic logicConjunctionOf the formSettore M-FIL/02 - Logica E Filosofia Della ScienzaCoherence (philosophical gambling strategy)Conditional random quantitieConjunction (grammar)Lower/upper prevision boundsHistory and Philosophy of ScienceNegationIterated functionIterated conditioningFOS: MathematicsConditional eventRepresentation (mathematics)CoherenceDisjunctionMathematics - ProbabilityMathematicsEvent (probability theory)
researchProduct

Compound conditionals, Fr\'echet-Hoeffding bounds, and Frank t-norms

2021

Abstract In this paper we consider compound conditionals, Frechet-Hoeffding bounds and the probabilistic interpretation of Frank t-norms. By studying the solvability of suitable linear systems, we show under logical independence the sharpness of the Frechet-Hoeffding bounds for the prevision of conjunctions and disjunctions of n conditional events. In addition, we illustrate some details in the case of three conditional events. We study the set of all coherent prevision assessments on a family containing n conditional events and their conjunction, by verifying that it is convex. We discuss the case where the prevision of conjunctions is assessed by Lukasiewicz t-norms and we give explicit s…

Discrete mathematicsSettore MAT/06 - Probabilita' E Statistica MatematicaLogical independenceFrank t-normsApplied MathematicsLinear systemProbabilistic logicRegular polygon02 engineering and technologyConjunction and disjunctionConditional previsionTheoretical Computer ScienceConvexityFréchet-Hoeffding boundArtificial Intelligence020204 information systems0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingPairwise comparisonCoherenceSoftwareMathematics - ProbabilityCounterexampleMathematicsCorresponding conditional
researchProduct

Generalized probabilistic modus ponens

2017

Modus ponens (from A and “if A then C” infer C) is one of the most basic inference rules. The probabilistic modus ponens allows for managing uncertainty by transmitting assigned uncertainties from the premises to the conclusion (i.e., from P(A) and P(C|A) infer P(C)). In this paper, we generalize the probabilistic modus ponens by replacing A by the conditional event A|H. The resulting inference rule involves iterated conditionals (formalized by conditional random quantities) and propagates previsions from the premises to the conclusion. Interestingly, the propagation rules for the lower and the upper bounds on the conclusion of the generalized probabilistic modus ponens coincide with the re…

Discrete mathematicsSettore MAT/06 - Probabilita' E Statistica MatematicaProbabilistic logicConjoined conditionalPrevision0102 computer and information sciences02 engineering and technologyCoherence (philosophical gambling strategy)Settore MAT/01 - Logica MatematicaModus ponen01 natural sciencesConditional random quantitieTheoretical Computer ScienceModus ponendo tollens010201 computation theory & mathematicsIterated functionComputer Science0202 electrical engineering electronic engineering information engineeringIterated conditional020201 artificial intelligence & image processingRule of inferenceModus ponensCoherenceEvent (probability theory)Mathematics
researchProduct

Conditional Random Quantities and Iterated Conditioning in the Setting of Coherence

2013

We consider conditional random quantities (c.r.q.’s) in the setting of coherence. Given a numerical r.q. X and a non impossible event H, based on betting scheme we represent the c.r.q. X|H as the unconditional r.q. XH + μH c , where μ is the prevision assessed for X|H. We develop some elements for an algebra of c.r.q.’s, by giving a condition under which two c.r.q.’s X|H and Y|K coincide. We show that X|HK coincides with a suitable c.r.q. Y|K and we apply this representation to Bayesian updating of probabilities, by also deepening some aspects of Bayes’ formula. Then, we introduce a notion of iterated c.r.q. (X|H)|K, by analyzing its relationship with X|HK. Our notion of iterated conditiona…

Discrete mathematicsSettore MAT/06 - Probabilita' E Statistica MatematicaSettore INF/01 - Informaticaconditional random quantitiesCoherence (statistics)Bayesian inferencebayesian updatingcoherenceCombinatoricsconditional previsionsBayes' theoremIterated functionbayesian updating; conditional random quantities; betting scheme; conditional previsions; coherence; iterated conditioning; iterated conditioning.Coherence betting scheme conditional random quantities conditional previsions Bayesian updating iterated conditioning.Scheme (mathematics)iterated conditioningConditioningRepresentation (mathematics)betting schemeEvent (probability theory)Mathematics
researchProduct

Transitive Reasoning with Imprecise Probabilities

2015

We study probabilistically informative (weak) versions of transitivity by using suitable definitions of defaults and negated defaults in the setting of coherence and imprecise probabilities. We represent \(\text{ p-consistent }\) sequences of defaults and/or negated defaults by g-coherent imprecise probability assessments on the respective sequences of conditional events. Finally, we present the coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases.

Discrete mathematicsTransitive relationSettore MAT/06 - Probabilita' E Statistica MatematicaSettore INF/01 - Informaticabusiness.industryProbabilistic logicSyllogismInferenceCoherence (philosophical gambling strategy)Settore M-FIL/02 - Logica E Filosofia Della ScienzaComputer Science::Artificial IntelligenceImprecise probabilityCoherence default imprecise probability knowledge base p-consistency p-entailment reasoning syllogism weak transitivityProbability propagationKnowledge basebusinessMathematics
researchProduct

Spatio-temporal analysis of the Covid-19 spread in Italy by Bayesian hierarchical models

2021

In this paper, we investigate the spatio-temporal spread pattern of the virus Covid-19 in Italy, during the first wave of infections, from February to October 2020. We provide a disease mapping of the virus infections, by using the Besag-Yorke-Molliè model and its spatio-temporal extensions. Our results confirm the effectiveness of the lockdown action, and show that, during the first wave, the virus spread by an inhomogeneous spatial trend and each province was characterised by a specific temporal trend, independent of the temporal evolution of the observed cases in the other provinces

Disease MappingItalian Covid-19Besag-York-Mollie modelSettore SECS-S/01 - StatisticaSpatio-temporal model
researchProduct

Divari territoriali nelle diseguaglianze di genere in Italia

2009

Diseguaglianze di Genere PovertàSettore SECS-S/02 - Statistica Per La Ricerca Sperimentale E Tecnologica
researchProduct