A well-known NP-complete problem Conjunctive Boolean Query is considered as the one of the logicobjective recognition problems. Both these problems have the same formulation but their implementations are rather different. It is offered to adapt the technique which involves a decreasing of computational complexity for a logicobjective recognition problem by means of construction of a level class description to the solution of Conjunctive Boolean Query.