Constraint Satisfaction Problems over Finite Structures

Barto, Libor; DeMeo, William; Mottet, Antoine

doi:10.1109/lics52264.2021.9470670

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Other2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is undecidable [43]. Note that here we simply encode the ring of the integers as a relational structure to fit our definition of a CSP; for research on templates with functions see [2].…”

Section: Introductionmentioning

confidence: 99%

Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep

Pinsker¹

2022

Preprint

View full text Add to dashboard Cite

A Constraint Satisfaction Problem (CSP) is a computational problem where we are given variables and constraints about them; the question is whether the variables can be assigned values such that all constraints are satisfied. We give an overview of the current state of research on CSPs where values for the variables and constraints are taken from a finitely bounded homogeneous structure which is fixed beforehand. We explain the main mathematical ideas so far, the three dilemmas they brought upon us, and what could be done to overcome them in order to obtain a satisfactory understanding of the computational complexity of such CSPs.

show abstract

Section: Introductionmentioning

confidence: 99%