Locally Finite Constraint Satisfaction Problems

@article{Klin2015LocallyFC,
  title={Locally Finite Constraint Satisfaction Problems},
  author={Bartek Klin and Eryk Kopczynski and Joanna Ochremiak and Szymon Torunczyk},
  journal={2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science},
  year={2015},
  pages={475-486}
}
First-order definable structures with atoms are infinite, but exhibit enough symmetry to be effectively manipulated. We study Constraint Satisfaction Problems (CSPs) where both the instance and the template are definable structures with atoms. As an initial step, we consider locally finite templates, which contain potentially infinitely many finite relations. We argue that such templates occur naturally in Descriptive Complexity Theory. We study CSPs over such templates for both finite and… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS