• Journal of Information Processing Systems
• /
• v.9 no.1
• /
• pp.1-30
• /
• 2013

The capitalization of know-how, knowledge management, and the control of the constantly growing information mass has become the new strategic challenge for organizations that aim to capture the entire wealth of knowledge (tacit and explicit). Thus, knowledge mapping is a means of (cognitive) navigation to access the resources of the strategic heritage knowledge of an organization. In this paper, we present a new mapping approach based on the Boolean modeling of critical domain knowledge and on the use of different data sources via the data mining technique in order to improve the process of acquiring knowledge explicitly. To evaluate our approach, we have initiated a process of mapping that is guided by machine learning that is artificially operated in the following two stages: data mining and automatic mapping. Data mining is be initially run from an induction of Boolean case studies (explicit). The mapping rules are then used to automatically improve the Boolean model of the mapping of critical knowledge.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.4
• /
• pp.43-51
• /
• 1984

In the case of Quine Mccluskey's methode for Boolean function minimization, we have to examine each bits of binary represented minterms. In this paper, cube relations between misterms that are represented by means of decimal number, and all sorts of rules for Boolean function minimization are described as theorems, and they are verified. And based on these theorems, the new fast algorithm for Boolean function minimization is proposed. An example of manual operation is sholvn, and the process is writed out by a FORTRAN program. In this program, the essential pl.imp implicants of the Boolean function that has 100 each of minterms including redundant minterms, are finked and printed out, (the more minterms can be treated if we take the more larger size of arrays) and the outputs are coincided with the results of manual operation.

• The KIPS Transactions:PartA
• /
• v.15A no.1
• /
• pp.9-16
• /
• 2008

This paper presents a new Boolean extraction technique for logic synthesis. This method extracts two-cube Boolean subexpression pairs from each logic expression. It begins by creating two-cube array, which is extended and compressed with complements of two-cube Boolean subexpressions. Next, the compressed two-cube array is analyzed to extract common subexpressions for several logic expressions. The method is greedy and extracts the best common subexpression. Experimental results show the improvements in the literal counts over well-known logic synthesis tools for some benchmark circuits.

• Journal of the Korean Mathematical Society
• /
• v.51 no.1
• /
• pp.113-123
• /
• 2014

The term rank of a matrix A over a semiring $\mathcal{S}$ is the least number of lines (rows or columns) needed to include all the nonzero entries in A. In this paper, we characterize linear operators that preserve the sets of matrix ordered pairs which satisfy extremal properties with respect to term rank inequalities of matrices over nonbinary Boolean semirings.

• Korean Journal of Logic
• /
• v.9 no.2
• /
• pp.1-30
• /
• 2006

This paper investigates algebraic semantics for some weak Boolean (wB) logics, which may be regarded as left-continuous t-norm based logics (or monoidal t-norm based logics (MTLs)). We investigate as infinite-valued logics each of wB-LC and wB-sKD, and each corresponding first order extension $wB-LC\forall$ and $wB-sKD\forall$. We give algebraic completeness for each of them.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.3
• /
• pp.338-348
• /
• 2006

We classify the 3-classes In the semigroup M$_5$(F) of all 5$\times$5 Boolean matrices over F=(0,1).

• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.337-340
• /
• 2000

In this paper, we put forth a procedure that target low power logic synthesis based on XOR representation of Boolean functions, and the results of synthesis procedure are a multi-level XOR form with minimum switching activity. Specialty, this paper show a method to extract the common cubes or kernels by Boolean matrix and rectangle covering, and to estimate the power consumption in terms of the extracted common sub-functions.

• Communications of the Korean Mathematical Society
• /
• v.18 no.2
• /
• pp.207-214
• /
• 2003

There exist two distinct Symmetric differences in a non Boolean orthomodular lattics. Let L be an orthomodular lattice. Then L is a Boolean algebra if and only if one symmetric difference is equal to the other. An orthomodular lattice L is Boolean if and only if one of two symmetric differences of L is associative.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.197-204
• /
• 2005

For two distinct rank-1 matrices A and B, a rank-1 matrix C is called a separating matrix of A and B if the rank of A + C is 2 but the rank of B + C is 1 or vice versa. In this case, rank-1 matrices A and B are said to be separable. We show that every pair of distinct Boolean rank-l matrices are separable.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.2
• /
• pp.515-526
• /
• 2021

Denote by ��+ the set of probability measures supported on ℝ+. Suppose V�� is the variance function of the Cauchy-Stieltjes Kernel (CSK) family ��-(��) generated by a non degenerate probability measure �� ∈ ��+. We determine the formula for variance function under boolean multiplicative convolution power. This formula is used to identify the relation between variance functions under the map ${\nu}{\mapsto}{\mathbb{M}}_t({\nu})=({\nu}^{{\boxtimes}(t+1)})^{{\uplus}{\frac{1}{t+1}}}$ from ��+ onto itself.