关于易处理性与同余分配性
On tractability and congruence distributivity
摘要：
约束语言产生于有限代数最近的研究对象，特别是与二分法猜想的Feder和Vardi。一类重要的代数是那些生成同余分配簇的代数，这类代数包括格，更一般地说，是那些具有近同余项运算的代数。一个代数将生成一个同余分配簇，当且仅当它有一个三元项运算序列，称为Jonsson项，满足一定的方程。我们证明了约束语言组成的关系是不变的Jonsson项下的短序列是听话的，表明这种语言有界的关系宽度。
英文摘要：
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An important class of algebras are those that generate congruence distributive varieties and included among this class are lattices, and more generally, those algebras that have near-unanimity term operations. An algebra will generate a congruence distributive variety if and only if it has a sequence of ternary term operations, called Jonsson terms, that satisfy certain equations. We prove that constraint languages consisting of relations that are invariant under a short sequence of Jonsson terms are tractable by showing that such languages have bounded relational width.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
