极大克隆中极大C-克隆的唯一包含
Unique inclusions of maximal C-clones in maximal clones
摘要:
$\mathit{C}$ -克隆是所谓的子句关系的多态性集合,子句关系是有限域上的一种特殊类型的关系,它首先出现在[Creamou et al. 2008]中与约束满足问题有关。我们完全描述了w.r.t.设置最大$\mathit{C}$ -克隆和最大克隆之间的包含。作为一个主要结果,我们得到的每一个最大的$\mathit{C}$ -克隆存在正好一个最大的克隆中,它是包含。这个唯一的最大克隆的精确描述,以及相应的$\mathit{C}$ -克隆的完整性标准。
英文摘要:
$\mathit{C}$-clones are polymorphism sets of so-called clausal relations, a special type of relations on a finite domain, which first appeared in connection with constraint satisfaction problems in [Creignou et al. 2008]. We completely describe the relationship w.r.t. set inclusion between maximal $\mathit{C}$-clones and maximal clones. As a main result we obtain that for every maximal $\mathit{C}$-clone there exists exactly one maximal clone in which it is contained. A precise description of this unique maximal clone, as well as a corresponding completeness criterion for $\mathit{C}$-clones is given.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。