DeepAI AI Chat
Log In Sign Up

On amenability of constraint satisfaction problems

by   Michal R. Przybylek, et al.
University of Warsaw

Recent results show that a constraint satisfaction problem (CSP) defined over rational numbers with their natural ordering has a solution if and only if it has a definable solution. The proof uses advanced results from topology and modern model theory. The aim of this paper is threefold. (1) We give a simple purely-logical proof of the claim and show that the advanced results from topology and model theory are not needed; (2) we introduce an intrinsic characterisation of the statement "definable CSP has a solution iff it has a definable solution" and investigate it in general intuitionistic set theories (3) we show that the results from modern model theory are indeed needed, but for the implication reversed: we prove that "definable CSP has a solution iff it has a definable solution" holds over a countable structure if and only if the automorphism group of the structure is extremely amenable.


page 1

page 2

page 3

page 4


Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction

We consider the quantified constraint satisfaction problem (QCSP) which ...

Tractable Combinations of Theories via Sampling

For a first-order theory T, the Constraint Satisfaction Problem of T is ...

Formally Verified Transformation of Non-binary Constraints into Binary Constraints

It is well known in the Constraint Programming community that any non-bi...

Tractable Combinations of Temporal CSPs

The constraint satisfaction problem (CSP) of a first-order theory T is t...

Formalizing π_4(𝕊^3) ≅ℤ/2ℤ and Computing a Brunerie Number in Cubical Agda

Brunerie's 2016 PhD thesis contains the first synthetic proof in Homotop...

From Constraints to Resolution Rules, Part II: chains, braids, confluence and T&E

In this Part II, we apply the general theory developed in Part I to a de...

Quantaloidal approach to constraint satisfaction

The constraint satisfaction problem (CSP) is a computational problem tha...