Type:
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?type=&bib=pubblicazioni.bib&rss
bibtexbrowser v20111211Probability Propagation in Selected Aristotelian Syllogisms
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=PfSa19&bib=pubblicazioni.bib
Niki Pfeifer, Giuseppe Sanfilippo, "Probability Propagation in Selected Aristotelian Syllogisms", Chapter in ECSQARU 2019, in press, LNCS, Springer, pp. , 2019. (Old version available on arxiv [arxiv.org])
pubblicazioni.bib%3A%3APfSa19Conjunction of Conditional Events and T-norms
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=GiSa19b&bib=pubblicazioni.bib
Angelo Gilio, Giuseppe Sanfilippo, "Conjunction of Conditional Events and T-norms", Chapter in ECSQARU 2019, in press, LNCS, Springer, pp. , 2019.
pubblicazioni.bib%3A%3AGiSa19bGeneralized Logical Operations among Conditional Events
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=GiSa18&bib=pubblicazioni.bib
Angelo Gilio, Giuseppe Sanfilippo, "Generalized Logical Operations among Conditional Events", In Applied Intelligence, vol. 49, no. 1, pp. 79-102, 2019. (Old version available on arxiv [arxiv.org])
pubblicazioni.bib%3A%3AGiSa18Probabilistic semantics for categorical syllogisms of Figure II
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=SUM2018PS&bib=pubblicazioni.bib
Niki Pfeifer, Giuseppe Sanfilippo, "Probabilistic semantics for categorical syllogisms of Figure II", Chapter in Scalable Uncertainty Management: 12th International Conference, SUM 2018, Lecture Notes in Computer Science, Springer International Publishing, vol. 11142, Cham, pp. 196-211, 2018.
pubblicazioni.bib%3A%3ASUM2018PSLower and upper probability bounds for some conjunctions of two conditional events
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=SUM2018&bib=pubblicazioni.bib
Giuseppe Sanfilippo, "Lower and upper probability bounds for some conjunctions of two conditional events", Chapter in Scalable Uncertainty Management: 12th International Conference, SUM 2018, Lecture Notes in Computer Science, Springer International Publishing, vol. 11142, Cham, pp. 260-275, 2018.
pubblicazioni.bib%3A%3ASUM2018Probabilistic inferences from conjoined to iterated conditionals
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=SPOG18&bib=pubblicazioni.bib
Giuseppe Sanfilippo, Niki Pfeifer, David E. Over, Angelo Gilio, "Probabilistic inferences from conjoined to iterated conditionals", In International Journal of Approximate Reasoning, vol. 93, no. Supplement C, pp. 103 - 118, 2018. (
[
Available on ResearchGate]
[Available on arxiv.org]
The final publication
is available for free at [Elsevier])
pubblicazioni.bib%3A%3ASPOG18Scoring alternative forecast distributions: completing the Kullback symmetric distance complex
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=LS2017&bib=pubblicazioni.bib
Frank Lad, Giuseppe Sanfilippo, "Scoring alternative forecast distributions: completing the Kullback symmetric distance complex", In Global and Local Economic Review, 2018. (Available on arxiv] [arxiv.org/abs/1806.11178])
pubblicazioni.bib%3A%3ALS2017The Duality of Entropy/Extropy, and Completion of the Kullback Information Complex
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2018%3AExtropy&bib=pubblicazioni.bib
Frank Lad, Giuseppe Sanfilippo, Gianna Agrò, "The Duality of Entropy/Extropy, and Completion of the Kullback Information Complex", In Entropy, vol. 20, no. 8, 2018.
pubblicazioni.bib%3A%3A2018%3AExtropyCompounds of conditionals and iterated conditioning under coherence
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=TORINO2017&bib=pubblicazioni.bib
Giuseppe Sanfilippo, "Compounds of conditionals and iterated conditioning under coherence", In Proceedings of First italian meeting on probability and mathematical statistics, June 19-th to 22-nd, 2017, Torino, Italy, pp. 115-116, 2017.
pubblicazioni.bib%3A%3ATORINO2017La ruota della fortuna
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=SaZi17&bib=pubblicazioni.bib
Giuseppe Sanfilippo, Carmen Zito, "La ruota della fortuna", In Quaderni di Ricerca in Didattica (Mathematics), vol. 27, no. 1, suppl.1, pp. 83-85, 2017. ([A
pdf version of the published paper])
pubblicazioni.bib%3A%3ASaZi17Probabilistic squares and hexagons of opposition under coherence
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=PS2017&bib=pubblicazioni.bib
Niki Pfeifer, Giuseppe Sanfilippo, "Probabilistic squares and hexagons of opposition under coherence", In International Journal of Approximate Reasoning, vol. 88, pp. 282 - 294, 2017. (Old version available on arxiv] [arxiv.org])
pubblicazioni.bib%3A%3APS2017Coherent nested conditional syllogisms under uncertainty
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=PS17progic&bib=pubblicazioni.bib
Niki Pfeifer, Giuseppe Sanfilippo, "Coherent nested conditional syllogisms under uncertainty", In Progic, pp. , 2017.
pubblicazioni.bib%3A%3APS17progicConjunction and Disjunction Among Conditional Events
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=IEA2017&bib=pubblicazioni.bib
Angelo Gilio, Giuseppe Sanfilippo, "Conjunction and Disjunction Among Conditional Events", Chapter in IEA/AIE 2017, Part II, Lecture Notes in Computer Science, Springer International Publishing, vol. 10351, Cham, pp. 85-96, 2017.
pubblicazioni.bib%3A%3AIEA2017Generalized probabilistic modus ponens
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=ECSQARU17&bib=pubblicazioni.bib
Giuseppe Sanfilippo, Niki Pfeifer, Angelo Gilio, "Generalized probabilistic modus ponens", Chapter in Symbolic and Quantitative Approaches to Reasoning with Uncertainty: 14th European Conference, ECSQARU 2017 Lugano, Swiss, July 10--14, 2017, Lecture Notes in Computer Science, vol. 10369publisher=Springer International Publishing, pp. 480-490, 2017. (A previous version is available on arxiv] [https://arxiv.org/abs/1705.00385])
pubblicazioni.bib%3A%3AECSQARU17Square of Opposition under Coherence
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2017%3ASMPS2&bib=pubblicazioni.bib
Niki Pfeifer, Giuseppe Sanfilippo, "Square of Opposition under Coherence", Chapter in Soft Methods for Data Science, Advances in Intelligent Systems and Computing, Springer, vol. 456, pp. 407-414, 2017. ()
pubblicazioni.bib%3A%3A2017%3ASMPS2Centering and Compound Conditionals under Coherence
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2017%3ASMPS1&bib=pubblicazioni.bib
Angelo Gilio, David Over, Niki Pfeifer, Giuseppe Sanfilippo, "Centering and Compound Conditionals under Coherence", Chapter in Soft Methods for Data Science, Advances in Intelligent Systems and Computing, Springer, vol. 456, Switzerland, pp. 253-260, 2017. ([Available on ResearchGate] The final publication
is be available at [link.springer.com])
pubblicazioni.bib%3A%3A2017%3ASMPS1Compounds of conditionals and iterated conditioning
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=AMASES2016&bib=pubblicazioni.bib
Angelo Gilio, Giuseppe Sanfilippo, "Compounds of conditionals and iterated conditioning", In Proceedings of AMASES XL, Catania (Italy) 15-17 Settembre 2016, pp. 1, 2016.
pubblicazioni.bib%3A%3AAMASES2016Transitivity in coherence-based probability logic
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2016%3AJAL&bib=pubblicazioni.bib
Angelo Gilio, Niki Pfeifer, Giuseppe Sanfilippo, "Transitivity in coherence-based probability logic", In Journal of Applied Logic, vol. 14, pp. 46-64, 2016. (
[Available on ResearchGate] [Audio slides of the the published paper])
Abstract 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 p-consistent sequences of defaults and/or negated defaults by g-coherent imprecise probability assessments on the respective sequences of conditional events. Moreover, we prove the coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases. Finally, we apply our results to study selected probabilistic versions of classical categorical syllogisms and construct a new version of the square of opposition in terms of defaults and negated defaults. pubblicazioni.bib%3A%3A2016%3AJALImprecise probability assessments and the Square of Opposition
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2016%3AEURO&bib=pubblicazioni.bib
Giuseppe Sanfilippo, Niki Pfeifer, "Imprecise probability assessments and the Square of Opposition", In CONFERENCE HANDBOOK, 28th European Conference on Operational Research, July, 3-6, 2016, pp. 304-304, 2016.
pubblicazioni.bib%3A%3A2016%3AEUROL'incertezza inSegna
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=I2015%3ASS&bib=pubblicazioni.bib
Giuseppe Sanfilippo, "L'incertezza inSegna", In Statistica e Società, vol. IV, no. 2, pp. 43-48, 2015. ([Available on ResearchGate])
pubblicazioni.bib%3A%3AI2015%3ASSExtropy: complementary dual of entropy
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2015%3ASTS&bib=pubblicazioni.bib
Frank Lad, Giuseppe Sanfilippo, Gianna Agró, "Extropy: complementary dual of entropy", In Statistical Science (Journal of the Institute of Mathematical Statistics), vol. 30, no. 1, pp. 40-58, 2015. ([arxiv.org])
pubblicazioni.bib%3A%3A2015%3ASTSTransitive Reasoning with Imprecise Probabilities
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2015%3AECSQARU&bib=pubblicazioni.bib
Angelo Gilio, Niki Pfeifer, Giuseppe Sanfilippo, "Transitive Reasoning with Imprecise Probabilities", Chapter in Symbolic and Quantitative Approaches to Reasoning with Uncertainty,, Lecture Notes in Artificial Intelligence, Springer International Publishing Switzerland, vol. 9161, pp. 95-105, 2015. ([Available on ResearchGate] The final publication
is available at [link.springer.com])
pubblicazioni.bib%3A%3A2015%3AECSQARUProbabilistic Interpretations of the Square of Opposition
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2014%3ASQOOP&bib=pubblicazioni.bib
Niki Pfeifer, Giuseppe Sanfilippo, Angelo Gilio, "Probabilistic Interpretations of the Square of Opposition", In HANDBOOK OF THE WORLD CONGRESS ON THE SQUARE OF OPPOSITION IV, Pontifical Lateran University, Vatican May 5-9, 2014, pp. 88-89, 2014.
pubblicazioni.bib%3A%3A2014%3ASQOOPConditional Random Quantities and Compounds of Conditionals
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2014%3ASL&bib=pubblicazioni.bib
Angelo Gilio, Giuseppe Sanfilippo, "Conditional Random Quantities and Compounds of Conditionals", In Studia Logica, Springer Netherlands, vol. 102, no. 4, pp. 709-729, 2014. ([Research Gate]
The final publication
is available at [link.springer.com])
pubblicazioni.bib%3A%3A2014%3ASLProbabilistic inference and syllogisms
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2014%3AERCIM&bib=pubblicazioni.bib
Giuseppe Sanfilippo, Niki Pfeifer, Angelo Gilio, "Probabilistic inference and syllogisms", In PROGRAMME AND ABSTRACTS, 7th International Conference of the ERCIM (European Research Consortium for Informatics and Mathematics) Working Group on Computational and Methodological Statistics (ERCIM 2014), December, 6-8, 2014, pp. 120, 2014.
pubblicazioni.bib%3A%3A2014%3AERCIMConjunction, Disjunction and Iterated Conditioning of Conditional Events
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2013%3A5SMPS&bib=pubblicazioni.bib
Angelo Gilio, Giuseppe Sanfilippo, "Conjunction, Disjunction and Iterated Conditioning of Conditional Events", Chapter in Synergies of Soft Computing and Statistics for Intelligent Data Analysis, Advances in Intelligent Systems and Computing, Springer Berlin Heidelberg, vol. 190, pp. 399-407, 2013. ([A
version similar to the published paper])
Starting from 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 coherence. We give a representation of the conjoined conditional and we show that this new object is a conditional random quantity, whose set of possible values normally contains the probabilities assessed for the two conditional events. We examine some cases of logical dependencies, where the conjunction is a conditional event; moreover, we give the lower and upper bounds on the conjunction. We also examine an apparent paradox concerning stochastic independence which can actually be explained in terms of uncorrelation. We briefly introduce the notions of disjunction and iterated conditioning and we show that the usual probabilistic properties still hold. pubblicazioni.bib%3A%3A2013%3A5SMPSProbabilistic entailment in the setting of coherence:The role of quasi conjunction and inclusion relation
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2013%3A4IJAR&bib=pubblicazioni.bib
Angelo Gilio, Giuseppe Sanfilippo, "Probabilistic entailment in the setting of coherence:The role of quasi conjunction and inclusion relation", In International Journal of Approximate Reasoning, vol. 54, no. 4, pp. 513-525, 2013. (
[ResearchGate]
[Arxiv])
In this paper, by adopting a coherence-based probabilistic approach to default reasoning, we focus the study on the logical operation of quasi conjunction and the Goodman-Nguyen inclusion relation for conditional events. We recall that quasi conjunction is a basic notion for defining consistency of conditional knowledge bases. By deepening some results given in a previous paper we show that, given any finite family of conditional events F and any nonempty subset S of F, the family F p-entails the quasi conjunction C(S); then, given any conditional event E|H, we analyze the equivalence between p-entailment of E|H from F and p-entailment of E|H from C(S), where S is some nonempty subset of F. We also illustrate some alternative theorems related with p-consistency and p-entailment. Finally, we deepen the study of the connections between the notions of p-entailment and inclusion relation by introducing for a pair (F,E|H) the (possibly empty) class K of the subsets S of F such that C(S) implies E|H. We show that the class K satisfies many properties; in particular K is additive and has a greatest element which can be determined by applying a suitable algorithm. pubblicazioni.bib%3A%3A2013%3A4IJARQuasi conjunction, quasi disjunction, t-norms and t-conorms: Probabilistic aspects
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2013%3A3INS&bib=pubblicazioni.bib
Angelo Gilio, Giuseppe Sanfilippo, "Quasi conjunction, quasi disjunction, t-norms and t-conorms: Probabilistic aspects", In Information Sciences, vol. 245, pp. 146 - 167, 2013. (
[ResearchGate]
[Arxiv]
)
pubblicazioni.bib%3A%3A2013%3A3INSConditional Random Quantities and Iterated Conditioning in the Setting of Coherence
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2013%3A2ECSQARU&bib=pubblicazioni.bib
Angelo Gilio, Giuseppe Sanfilippo, "Conditional Random Quantities and Iterated Conditioning in the Setting of Coherence", Chapter in Symbolic and Quantitative Approaches to Reasoning with Uncertainty, Lecture Notes in Computer Science, Springer Berlin Heidelberg, vol. 7958, pp. 218-229, 2013. ([A
version similar to the published paper] The final publication
is available at [link.springer.com])
pubblicazioni.bib%3A%3A2013%3A2ECSQARUCoherent Conditional Previsions and Proper Scoring Rules
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2012%3A3IPMU&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo, "Coherent Conditional Previsions and Proper Scoring Rules", Chapter in Advances in Computational Intelligence, Communications in Computer and Information Science, Springer, vol. 300, pp. 146-156, 2012. ([A
version similar to the published paper])
In this paper we study the relationship between the notion of coherence for conditional prevision assessments on a family of finite conditional random quantities and the notion of admissibility with respect to bounded strictly proper scoring rules. Our work extends recent results given by the last two authors of this paper on the equivalence between coherence and admissibility for conditional probability assessments. In order to prove that admissibility implies coherence a key role is played by the notion of Bregman divergence. pubblicazioni.bib%3A%3A2012%3A3IPMUFrom imprecise probability assessments to conditional probabilities with quasi additive classes of conditioning events
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2012%3A2UAI&bib=pubblicazioni.bib
Giuseppe Sanfilippo, "From imprecise probability assessments to conditional probabilities with quasi additive classes of conditioning events", In Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, UAI-2012, Catalina Island, United States, August 15--17, pp. 736-745, 2012.
In this paper, starting from a generalized coherent (i.e. avoiding uniform loss) interval-valued probability assessment on a finite family of conditional events, we construct conditional probabilities with quasi additive classes of conditioning events which are consistent with the given initial assessment. Quasi additivity assures coherence for the obtained conditional probabilities. In order to reach our goal we define a finite sequence of conditional probabilities by exploiting some theoretical results on g-coherence. In particular, we use solutions of a finite sequence of linear systems. pubblicazioni.bib%3A%3A2012%3A2UAICompleting the logarithmic scoring rule for assessing probability distributions
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2012%3A1AIP&bib=pubblicazioni.bib
Frank Lad, Giuseppe Sanfilippo, Gianna Agró, "Completing the logarithmic scoring rule for assessing probability distributions", In AIP Conference Proceedings, AIP, vol. 1490, no. 1, pp. 13-30, 2012.
We propose and motivate an expanded version of the logarithmic score for forecasting distributions, termed the Total Log score. It incorporates the usual logarithmic score, which is recognised as incomplete and has been mistakenly associated with the likelihood principle. The expectation of the Total Log score equals the Negentropy plus the Negextropy of the distribution. We examineboth discrete and continuousforms of the scoring rule, and we discuss issues of scaling for scoring assessments. The analysis suggests the dual tracking of the quadratic score along with the usual log score when assessing the qualities of probability distributions. An application to the sequential scoring of forecast distributions for the daily rate of stock returns displays the usefulness of the proposal pubblicazioni.bib%3A%3A2012%3A1AIPCoherent conditional probabilities and proper scoring rules
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2011%3A2isipta&bib=pubblicazioni.bib
Angelo Gilio, Giuseppe Sanfilippo, "Coherent conditional probabilities and proper scoring rules", In ISIPTA'11: Proceedings of the Seventh International Symposium on Imprecise Probability: Theories and Applications, SIPTA, Innsbruck, pp. 189-198, 2011. ([slides])
pubblicazioni.bib%3A%3A2011%3A2isiptaQuasi Conjunction and Inclusion Relation in Probabilistic Default Reasoning
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2011%3A1ECSQARU&bib=pubblicazioni.bib
Angelo Gilio, Giuseppe Sanfilippo, "Quasi Conjunction and Inclusion Relation in Probabilistic Default Reasoning", Chapter in Symbolic and Quantitative Approaches to Reasoning with Uncertainty, Lecture Notes in Computer Science, Springer Berlin / Heidelberg, vol. 6717, pp. 497-508, 2011.
We study in the setting of probabilistic default reasoning under coherence the quasi conjunction, which is a basic notion for defining consistency of conditional knowledge bases, and the Goodman & Nguyen inclusion relation for conditional events. We deepen two results given in a previous paper: the first result concerns p-entailment from a finite family F of conditional events to the quasi conjunction C(S), for each nonempty subset S of F; the second result analyzes the equivalence between p-entailment from F and p-entailment from C(S), where S is some nonempty subset of F. We also characterize p-entailment by some alternative theorems. Finally, we deepen the connections between p-entailment and inclusion relation, by introducing for a pair (F,E|H) the class of the subsets S of F such that C(S) implies E|H. This class isadditive and has a greatest element which can be determined by applying a suitable algorithm. pubblicazioni.bib%3A%3A2011%3A1ECSQARUQuasi Conjunction and p-entailment in Nonmonotonic Reasoning
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2010GS-SMPS&bib=pubblicazioni.bib
Angelo Gilio, Giuseppe Sanfilippo, "Quasi Conjunction and p-entailment in Nonmonotonic Reasoning", Chapter in Combining Soft Computing and Statistical Methods in Data Analysis, Advances in Intelligent and Soft Computing, Springer-Verlag, vol. 77, pp. 321-328, 2010. ([Tec.Rep
pdf])
We study, in the setting of coherence, the extension of a probability assessment defined on n conditional events to their quasi conjunction. We consider, in particular, two special cases of logical dependencies; moreover, we examine the relationship between the notion of p-entailment of Adams and the inclusion relation of Goodman and Nguyen. We also study the probabilistic semantics of the QAND rule of Dubois and Prade; then, we give a theoretical result on p-entailment. pubblicazioni.bib%3A%3A2010GS-SMPSSequentially forecasting economic indices using mixture linear combinations of EP distributions.
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2010ALS-JDS&bib=pubblicazioni.bib
Gianna Agró, Frank Lad, Giuseppe Sanfilippo, "Sequentially forecasting economic indices using mixture linear combinations of EP distributions.", In Journal of Data Science, vol. 8, no. 1, pp. 101-126, 2010.
pubblicazioni.bib%3A%3A2010ALS-JDSOn general conditional prevision assessments
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2009BGS-WUPES&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo, "On general conditional prevision assessments", In Proceedings of the 8th Workshop of Uncertainty Processing, Liblice, Czech Rep., Sept. 19-23, pp. 23-34, 2009.
pubblicazioni.bib%3A%3A2009BGS-WUPESOn General Conditional Random Quantities
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2009BGS-ISIPTA&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo, "On General Conditional Random Quantities", In ISIPTA'09: Proceedings of the Sixth International Symposium on Imprecise Probability: Theory and Applications, Durham, United Kingdom, 14-17 July, SIPTA, pp. 51-60, 2009.
pubblicazioni.bib%3A%3A2009BGS-ISIPTAGeneralized coherence and connection property of imprecise conditional previsions
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2008BGS-IPMU&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo, "Generalized coherence and connection property of imprecise conditional previsions", In 12th Information Processing and Management of Uncertainty in Knowledge-Based Systems Conference, IPMU 2008, Malaga, Spain, June 22 - 27, pp. 907-914, 2008. ([Available on ResearchGate])
pubblicazioni.bib%3A%3A2008BGS-IPMUAssessing fat-tailed sequential forecast distributions for the Dow-Jones index with logarithmic scoring rules
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2007SAL-ISI&bib=pubblicazioni.bib
Giuseppe Sanfilippo, Gianna Agró, Frank Lad, "Assessing fat-tailed sequential forecast distributions for the Dow-Jones index with logarithmic scoring rules", In Bulletin of the International Statistical Institute: Proc of the 56th Session of the International Statistical Institute, ISI'07, Lisbon. August 22-29, vol. LXII(2007), pp. 5681-5684, 2007.
pubblicazioni.bib%3A%3A2007SAL-ISIReassessing Accuracy Rates of Median Decisions
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2007CLS-TAS&bib=pubblicazioni.bib
Andrea Capotorti, Frank Lad, Giuseppe Sanfilippo, "Reassessing Accuracy Rates of Median Decisions", In The American Statistician, American Statistical Association, vol. 61, no. 2, pp. 132-138, 2007. ([A
version similar to the published paper])
We show how Bruno de Finetti's fundamental theorem of prevision has computable applications in statistical problems that involve only partial information. Specifically, we assess accuracy rates for median decision procedures used in the radiological diagnosis of asbestosis. Conditional exchangeability of individual radiologists' diagnoses is recognized as more appropriate than independence which is commonly presumed. The FTP yields coherent bounds on probabilities of interest when available information is insufficient to determine a complete distribution. Further assertions that are natural to the problem motivate a partial ordering of conditional probabilities, extending the computation from a linear to a quadratic programming problem. pubblicazioni.bib%3A%3A2007CLS-TASProbabilistic logic under coherence: complexity and algorithms.
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2005BGLS-AMAI&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Thomas Lukasiewicz, Giuseppe Sanfilippo, "Probabilistic logic under coherence: complexity and algorithms.", In Ann. Math. Artif. Intell., vol. 45, no. 1-2, pp. 35-81, 2005.
In previous work [V. Biazzo, A. Gilio, T. Lukasiewicz and G. Sanfilippo, Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in System P, Journal of Applied Non-Classical Logics 12(2) (2002) 189–213.], we have explored the relationship between probabilistic reasoning under coherence and model-theoretic probabilistic reasoning. In particular, we have shown that the notions of g-coherence and of g-coherent entailment in probabilistic reasoning under coherence can be expressed by combining notions in model-theoretic probabilistic reasoning with concepts from default reasoning. In this paper, we continue this line of research. Based on the above semantic results, we draw a precise picture of the computational complexity of probabilistic reasoning under coherence. Moreover, we introduce transformations for probabilistic reasoning under coherence, which reduce an instance of deciding g-coherence or of computing tight intervals under g-coherent entailment to a smaller problem instance, and which can be done very efficiently. Furthermore, we present new algorithms for deciding g-coherence and for computing tight intervals under g-coherent entailment, which reformulate previous algorithms using terminology from default reasoning. They are based on reductions to standard problems in model-theoretic probabilistic reasoning, which in turn can be reduced to linear optimization problems. Hence, efficient techniques for model-theoretic probabilistic reasoning can immediately be applied for probabilistic reasoning under coherence (for example, column generation techniques). We describe several such techniques, which transform problem instances in model-theoretic probabilistic reasoning into smaller problem instances. We also describe a technique for obtaining a reduced set of variables for the associated linear optimization problems in the conjunctive case, and give new characterizations of this reduced set as a set of non-decomposable variables, and using the concept of random gain. pubblicazioni.bib%3A%3A2005BGLS-AMAILogical conditions for coherent qualitative and numerical probability assessments
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2003BGS-WUPES&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo, "Logical conditions for coherent qualitative and numerical probability assessments", In 6th Workshop on Uncertainty Processing, WUPES'2003, Hejnice, Czech Republic, 24 - 27th September, pp. 1-12, 2003.
pubblicazioni.bib%3A%3A2003BGS-WUPESCoherence Checking and Propagation of Lower Probability Bounds
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2003BGS-SOFTCOMPUTING&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo, "Coherence Checking and Propagation of Lower Probability Bounds", In Soft Computing - A Fusion of Foundations, Methodologies and Applications, Springer Berlin / Heidelberg, vol. 7, pp. 310-320, 2003. ([Research Gate])
pubblicazioni.bib%3A%3A2003BGS-SOFTCOMPUTINGSome Results on Generalized Coherence of Conditional Probability Bounds.
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2003BGS-ISIPTA&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo, "Some Results on Generalized Coherence of Conditional Probability Bounds.", In International symposium on imprecise probabilities and their applications, ISIPTA'03, Lugano, Switzerland 14-17 July, Carleton-Scientific, pp. 62-76, 2003.
pubblicazioni.bib%3A%3A2003BGS-ISIPTAOn the Checking of G-Coherence of Conditional Probability Bounds.
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2003BGS-IJUFKS&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo, "On the Checking of G-Coherence of Conditional Probability Bounds.", In International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 11, Supplement-2, pp. 75-104, 2003.
pubblicazioni.bib%3A%3A2003BGS-IJUFKSProbabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in System P
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2002BGLS-JANCL&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Thomas Lukasiewicz, Giuseppe Sanfilippo, "Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in System P", In Journal of Applied Non-Classical Logics, vol. 12, no. 2, pp. 189-213, 2002. (Citation [Scopus] )
pubblicazioni.bib%3A%3A2002BGLS-JANCLProbabilistic Logic under Coherence, Model-Theoretic Probabilistic Logic, and Default Reasoning
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=Biazzo2001&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Thomas Lukasiewicz, Giuseppe Sanfilippo, "Probabilistic Logic under Coherence, Model-Theoretic Probabilistic Logic, and Default Reasoning", Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 290-302, 2001.
pubblicazioni.bib%3A%3ABiazzo2001Algorithms for coherence checking and propagation of conditional probability bounds
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2001BGS-KI&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo, "Algorithms for coherence checking and propagation of conditional probability bounds", In Workshop on Uncertainty in Artificial Intelligence, KI-2001, September,17, Vienna., pp. 125-135, 2001.
pubblicazioni.bib%3A%3A2001BGS-KIProbabilistic Logic under Coherence: Complexity and Algorithms
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2001BGLSb-ISIPTA&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Thomas Lukasiewicz, Giuseppe Sanfilippo, "Probabilistic Logic under Coherence: Complexity and Algorithms", In International symposium on imprecise probabilities and their applications, ISIPTA'01, Ithaca, NY, USA, 26 - 29 June, pp. 51-61, 2001.
pubblicazioni.bib%3A%3A2001BGLSb-ISIPTAProbabilistic Logic under Coherence, Model-Theoretic Probabilistic Logic, and Default Reasoning.
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2001BGLS-ECSQARU&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Thomas Lukasiewicz, Giuseppe Sanfilippo, "Probabilistic Logic under Coherence, Model-Theoretic Probabilistic Logic, and Default Reasoning.", Chapter in Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 6th European Conference, ECSQARU 2001, Toulouse, France, September 19-21, 2001, Proceedings, LNCS/LNAI series, Springer, vol. 2143, pp. 290-302, 2001.
pubblicazioni.bib%3A%3A2001BGLS-ECSQARUComputational Aspects in Checking of Coherence and Propagation of Conditional Probability Bounds
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2000BGS-WUPES&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo, "Computational Aspects in Checking of Coherence and Propagation of Conditional Probability Bounds", In 5th Workshop on Uncertainty Processing, WUPES'2000, Jindrichuv Hradec, Czech Republic,June 21-24, 2000, pp. 1-13, 2000.
pubblicazioni.bib%3A%3A2000BGS-WUPESEfficient Checking of Coherence and Propagation of Imprecise Probability Assessments
http://www1.unipa.it/sanfilippo/bibtexbrowser.php?key=2000BGS-IPMU&bib=pubblicazioni.bib
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo, "Efficient Checking of Coherence and Propagation of Imprecise Probability Assessments", In 8th Information Processing and Management of Uncertainty in Knowledge-Based Systems Conference, IPMU-2000, Madrid, July 3 - 7, pp. 1973-1976, 2000.
pubblicazioni.bib%3A%3A2000BGS-IPMU