The Structure of Finite Algebras and the Constraint Satisfaction Problem (17rit685)

The Banff International Research Station will host the "The structure of finite algebras and the Constraint Satisfaction Problem" workshop in Banff from August 6, 2017 to August 13, 2017.

In a constraint satisfaction problem (CSP for short) the goal is
to decide whether or not there is a homomorphism between two given
relational structures. This framework turns out so versatile and
flexible that the CSP found applications in numerous areas from
artificial intelligence, to theoretical computer science,to graph
theory, to logic, to algebra. On the practical side CSP solvers
has been designed that allow for descriptive languages more
efficient and expressive than, say, Prolog. On the theoretical
side the main research directions have been concerned with
algorithms for solving CSPs and the complexity of various
restricted versions of the problem.

Our goal is to study the structure of finite algebras related to the CSP
by unifying the three existing approaches to this problem. We also hope
to use the new results to advance the study of the CSP and other
combinatory problems.

The Banff International Research Station for Mathematical Innovation and Discovery (BIRS) is a collaborative Canada-US-Mexico venture that provides an environment for creative interaction as well as the exchange of ideas, knowledge, and methods within the Mathematical Sciences, with related disciplines and with industry. The research station is located at The Banff Centre in Alberta and is supported by Canada's Natural Science and Engineering Research Council (NSERC), the U.S. National Science Foundation (NSF), Alberta's Advanced Education and Technology, and Mexico's Consejo Nacional de Ciencia y Tecnología (CONACYT).