A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
The question of tractable classes of constraint satisfaction problems (CSPs) has been studied for a long time, and is now a very active research domain. However, studies of tractable classes are typically very theoretical. They usually introduce classes of instances together with polynomial time algorithms for recognizing and solving them, and the algorithms can be used only for the new class. In this paper, we address the issue of tractable classes of CSPs from a different perspective. Wedblp:conf/isaim/MouelhiJTZ12 fatcat:fjqr6zezvvcnnk2qtsg7s3eede