  The clones of Boolean functions are classified in regard to
set-reconstructibility via a strong dichotomy result: the clones containing
only affine functions, conjunctions, disjunctions or constant functions are
set-reconstructible, whereas the remaing clones are not weakly reconstructible.
