In this paper, we introduce a new sequential space as generalization of M − metricspaces and b metric spaces. generalized define two contractive mappings namely m contraction quasi-contraction prove some fixed point theorems for such type mappings. Several illustrative examples have been presented in strengthening the hypothesis our theorems.

We review in this paper some recent yet fundamental results on evaluating queries over probabilistic databases. While one can see this problem as a special instance of general purpose probabilistic inference, we describe in this paper two key database specific techniques that significantly reduce the complexity of query evaluation on probabilistic databases. The first is the separation of the q...

We introduce probabilistic many-valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex than classical logic programming. More precisely, some deduction problems that are P-complete for classical logic programs are shown to be co-NP-complete for probabilistic many-v...

we design a two-stage scheme to consider trajectory planning problem of two mobile manipulators for cooperative transportation of a rigid body in presence of static obstacles. within the first stage, regarding the static obstacles we develop a method that searches the workspace for the shortest possible path between start and goal configurations by constructing a graph on a portion of the confi...

I present a probabilistic analysis of propositional STRIPS planning. The analysis considers two assumptions. One is that each possible precondition (likewise postcondition) of an operator is selected independently of other pre-and postconditions. The other is that each operator has a xed number of preconditions (likewise postconditions). Under both assumptions , I derive bounds for when it is h...

Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks. Firstly, we show that Pctl probabilistic model-checking problems (such as determining whether a set of target states can be reached with probability at least 0.99 regardless...

Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks. Firstly, we show that PCTL probabilistic model-checking problems (such as determining whether a set of target states can be reached with probability at least 0.99 regardless...

Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks. Firstly, we show that PCTL probabilistic model-checking problems (such as determining whether a set of target states can be reached with probability at least 0.99 regardless...

A complete equational axiomatization of probabilistic bisimulation for nite-state probabilistic processes is presented. It extends Milner's complete axiomatiza