Sciweavers

24 search results - page 1 / 5
» Recognition of interval Boolean functions
Sort
View
AMAI
2008
Springer
13 years 5 months ago
Recognition of interval Boolean functions
Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. Their ...
Ondrej Cepek, David Kronus, Petr Kucera
ISMVL
2010
IEEE
186views Hardware» more  ISMVL 2010»
13 years 9 months ago
A Classification of Partial Boolean Clones
We study intervals I(A) of partial clones whose total functions constitute a (total) clone A. In the Boolean case, we provide a complete classification of such intervals (accordin...
Dietlinde Lau, Karsten Schölzel
SAS
2010
Springer
159views Formal Methods» more  SAS 2010»
13 years 3 months ago
Automatic Abstraction for Intervals Using Boolean Formulae
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
Jörg Brauer, Andy King
ASPDAC
2007
ACM
80views Hardware» more  ASPDAC 2007»
13 years 9 months ago
Recognition of Fanout-free Functions
Factoring is a logic minimization technique to represent a Boolean function in an equivalent function with minimum literals. When realizing the circuit, a function represented in ...
Tsung-Lin Lee, Chun-Yao Wang
IPL
2002
90views more  IPL 2002»
13 years 4 months ago
Recognition and dualization of disguised bidual Horn functions
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual fd . While this problem is not solvable in quasi-polynomial total time i...
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino