Publikace na Matematicko-fyzikální fakulta |
2015
Abstrakt
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.