About: MINISATION OF COMPLEXLOGICAL FUNCTIONS

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: MINISATION OF COMPLEXLOGICAL FUNCTIONS Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://czechuniversity.com/dokumenty/konference/2012/ICSC.pdf
Description	: Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-known Quine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give a generally usable method for finding an optimum for logical functions with a high number of values, we focus on interpretation of the result of the Quine-McCluskey method and show that it represents a set covering problem that, unfortunately, is an NP-hard combinatorial problem. Therefore it must be solved by heuristic or approximation methods. We propose an approach based on genetic algorithms and show suitable parameter settings. : Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-known Quine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give a generally usable method for finding an optimum for logical functions with a high number of values, we focus on interpretation of the result of the Quine-McCluskey method and show that it represents a set covering problem that, unfortunately, is an NP-hard combinatorial problem. Therefore it must be solved by heuristic or approximation methods. We propose an approach based on genetic algorithms and show suitable parameter settings. (en)
Title	MINISATION OF COMPLEXLOGICAL FUNCTIONS MINISATION OF COMPLEXLOGICAL FUNCTIONS (en)
skos:prefLabel	MINISATION OF COMPLEXLOGICAL FUNCTIONS MINISATION OF COMPLEXLOGICAL FUNCTIONS (en)
skos:notation	RIV/63468352:_____/12:#0000274!RIV13-MSM-63468352
http://linked.open...avai/predkladatel	Evropský polytechnický institut, s.r.o.
http://linked.open...avai/riv/aktivita	N
http://linked.open...avai/riv/aktivity	N
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Šeda, Miloš
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Evropský polytechnický institut, s.r.o. / (nerozlišená součást)
http://linked.open...dnocenehoVysledku	150669
http://linked.open...ai/riv/idVysledku	RIV/63468352:_____/12:#0000274
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Boolean algebra, Karnaugh map, Quine-McCluskey method, set covering problem, genetic algorithm (en)
http://linked.open.../riv/klicoveSlovo	Boolean algebra genetic algorithm Karnaugh map Quine-McCluskey method set covering problem
http://linked.open...ontrolniKodProRIV	[81ECEDA4DEE8]
http://linked.open...v/mistoKonaniAkce	Kunovice
http://linked.open...i/riv/mistoVydani	Kunovice
http://linked.open...i/riv/nazevZdroje	TENTH INTERNATIONAL CONFERENCE ON SOFT COMPUTING APPLIED IN COMPUTER AND ECONOMIC ENVIRONMENTS
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Šeda, Miloš
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open.../riv/zahajeniAkce	2012-01-20 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Evropský polytechnický institut, s.r.o.
https://schema.org/isbn	978-80-7314-279-7

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 92 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software