Abstract
This paper shows that the problem of decomposing a finite function f(A,B) into the form h(g(A),B), where g is a Boolean function, can be resolved in polynomial time, with respect to the size of the problem. It is also shown that omission of the characteristic of the g function can significantly complicate the problem. Such a general problem belongs to the NP-hard class of problems. The work shows how the problem of decomposition of a finite function can be reduced to the problem of coloring the vertices of a graph. It is also shown that the problem of decomposition of relations can be reduced to coloring the vertices of their hypergraphs. In order to prove the validity of the theorems, combinatory properties of Helly are used.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Berge C.: Hypergraphs, Combinatorics of Finite Sets, North-Holland, 1989.
Boros E., Guvich V., Hammer P. L., Ibaraki T., Kogan A.: Decompositions of Partially Defined Boolean Functions, DIMACS-TR-94-9, 1994.
Garey M.R., Johnson D.S.: Computers and Intractability: a guide to the theory of NP-Completeness, W.H. Freeman and Company, San Framncisco, 1979.
ŁLuba T.: Decomposition of Multiple-Valued Functions, 25 ISMVL, US, 1995.
ALuba T., Selvaraj H.: A General Approach to Boolean Function Decomposition and its Applications in FPGA-based Synthesis, VLSI Design. Special Issue on Decompositions in VLSI Design, vol 3, Nos. 3-4, 289–300, 1995.
Perkowski M., Marek-Sadowska M., Jóźwiak L., ALuba T., Grygiel S., Nowicka M., Malivi R., Wang Z., Zhang J. S.: Decomposition of Multiple-Valued Relations, Proc. of International Symposium AA on MVL, 1997.
Ross T., Noviskey, Taylor T., Gadd D.: Pattern Theory: An Engineering Paradigm For Algorith Design, Wright Laboratory, Wrigh-Patterson Air Force Base, 1990.
Sapiecha P., Perkowski M., ALuba T.: Decomposition of Information Systems Based on Graph Coloring Heuristics, Proc. CESA'96 IMACS Multiconference, France, 1996.
Sapiecha P.: Algorytmy syntezy funkcji i relacji boolowskich w aspekcie metod reprezentacji i kompresji danych, Ph.D. Thesis (in Polish), PW, 1998.
Selvaraj H., ALuba T., Nowicka M., Bignall B.: Multiple-Valued Decomposition and its Applications in Data Compression and Technology Mapping, International Conference on Computational Intelligence and Multimedia Applications, Australia, 1997.
Selvaraj H., Nowicka M., ALuba T.: Non-Disjoint Decomposition Strategy in Decomposition-Based Algorithms and Tools. Proc. International Conferece on Computational Intelligence and Multimedia Applications. Eds.: Selvaraj H. and Verma B., World Scientific, Singapore 1998.
Wan W., Perkowski M. A.: A New Approach to the Decomposition of Incompletely Specified Multi-Output Functions Based on Graph Coloring and Local Transformations and Its Applications to FPGA Mapping, Proc. European Design Automation Conference, 1992.
Zupan B., Bohanec M., Bratko I., Demšar.: Machine Learning by Function Decomposition, ICML, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sapiecha, P., Selvaraj, H., Pleban, M. (2001). Decomposition of Boolean Relations and Functions in Logic Synthesis and Data Analysis. In: Ziarko, W., Yao, Y. (eds) Rough Sets and Current Trends in Computing. RSCTC 2000. Lecture Notes in Computer Science(), vol 2005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45554-X_60
Download citation
DOI: https://doi.org/10.1007/3-540-45554-X_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43074-2
Online ISBN: 978-3-540-45554-7
eBook Packages: Springer Book Archive