Computer Science > Logic in Computer Science
[Submitted on 21 Jun 2020 (v1), last revised 20 Jul 2020 (this version, v2)]
Title:Graphs of relational structures: restricted types
View PDFAbstract:The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the algebraic approach can be implemented, and apply it to some kinds of the CSP. This method was introduced in our LICS 2004 paper and involves the study of the local structure of finite algebras and relational structures. It associates with an algebra A or a relational structure S a graph, whose vertices are the elements of A (or S), the edges represent subsets of A such that the restriction of some term operation of A is `good' on the subset, that is, act as an operation of one of the 3 types: semilattice, majority, or affine. In this paper we use this theory and consider algebras with edges from a restricted set of types. We prove type restrictions are preserved under the standard algebraic constructions. Then we show that if the types edges in a relational structure are restricted, then the corresponding CSP can be solved in polynomial time by specific algorithms. In particular, we give a new, somewhat more intuitive proof of the Bounded Width Theorem: the CSP over algebra A has bounded width if and only if A does not contain affine edges. Actually, this result shows that bounded width implies width (2,3). Finally, we prove that algebras without semilattice edges have few subalgebras of powers, that is, the CSP over such algebras is also polynomial time. The methods and results obtained in this paper are important ingredients of the 2017 proof of the Dichotomy Conjecture by the author. The Dichotomy Conjecture was also proved independently by Zhuk.
Submission history
From: Andrei Bulatov [view email][v1] Sun, 21 Jun 2020 04:52:35 UTC (28 KB)
[v2] Mon, 20 Jul 2020 13:41:16 UTC (28 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
Connected Papers (What is Connected Papers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.