@InProceedings{Petrik:ISCAM2005,
  IS = { zkontrolovano 03 Jan 2006 },
  UPDATE  = { 2005-12-15 },
	author =      { Petr{\'\i}k, Milan },
	title =       { Many-Valued Generalization of the {Q}uine-{M}c{C}luskey Method 
                        Based on the Operations of Minimum, Maximum and {K}ronecker Delta },
	year =        { 2005 },
	pages =       { 26 },
	booktitle =   { ISCAM 2005: International Conference in Applied 
		        Mathematics for Undergraduate and Graduate Students },
	editor =      { Tom{\'a}{\v s} Bogn{\'a}r, Karla {\v C}{\'\i}pkov{\'a}, Michal Zajac },
	publisher =   { FEI, Slovak University of Technology },
	address =     { Bratislava, Slovakia },
	isbn =        { none },
	book_pages =  { 36 },
	month =       { April },
	day =         { 15--16 },
	venue =       { Bratislava, Slovakia },
	annote = { The Quine-McCluskey method is an algorithm which
          finds a minimized normal form for a logical function.  It is
          based, as well as the tool of Svoboda and Karnaugh maps, on
          finding maximal groups of neighboring combinations of values
          of the input variables and a minimal covering of them.  It
          has been designed for a usage in digital computers and for
          finding normal forms for functions which have more than 4
          input variables, since Svoboda and Karnaugh maps become
          almost unusable for such big functions. In this paper we
          present a generalization of this method to the many-valued
          logic.  Our approach is based on the functionally complete
          set of operations constituted by minimum, maximum, Kronecker
          delta and logical constants. },
	keywords =    { Quine-McCluskey method, many-valued logic, 
                        fuzzy logic, hardware design,
                        logical circuit design, normal forms },
	prestige =    { international },
	authorship =  { 100 },
	project =     { CEEPUS SK-042 },
	www         = { http://zeus.elf.stuba.sk/Katedry/KM/iscam/ },
}