Given a formula in propositional logic F in some presentation (BDD, ROBDD, truth table), our aim is to find a threshold function T that is a logical consequence of F and that is as strong as possible according to certain criteria. In general this problem is essentially open, but here our objective is to identify particular cases where efficient exact or approximation algorithms exist and carry out a careful experimental assessment.