Several query mapping algorithms have been proposed to translate XML queries into SQL queries for a schema-based relational XML storage. However, existing query mapping algorithms only support single-valued mapping schemes, in which each XML element type is mapped to exactly one relation, and do not support multi-valued mapping schemes, in which each XML element type can be mapped to multiple r...

n this paper , we propose a generalized iterative method forfinding a common element of the set of fixed points of a singlenonexpannsive mapping and the set of solutions of two variationalinequalities with inverse strongly monotone mappings and strictlypseudo-contractive of browder-petryshyn type mapping. our resultsimprove and extend the results announced by many others.

In this paper, by defining a pair of classical sets as a relative set, an extension of the classical set algebra which is a counterpart of Belnap’s four-valued logic is achieved. Every relative set partitions all objects into four distinct regions corresponding to four truth-values of Belnap’s logic. Like truth-values of Belnap’s logic, relative sets have two orderings; one is an order of inclu...

In this paper we study the question of the existence of a continuous inverse to the multiplication mapping (/, g) -» (fg, g) defined on pairs of C°° functions on a manifold M. Obviously, restrictions must be imposed on the domain of such an inverse. This leads us to the study of a modified problem: Find an appropriate domain for the inverse of (/, G) -» (/(/> ° G), G), where G is a C°° mapping ...

We logically model uncertainty by expanding language without changing logical reasoning rules. We expand the language of set theory by adding new predicate symbols, uncertain membership relations ∈+ and ∈−. We define the set theory ZF± as an extension of ZF with new symbols in classical logic. In this system we can represent uncertainty which is naturally represented in the model of 3-valued lo...

The best approximation problem in a hyperconvex metric space consists of finding conditions for given set-valued mappings F andG and a setX such that there is a point x0 ∈ X satisfying d G x0 , F x0 ≤ d x, F x0 for x ∈ X. When G I, the identity mapping, and when the set X is compact, best approximation theorems for mappings in hyperconvex metric spaces are given for the single-valued case in 1–...

the aim of this paper is to introduce and study set- valued homomorphism on lattices and t-rough lattice with respect to a sublattice. this paper deals with t-rough set approach on the lattice theory. the result of this study contributes to, t-rough fuzzy set and approximation theory and proved in several papers. keywords: approximation space; lattice; prime ideal; rough ideal; t-rough set; set...

In this paper the concept of Zamfirescu single-valued maps is extend to multi-valued maps and then we study the fixed point properties. We show that the multi-valued Zamfirescu mapping has an iteration which converges to a fixed point and give a rate of convergence. Data dependence problems on multi-valued Zamfirescu mapping are studied.