Constraint Satisfaction and Universal Algebra learning seminar

Tuesday, January 14, 2014 2:30 pm - 2:30 pm EST (GMT -05:00)

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.