We discuss the concept of probabilistic quasi-nonexpansive mappings in connection with the mappings of Nishiura. We also prove a result regarding the convergence of the sequence of successive approximations for probabilistic quasi-nonexpansive mappings.

Proof by coupling is a classical proof technique for establishing probabilistic properties of two probabilistic processes, like stochastic dominance and rapid mixing of Markov chains. More recently, couplings have been investigated as a useful abstraction for formal reasoning about relational properties of probabilistic programs, in particular for modeling reduction-based cryptographic proofs a...

In 1989, Kent and Richardson [Ordered probabilistic metric spaces, J. Austral. Math. Soc. Ser. A 46(1) (1989), 88-99, MR0966286 (90b:54022)] introduced the class of probabilistic quasi-metric spaces which offers a wider framework than that of metric spaces. The aim of this paper is to prove common fixed point theorems for single-valued and set-valued weakly compatible mappings in Menger probabi...

We make a probabilistic analysis related to some inference rules which play an important role in nonmonotonic reasoning. In a coherence-based setting, we study the extensions of a probability assessment defined on n conditional events to their quasi conjunction, and by exploiting duality, to their quasi disjunction. The lower and upper bounds coincide with some well known t-norms and t-conorms:...

In this paper, by means of operations (is called in [1, 2, 3] φ,ψ) we shall define φψ-continuity between two L-fuzzy quasi-uniform spaces. We shall prove that φψ-continuity between two L-fuzzy quasi-uniformity induces φψ-continuity between L-fuzzy topology generated by them. We shall investigate some Theorems on L-fuzzy uniform spaces. 2000 Mathematics Subject Classification:54A40, 03E72

We show new limits on the efficiency of using current techniques to make exact probabilistic inference for large classes of natural problems. In particular we show new lower bounds on knowledge compilation to SDD and DNNF forms. We give strong lower bounds on the complexity of SDD representations by relating SDD size to best-partition communication complexity. We use this relationship to prove ...