Recently, a propositional logic modeling of analogical proportions, i.e., statements of the form “A is to B as C is to D”, has been proposed, and has then led to introduce new related proportions in a general setting. This framework is well-suited for analogical reasoning and classification tasks about situations described by means of Boolean properties. There is a clear need for extending this...

This paper generalises the tree-based data structure of ∆tree to be applied to signed propositional formulas. The ∆-trees allow a compact representation for signed formulas as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula. The conversions from signed formulas to ∆-trees and vice...

In fuzzy domain, a variable (vague linguistic term) often depends not only on a single variable but on more then one variables. In such a situation multiple regression analysis is more appropriate than simple regression analysis involving one independent variable. This paper introduces fuzzy multiple regression equations of fuzzy sets those are treated as a variable with certain values assigned...

Kleene’s strong three-valued logic extends naturally to a four-valued logic proposed by Belnap. We introduce a guard connective into Belnap’s logic and consider a few of its properties. Then we show that by using it four-valued analogs of Kleene’s weak three-valued logic, and the asymmetric logic of Lisp are also available. We propose an extension of these ideas to the family of distributive bi...

Multi-phase clocking methods are well known and widely used in high-performance integrated circuit design. Such a scheme allows for relaxation of timing constraints among disjoint partitions of the logic circuitry since lower frequency local clocking is required as compared to the system clock frequency at the cost of increased clock distribution network area. The disadvantage is that multiple ...

The synthesis of digital circuits is generally performed in two level logic switching algebra. But if we increase the representation domain from two level logic (N=2) to N>2 then the design of Multiple Valued Logic (MVL) digital circuits is possible. Interconnections play an important role in deep submicron designs as they affects power and area. Due to the requirement of interconnections the d...

There is an intimate correlation between rough set theory and formal concept analysis theory, so rough set approximations can be realized by means of formal concept analysis. For any given multiple valued information system, the realization of rough set approximation operation has two major steps, firstly convert the information system from multiple valued one to single valued formal context, s...

A Qk(R ) -valued function is essentially a rule assigning k unordered and non necessarily distinct elements of R to each element of its domain set A ⊆ R . For a Qk(R) valued function f we construct a decomposition into k branches that naturally inherit the regularity properties of f . Next we prove that a measurable Qk(R ) -valued function admits a decomposition into k measurable branches. An e...

The 29th International Symposium on Multiple-Valued Logic (ISMVL99) was held in Freiburg im Breisgau, Germany, May 20-22, 1999. The Symposium was co-sponsored by the Albert-Ludwigs-Universität Freiburg (or University of Freiburg), and the IEEE Computer Society Technical Committee on Multiple-Valued Logic. Two invited addresses and 42 contributed papers were presented by MVL researchers from aro...