论文标题
通过概念和公式将正面和负面数据示例分开：签名受限的情况
Separating Positive and Negative Data Examples by Concepts and Formulas: The Case of Restricted Signatures
论文作者
论文摘要
我们研究了在本体学的存在下，根据描述逻辑（DL）概念（DL）概念（DL）概念（DL）概念和公式的分离。与以前的工作相反，我们添加了一个签名，该签名指定了可以用于分离的数据和本体中的符号子集。我们认为由此产生的问题的弱和强烈的版本在处理负面示例的方式上有所不同。我们的主要结果是，（一种投影形式的）弱版本在$ \ Mathcal {alci} $中是可决定的，而它在受保护的片段GF，受保护的否定片段GNF和DL $ \ Mathcal {alcfio} $中是不可决定的，而在$ \ nccal中，强大的可分离性是可以固定的。我们还提供（大部分）复杂性范围。
We study the separation of positive and negative data examples in terms of description logic (DL) concepts and formulas of decidable FO fragments, in the presence of an ontology. In contrast to previous work, we add a signature that specifies a subset of the symbols from the data and ontology that can be used for separation. We consider weak and strong versions of the resulting problem that differ in how the negative examples are treated. Our main results are that (a projective form of) the weak version is decidable in $\mathcal{ALCI}$ while it is undecidable in the guarded fragment GF, the guarded negation fragment GNF, and the DL $\mathcal{ALCFIO}$, and that strong separability is decidable in $\mathcal{ALCI}$, GF, and GNF. We also provide (mostly tight) complexity bounds.
