Knowledge compilation and compression using interval representations

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10317641" target="_blank" >RIV/00216208:11320/15:10317641 - isvavai.cz</a>
Result on the web
<a href="http://edu.uhk.cz/CJS2015/CJS_2015_Proceedings.pdf" target="_blank" >http://edu.uhk.cz/CJS2015/CJS_2015_Proceedings.pdf</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Knowledge compilation and compression using interval representations
Original language description
Abstract In this short note we will present a less common way how to represent a Boolean function, namely a representation by truepoint intervals. There are two problems connected to such representation: ( ) a knowledge compilation problem, i.e., a problem of transforming a given representation of a Boolean function (e.g., a DNF, CNF, BDD ...) into an interval representation, and ( ) a knowledge compression problem, i.e., a problem of finding the most compact interval representation among those which represent the same function. We will summarize known results about these two problems and present some new ones.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 18th Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty
ISBN
978-80-7435-579-0
ISSN
—
e-ISSN
—
Number of pages
9
Pages from-to
25-33
Publisher name
GAUDEAMUS
Place of publication
Hradec Králové
Event location
Broumov
Event date
Sep 19, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)