Constraint Satisfaction and Universal Algebra learning seminar

Alexander Wires, Department of Pure Mathematics, University of Waterloo

Abstract

In showing that finite idempotent algebras generating a congruence meet-semidistributive variety have bounded width, our first step is to reduce the consideration of arbitrary constraint networks to those where the constraints are at most binary.