We consider querying containing several vague concepts of user's preferences (with preference scale [Tscr ] ), which is quite typical in semantic web. These particular preferences need to be combined to get an overall ordering of results. We propose [Tscr ]−[Escr ][Lscr ]^@ – a description logic allowing existential restrictions, crisp roles, [Tscr ] -fuzzy concepts and [Tscr ] -fuzzy combining functions @. We discuss problems of consistency, subsumption and the instance problem. We show some results on polynomial complexity of this problem. We conclude with a sketch of an embedding of [Tscr ]−[Escr ][Lscr ]^@ into a sort of classical [Escr ][Lscr ] logic with concrete domain.