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个答案。