Enumeration problems aim at outputting, without repetition, the set of solutions to a given problem instance. However, outputting the entire solution set may be prohibitively expensive if it is too big. In this case, outputting a small, sufficiently diverse subset of the solutions would be preferable. This leads to the Diverse-version of the original enumeration problem, where the goal is to achieve a certain level d of diversity by selecting k solutions. In this paper, we look at the Diverse-version of the query answering problem for Conjunctive Queries and extensions thereof. That is, we study the problem if it is possible to achieve a certain level d of diversity by selecting k answers to the given query and, in the positive case, to actually compute such k answers.

翻译：枚举问题的目标是在无重复的情况下输出给定问题实例的解集。然而，若解集规模过大，输出整个解集可能代价高昂。此时，更优的方案是输出一个规模较小但具有充分多样性的子集。由此衍生出原始枚举问题的“多样性版本”，其目标是从中选取k个解以达到特定多样性水平d。本文研究合取查询及其扩展的查询应答问题之多样性版本。具体而言，我们探讨以下问题：能否通过选取给定查询的k个答案来达到特定多样性水平d？若可行，则实际计算这k个答案。