Volume 149, Number 1-3, August 2005
Jan C. Bioch
: The complexity of modular decomposition of Boolean functions.
, Petr Kucera
: Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing.
: On the size of maximum renamable Horn sub-CNF.
: The many benefits of putting stack filters into disjunctive or conjunctive normal form.
: Linear symmetries of Boolean functions.
Igor E. Zverovich
: Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes.