Constraint Satisfaction and Universal Algebra learning seminar

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

Winnie Lam, Department of Pure Mathematics, University of Waterloo

“Weak Prague Instance”

In the seminar, we will show that any syntactically simple (2,3)- minimal instance is a weak Prague instance. The instance constructed from the previous talk is a syntactically simple (2,3)- minimal instance and thus is a weak Prague instance. The idea of the weak Prague instance is to define consistency when given an instance.