| Project/Area Number |
13640136
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | College of Liberal Arts, International Christian University |
|---|
Principal Investigator |
POGOSYAN Grant R. International Christian University, College of Liberal Arts, Professor, 教養学部, 教授 (90234640)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
TAKAHASHI Masako International Christian University, College of Liberal Arts, Professor, 教養学部, 教授 (00015588)
|
|---|
| Project Period (FY) |
2001 – 2004
|
| Project Status |
Completed (Fiscal Year 2004)
|
| Budget Amount *help |
¥3,200,000 (Direct Cost: ¥3,200,000)
Fiscal Year 2004: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 2003: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 2002: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 2001: ¥1,400,000 (Direct Cost: ¥1,400,000)
|
|---|
| Keywords | boolean functions / optimal expansions / clones / multiple-valued logic / functional terms / logic functions / universal algebra |
|---|
| Research Abstract |
The following optimization and characterization problems for functions and classes were in focus :
(1) Optimal Expansion of Boolean and Multiple-Valued Logic Functions : The notion of efficiently irreducible bases (introduced earlier by the head researcher) was used to choose a set of generators for an optimal expansion of logic functions. For Boolean functions and one such generator base, namely AND, XOR NOT, an algorithm for building a shortest, in terms of the number of literals, ESOP (Exclusive Sum of Products) was designed and implemented.
(2) Functional Terms for Characterizing Classes of Logic Functions : A formal expression called ‘functional term' was introduced and used to neatly characterize functional classes. Various properties and criteria for such characterization were obtained. The method was applied to the closed classes of Boolean functions achieving complete description of the Post's lattice in such terms.
(3) Clones and Universal Algebra : Clones (special closed classes of finite-valued logic functions) form an algebraic lattice which is still widely unknown for non-boolean cases. The clones which are irreducible in terms of lattice operations (join and/or meet) were studied. It was shown that the lattice can be fully generated by both join- and meet-irreducible clones. Some special chains of such irreducible clones were described (a joint work with I.G.Rosenberg).
|
