In this paper we propose a new approach for computing characterizations of sets of data by means of partially defined Boolean functions. The main objective is to provide minimal sets of characters that allows the user to discriminate groups of Boolean data representing individuals described by means of presence or absence of characters. Compared to previous approaches, our algorithms are more efficient and are able to compute complete sets of solutions, which may be useful according to our underlying application domain in plant biology.