BoolTool: A Tool for Manipulation of Boolean Functions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F08%3A03145790" target="_blank" >RIV/68407700:21230/08:03145790 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
BoolTool: A Tool for Manipulation of Boolean Functions
Original language description
A new tool for manipulation of logic functions is presented in this paper. The source functions are described by an algebraic expression (or a set of expressions), in a VHDL-like style, by a truth table (PLA) or as a CNF form. In particular, any multilevel network of logic gates can be used as a source for the tool. The tool is capable of performing basic Boolean operations on the source functions, like negating the function, performing AND, OR, XOR operations, etc., between two or more functions. Then,the tool is able to mutually transform the CNF and DNF function representations, which also enables to solve a satisfiability (SAT) problem as a byproduct. Last, but not least, the tool performs a function collapsing, i.e., it transforms a multi-level Boolean network into its two-level description (truth table).
Czech name
BoolTool: A Tool for Manipulation of Boolean Functions
Czech description
A new tool for manipulation of logic functions is presented in this paper. The source functions are described by an algebraic expression (or a set of expressions), in a VHDL-like style, by a truth table (PLA) or as a CNF form. In particular, any multilevel network of logic gates can be used as a source for the tool. The tool is capable of performing basic Boolean operations on the source functions, like negating the function, performing AND, OR, XOR operations, etc., between two or more functions. Then,the tool is able to mutually transform the CNF and DNF function representations, which also enables to solve a satisfiability (SAT) problem as a byproduct. Last, but not least, the tool performs a function collapsing, i.e., it transforms a multi-level Boolean network into its two-level description (truth table).
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2008
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proc. of 8th International Workshop on Boolean Problems
ISBN
978-3-86012-346-1
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
Freiberg University of Mining and Technology, Institute of Computer Science
Place of publication
Freiberg
Event location
Freiberg
Event date
Sep 18, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—