Knowledge compilation from DNF to switch-list representations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10335319" target="_blank" >RIV/00216208:11320/16:10335319 - isvavai.cz</a>
Result on the web
<a href="http://isaim2016.cs.virginia.edu/papers/ISAIM2016_Boolean_Cepek_Husek.pdf" target="_blank" >http://isaim2016.cs.virginia.edu/papers/ISAIM2016_Boolean_Cepek_Husek.pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Knowledge compilation from DNF to switch-list representations
Original language description
In this short note we will present a less common way how to represent a Boolean function, namely a representation by switch-list. There are two problems connected to such representation: (1) a knowledge compilation problem, i.e. a problem of transforming a given representation of a Boolean function (e.g. a DNF, CNF, BDD ...) into a switch-listl representation, and (2) a knowledge compression problem, i.e. a problem of finding the most compact switch-list representation among those which represent the same function. We will summarize known results about these two problems and present a new one about the compilation problem.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů