Probability Operators

2010 ◽  
Vol 5 (11) ◽  
pp. 916-937 ◽  
Author(s):  
Seth Yalcin
Author(s):  
Zoran Marković ◽  
Miodrag Rašković

2019 ◽  
Vol 17 (1) ◽  
pp. 282-296 ◽  
Author(s):  
Guorong Zhou ◽  
Qing-Bo Cai

Abstract Based on the relationship between probability operators and curve/surface modeling, a new kind of surface modeling method is introduced in this paper. According to a kind of bivariate Meyer-König-Zeller operator, we study the corresponding basis functions called triangular Meyer-König-Zeller basis functions which are defined over a triangular domain. The main properties of the basis functions are studied, which guarantee that the basis functions are suitable for surface modeling. Then, the corresponding triangular surface patch called a triangular Meyer-König-Zeller surface patch is constructed. We prove that the new surface patch has the important properties of surface modeling, such as affine invariance, convex hull property and so on. Finally, based on given control vertices, whose number is finite, a truncated triangular Meyer-König-Zeller surface and a redistributed triangular Meyer-König-Zeller surface are constructed and studied.


2007 ◽  
pp. 141-154 ◽  
Author(s):  
Zoran Ognjanovic ◽  
Nebojsa Ikodinovic

We investigate probability logic with the conditional probability operators This logic, denoted LCP, allows making statements such as: P?s?, CP?s(? | ?) CP?0(? | ?) with the intended meaning "the probability of ? is at least s" "the conditional probability of ? given ? is at least s", "the conditional probability of ? given ? at most 0". A possible-world approach is proposed to give semantics to such formulas. Every world of a given set of worlds is equipped with a probability space and conditional probability is derived in the usual way: P(? | ?) = P(?^?)/P(?), P(?) > 0, by the (unconditional) probability measure that is defined on an algebra of subsets of possible worlds. Infinitary axiomatic system for our logic which is sound and complete with respect to the mentioned class of models is given. Decidability of the presented logic is proved.


2017 ◽  
Vol 27 ◽  
pp. 525
Author(s):  
Daniel Lassiter

This paper analyzes indicative and counterfactual conditionals that have in their consequents probability operators: probable, likely, more likely than not, 50% chance and so on. I provide and motivate a unified compositional semantics for both kinds of probabilistic conditionals using a Kratzerian syntax for conditionals and a representation of information based on Causal Bayes Nets. On this account, the only difference between probabilistic indicatives and counterfactuals lies in the distinction between conditioning and intervening. This proposal explains why causal (ir)relevance is crucial for probabilistic counterfactuals, and why it plays no direct role in probabilistic indicatives. I conclude with some complexities related to the treatment of backtracking counterfactuals and subtleties revealed by probabilistic language in the revision procedure used to create counterfactual scenarios. In particular, I argue that certain facts about the interaction between probability operators and counterfactuals motivate the use of Structural Equation Models (Pearl 2000) rather than the more general formalism of Causal Bayes Nets.


Topoi ◽  
2011 ◽  
Vol 30 (1) ◽  
pp. 17-29 ◽  
Author(s):  
Paul Égré ◽  
Mikaël Cozic

Sign in / Sign up

Export Citation Format

Share Document