The algorithm prevents circularity (e.g., 'the cup on the table that supports a cup that...') and avoids the inclusion of redundant properties with the aid of consistency networks.
the algorithm favours the generation of minimally distinguishing relational descriptions as example (a) in the previous section.