For a path with a two-value inequality relation, lifting creates one copy of the domain per variable. The lifted language is the bridge between structural restrictions and the algebraic study of hybrid crisp and valued CSPs. Research source
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.
Citation
BibTeX
@inproceedings{takhanov2017hybridvcsps,
title = {Hybrid VCSPs with crisp and conservative valued templates},
author = {Takhanov, Rustem},
year = {2017},
booktitle = {ISAAC 2017},
eprint = {1506.06540},
archivePrefix = {arXiv},
url = {https://arxiv.org/pdf/1506.06540}
}