Abstract: The current research progress and shortages of the conjunctive query answering to description logic are analyzed. Based on the description logic DL-Lite and fuzzy set theory, a new fuzzy description logic f-DLR-Lite∩ is presented to represent and process n-ary relation and allow the concept conjunction to occur in the left-hand of inclusion axioms, with its forms of syntax, semantics and knowledge base all given. A new fuzzy query language to which the query threshold is compatible with user-defined weight is presented, and its conjunctive query procedure and algorithm are given over the f-DLR-Lite∩ knowledge base. Then, the complexity of the algorithm is analyzed with the FOL (first-order logic) reducibility of the procedure discussed. The f-DLR-Lite∩ can make up for the insufficiency of knowledge representation and reasoning by classic DLs, and the extended query language can express users' intentions more precisely and reasonably.