More work is needed on devising practical, but theoretically wellfounded procedures for doing object-oriented database (OODB) &sign. Besides being practical and having formal properties, these design procedures should alSo be flexible enough to allow for peculiarities that make applications unique. In this paper. we present and discuss an OODB design procedure that addresses these problems. The...

The main purpose of this paper is to prove some new coincidence and common fixed point theorems for noncommuting generalized f -nonexpansive multivalued mappings on non-starshaped domain in the framework of a Banach space. As applications, related common fixed point, invariant approximation, and random coincidence point results are established. This work provides extension as well as substantia...

In this paper, we introduced the notion of a generalized multivalued (α,φ)-almost contractions and establish the existence of fixed point theorems for this class of mapping. The results presented in this paper generalize and extend some recent results in multivalued almost contraction. Also, we show its applications in the Ulam-Hyers stability of fixed point problems for multivalued operators.

In this paper we study multivalued martingales in continuous time. First we show that every multivalued martingale in continuous time can be represented as the closure of a sequence of martingale selections. Then we prove two results concerning the cadlag modifications of continuous time multivalued martingales, in Kuratowski-Mosco convergence and in convergence in the Hausdorff metric respecti...

We present the performance of three different multivalued current mode 1-bit adders. These circuits have been simulated with the electrical parameters of a standard 1.2 μm CMOS technology. The performance of a binary voltage mode 1-bit adder is also presented. The binary version uses twice more transistors comparing with multivalued ones, but it is two or three times faster. Multivalued version...

The paper presents an approach for handling uncertain information in deductive databases using multivalued logics. Uncertainty means that database facts may be assigned logical values other than the conventional ones true and false. The logical values represent various degrees of truth, which may be combined and propagated by applying the database rules. A corresponding multivalued database sem...

The paper presents a new method for multivalued simulation of digital circuits based on calculation of Boolean derivatives on BDDs (or structural alternative graphs). A procedure for calculation of maximums of Boolean derivatives as the basis of multivalued simulation is given. The method is applicable for component level representations of digital circuits where as components arbitrary subcirc...

In this paper, we first establish collective fixed points theorems for a family of multivalued maps with or without assuming that the product of these multivalued maps is Φ-condensing. As an application of our collective fixed points theorem, we derive the coincidence theorem for two families of multivalued maps defined on product spaces. Then we give some existence results for maximal elements...

In this work a model for planning with multivalued fluents and graded actions, that allows preferences specifications and plan metric, is introduced. This model is based on the infinity-valued Łukasiewicz logic. In multivalued planning, fluents can assume truth values in the interval [0, 1] and actions can be executed at different application degrees also varying in [0, 1]. The notions of plann...

Linearization and planarization of the circuit models is pivotal to the submicron technologies. On the other hand, the characteristics of the VLSI circuits can be sometimes improved by using the multivalued components. It was shown that any `-level circuit based on the multivalued components is representable as an algebraic model based on ` linear arithmetic polynomials mapped correspondingly i...