Multi-valued logic
My interest in multi-valued logic may be characterized as superficial.
I never had the nerve to systematically study the theory. I may be unaware
of some classical results in this area. However, while developing algorithms
and observing the results of computation in the binary domain, I often
wondered how would these or similar ideas scale if the number of values
were larger than two. Well in the spirit of generalizing everything to
multi-valued logic, a great tradition started by Dr.
Marek Perkowski and his students, some of our recently-developed binary
algorithms have actually been generalized, in particular bi-decomposition
(see IWLS'01 paper in Publications).
In the future I would like to publish here some of the results related
to multi-valued decomposition and testing algorithms. In particular, an
informal account of the multi-valued bi-decomposer BI-DECOMP-MV and how
decomposition of multi-valued functions relates to datamining and robotics.
Currently, the work to integrate BI-DECOMP-MV with MVSIS
is under way.
Alan Mishchenko's Home Page
This page has been last modified on September 30, 2001.