Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems t

Introduces the universal-algebraic approach to classifying the computational complexity of constraint satisfaction problems.

Presents a novel form of a compendium that classifies an infinite number of problems by using a rule-based approach.

Computational complexity, originated from the interactions between computer science and numerical optimization, is one of the major theories that have revolutio