We study the enumeration of answers to ontology-mediated queries when the ontology is formulated in a description logic that supports functional roles and the query is a CQ. In particular, we show that enumeration is possible with linear preprocessing and constant delay when a certain extension of the CQ (pertaining to functional roles) is acyclic and free-connex acyclic. This holds both for complete answers and for partial answers. We provide matching lower bounds for the case where the query is self-join free.
翻译:我们研究对本体学调解查询的答案的列举,当本体学是在支持功能作用的描述逻辑中拟订的,而查询是CQ时。 特别是,我们表明,如果CQ(与功能作用有关的)的某些扩展是环绕和自由的,则可以通过线性预处理和不断拖延来罗列本体学调解查询的答案,这既是完整的答案,也是部分答案。我们为自学免费查询的情况提供了相应的较低范围。