Succinctness of Switch-List Representations of Boolean Functions

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10392023" target="_blank" >RIV/00216208:11320/18:10392023 - isvavai.cz</a>

Result on the web

<a href="http://www.ise.aoyama.ac.jp/~opt_out/cjseminar/proceedings/proceedings_online.pdf" target="_blank" >http://www.ise.aoyama.ac.jp/~opt_out/cjseminar/proceedings/proceedings_online.pdf</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Succinctness of Switch-List Representations of Boolean Functions

Original language description

In this paper we focus on a slightly unusual way how to represent Boolean functions, namely on representations by switch-lists. Given a truth table representation of a Boolean function f the switch-list representation of f is a list of Boolean vectors from the truth table which have a di DOWNWARDS ARROW WITH CORNER LEFTWARDS erent function value than the preceding Boolean vector in the truth table. The main aim of this paper is to compare switch-list representations with a number of standard representations (such as CNF, DNF, and OBDD) with respect to their relative succinctness, and hence to include switch-list representations in the Knowledge Compilation Map [7].

Czech name

—

Czech description

—

Type

O - Miscellaneous

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/7AMB17FR027" target="_blank" >7AMB17FR027: Knowledge compilation for constraint programming</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2018

Confidentiality

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