Knowledge compilation from DNF to switch-list representations

Kód výsledku v 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>

Výsledek na webu

<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

—

Jazyk výsledku

angličtina

Název v původním jazyce

Knowledge compilation from DNF to switch-list representations

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Knowledge compilation from DNF to switch-list representations

Popis výsledku anglicky

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.

Druh

O - Ostatní výsledky

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2016

Kód důvěrnosti údajů

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