About this paper

Studies hybrid constraint satisfaction through crisp and conservative valued templates and the notion of wide tractability.

Lifted languages give a necessary condition for tractability of hybrid problems. This work investigates when that condition is also sufficient and relates the answer to finite relational structures and Siggers polymorphisms.