The complexity of the consistency problem for several important classes of
Boolean functions is analyzed. The classes of functions under investigation
are those which are closed under function composition or superposition. Se
veral of these so-called Post classes are considered within the context of
machine learning with an application to breast cancer diagnosis. The consid
ered Post classes furnish a user-selectable measure of reliability. It is s
hown that for realistic situations which may arise in practice, the consist
ency problem for these classes of functions is polynomial-time solvable.