Recognition of tractable DNFs representable by a constant number of intervals

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10371730" target="_blank" >RIV/00216208:11320/17:10371730 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.disopt.2016.11.002" target="_blank" >http://dx.doi.org/10.1016/j.disopt.2016.11.002</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disopt.2016.11.002" target="_blank" >10.1016/j.disopt.2016.11.002</a>

Result language
angličtina
Original language name
Recognition of tractable DNFs representable by a constant number of intervals
Original language description
In this paper we focus on a less common way how to represent Boolean functions, namely on representations by intervals of truepoints and by switch-lists. 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 (Boolean formula, binary decision diagram, Boolean circuit,...) into an interval or switch-list representation, and (2) a knowledge compression problem, i. e. a problem of finding the most compact interval or switch-list representation among those which represent the given function. We will summarize known results about these two problems and present generalizations in both areas. The main result is a polynomial time algorithm that for a Boolean function given by a tractable formula outputs a shortest interval and switch-list representations provided that the number of switches (intervals) is bounded by a constant. This algorithm can be also thought of as a polynomial time recognition algorithm for the class of k-switch (or k-interval) functions given by a tractable formula for any fixed k.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA15-15511S" target="_blank" >GA15-15511S: Boolean techniques in knowledge representation</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)