Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey

Abstract

Many computational problems arising in artificial intelligence, computer science and elsewhere can be represented as constraint satisfaction and optimization problems. In this short survey we discuss an approach that is related to the algebraic component of multiple-valued logic and that has proved to be very successful in studying the complexity of constraint satisfaction.