In this Boolean example, the solutions of x₁ = x₂ are closed under coordinatewise AND. Such closure makes a solution set a subalgebra of a product—the structure investigated through the paper’s induced CSP construction. Research source
About this paper
Investigates how algebraic structure in a CSP solution space can be encoded as another fixed-template problem.
The paper studies representations of solution sets as subalgebras of products of specified algebras. It develops reductions and tractability results using a CSP with an input prototype. A recorded presentation is available below.