标题： 保守Maltsev约束满足问题 显示英文标题

标题： Conservative Maltsev Constraint Satisfaction Problems

摘要： 我们证明了对于每个具有保守Maltsev多项式运算的有限结构B，B的约束满足问题可以通过一个对称线性Z2-Datalog程序求解，并且特别地属于复杂性类parity-L。 该证明分为两个步骤：首先我们针对多态代数是遗传次直不可约的一个特定子类给出了结果。 然后我们证明了我们类中的每个其他结构都可以从这个子类中的某个结构通过原始正向构造得到。 第二步需要不同的技术，将在后续的文章中介绍。 显示英文摘要

摘要： We show that for every finite structure B with a conservative Maltsev polymorphism, the constraint satisfaction problem for B can be solved by a symmetric linear Z2-Datalog program, and in particular is in the complexity class parity-L. The proof has two steps: we first present the result for a certain subclass whose polymorphism algebras are hereditarily subdirectly irreducible. We then show that every other structure in our class can be primitively positively constructed from one of the structures in the subclass. The second step requires different techniques and will be presented in a companion article.