Coherent manipulation of spin ensembles is a key issue in the development of spintronics. In particular, multivalued spin switching may lead to new schemes of logic gating and memories. This phenomenon has been studied with atom vapours 30 years ago, but is still awaited in the solid state. Here, we demonstrate spin multistability with microcavity polaritons in a trap. Owing to the spinor natur...

We extend the result on the equivalence between functional and multivalued dependencies in relational databases and a fragment of propositional logic. It is shown that this equivalence still holds for functional and multivalued dependencies in databases that support complex values via nesting of records and lists. The equivalence has several implications. Firstly, it extends a well-known result...

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...

This paper considers the construction of Petri nets to simulate conditional computation in various forms of systems. Coloured Petri nets underly the definition of a family of Petri nets based on rough set theory. Multivalued logic provides the basis for a family of guards on transitions with a form of continuous enabling. The notion of levelof-enabling of transitions is introduced. A second fam...

In this paper, the modal logic interpretation of plausibility and belief measures on an arbitrary universe of discourse, as proposed by Harmanec et al., is further developed by employing notions from set-valued analysis. In a model of modal logic, a multivalued mapping is constructed from the accessibility relation and a mapping determined by the value assignment function. This multivalued mapp...

In this work a model for planning with multivalued fluents and graded actions, based on the infinite valued Lukasiewicz logic, is introduced. 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 planning problem and solution plan also reflect a multivalued approach. Mul...

We develop a multivalued logic for quantum computing for use in multi-level quantum systems, and discuss the practical advantages of this approach for scaling up a quantum computer. Generalizing the methods of binary quantum logic, we establish that arbitrary unitary operations on any number of d-level systems (d .2) can be decomposed into logic gates that operate on only two systems at a time....

Default reasoning can provide a means of deriving plausible semantic conclusion under imprecise and contradictory information in forensic visual surveillance. In such reasoning under uncertainty, proper uncertainty handling formalism is required. A discrete species of Bilattice for multivalued default logic demonstrated default reasoning in visual surveillance. In this article, the authors pres...

Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dynamic properties of systems where complete, agreed upon models of the system are not available. This paper presents a symbolic model checker for multi-valued temporal logics. The model checker works for any multivalued ...