For this purpose, we propose to use a set of transformation rules that allow us to find a set of formulae logically equivalent to the original formula; the aim is to make the set large enough that all the relevant expressive choices (as investigated in this paper) are represented.
we need the following rules that operate on dnfs (where A is an adjective; B 1 and B 2 are nouns; X and Y are combinations of adjectives and nouns).