A Generalized Probabilistic Version of Modus Ponens
Giuseppe Sanfilippo, Niki Pfeifer, Angelo Gilio

TL;DR
This paper generalizes the probabilistic Modus Ponens rule by incorporating conditional events and iterated conditionals, enabling more nuanced uncertainty management in logical inference.
Contribution
It introduces a generalized probabilistic MP using conditional events and iterated conditionals, extending the classical rule to handle nested uncertainties.
Findings
Propagation rules for bounds are consistent with non-nested probabilistic MP.
The generalized rule manages uncertainty propagation through iterated conditionals.
The approach formalizes inference with conditional random quantities.
Abstract
Modus ponens (\emph{from and "if then " infer }, short: MP) is one of the most basic inference rules. The probabilistic MP allows for managing uncertainty by transmitting assigned uncertainties from the premises to the conclusion (i.e., from and infer ). In this paper, we generalize the probabilistic MP by replacing by the conditional event . 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 MP coincide with the respective bounds on the conclusion for the (non-nested) probabilistic MP.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Semantic Web and Ontologies · Bayesian Modeling and Causal Inference
