一句话：提出结合局部传播与解空间基的混合方法，证明半格块 Mal'tsev 代数上的 CSP 多项式时间可解。
论文关注约束满足问题（CSP）的求解算法。传统方法主要有两类：局部传播和生成解空间基，而近年研究集中于将二者结合的混合算法。本文提出一种新的混合化方法，用以处理此前长期难以求解的一类 CSP。作者定义了一类称为半格块 Mal'tsev 的代数量：代数 A 具有二元运算 f、三元运算 m 以及同余 σ，使得商代数 A/σ 在 f 下为半格，f 在 σ 的每个块上为投影，且每个块在 Mal'tsev 运算 m 下构成 Mal'tsev 代数。论文在该受限 CSP 类上应用新方法，并证明半格块 Mal'tsev 代数上的约束满足问题可在多项式时间内求解。
There are two well known types of algorithms for solving CSPs: local propagation and generating a basis of the solution space. For several years the focus of the CSP research has been on ‘hybrid’ algorithms that somehow combine the two approaches. In this paper we present a new method of such hybridization that allows us to solve certain CSPs that has been out of reach for a quite a while. We consider these method on a fairly restricted class of CSPs given by algebras we will call semilattice block Mal'tsev. An algebra A is called semilattice block Mal'tsev if it has a binary operation f, a ternary operation m, and a congruence σ such that the quotient A/σ with operation f is a semilattice, f is a projection on every block of σ, and every block of σ is a Mal'tsev algebra with Mal'tsev operation m. We show that the constraint satisfaction problem over a semilattice block Mal'tsev algebra is solvable in polynomial time.