Andrei A. Bulatov
ABSTRACT
In our LICS 2004 paper we introduced an approach to the study of the local structure of finite algebras and relational structures that aims at applications in the Constraint Satisfaction Problem (CSP). This approach involves a graph associated with an algebra A or a relational structure A, whose vertices are the elements of A (or A), 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 significantly refine and advance this approach. In particular, we prove certain connectivity and rectangularity properties of relations over algebras related to components of the graph connected by semilattice and affine edges. We also prove a result similar to 2-decomposition of relations invariant under a majority operation, only here we do not impose any restrictions on the relation. These results allow us to 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). We also consider algebras with edges from a restricted set of types. In particular, it can be proved that type restrictions are preserved under the standard algebraic constructions. Finally, we prove that algebras without semilattice edges have few subalgebras of powers, that is, the CSP over such algebras is also polynomial time.
- K. Baker and A. Pixley. Polynomial interpolation and the Chinese Remainder theorem. Mathematische Zeitschrift, 143:165--174, 1975.Google Scholar
Cross Ref
- L. Barto. The dichotomy for conservative constraint satisfaction problems revisited. In LICS, pages 301--310, 2011. Google ScholarDigital Library
- L. Barto. The collapse of the bounded width hierarchy. J. of Logic and Computation, 2014.Google Scholar
- L. Barto. The constraint satisfaction problem and universal algebra. The Bulletin of Symbolic Logic, 21(3):319--337, 2015.Google ScholarCross Ref
- L. Barto. Finitely related algebras in congruence modular varieties have few subpowers. Available at http://www.karlin.mff.cuni.cz/~barto/Articles/ValerioteConjecture.pdf, 2016.Google Scholar
- L. Barto and M. Kozik. Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem. Logical Methods in Computer Science, 8(1), 2012.Google Scholar
- L. Barto and M. Kozik. Constraint satisfaction problems solvable by local consistency methods. J. ACM, 61(1):3:1--3:19, 2014. Google ScholarDigital Library
- L. Barto, M. Kozik, and R. Willard. Near unanimity constraints have bounded pathwidth duality. In LICS 2012, pages 125--134. Google ScholarDigital Library
- J. Berman, P. Idziak, P. Marković, R. McKenzie, M. Valeriote, and R. Willard. Varieties with few subalgebras of powers. Trans. Amer. Math. Soc., 362(3):1445--1473, 2010.Google ScholarCross Ref
- A. A. Bulatov. Three-element Mal'tsev algebras. Acta Sci. Math (Szeged), 71(3-4):469--500, 2002.Google Scholar
- A. A. Bulatov. A graph of a relational structure and constraint satisfaction problems. In LICS, pages 448--457, 2004. Google ScholarDigital Library
- A. A. Bulatov. A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM, 53(1):66--120, 2006. Google ScholarDigital Library
- A. A. Bulatov. Bounded relational width. Available at https://www.cs.sfu.ca/abulatov/papers/relwidth.pdf, 2009.Google Scholar
- A. A. Bulatov. On the CSP dichotomy conjecture. In CSR 2011, pages 331--344, 2011a. Google ScholarDigital Library
- A. A. Bulatov. Complexity of conservative constraint satisfaction problems. ACM Trans. Comput. Log., 12(4):24, 2011b. Google ScholarDigital Library
- A. A. Bulatov. Graphs of finite algebras, edges, and connectivity. CoRR, abs/1601.07403, 2016.Google Scholar
- A. A. Bulatov. Conservative constraint satisfaction re-revisited. Journal of Computer and System Sciences, 82(2):347--356, 2016b. Google ScholarDigital Library
- A. A. Bulatov and V. Dalmau. A simple algorithm for Mal'tsev constraints. SIAM J. Comput., 36(1):16--27, 2006. Google ScholarDigital Library
- A. A. Bulatov and P. Jeavons. An algebraic approach to multi-sorted constraints. In CP, pages 183--198, 2003.Google ScholarDigital Library
- A. A. Bulatov and M. Valeriote. Recent results on the algebraic approach to the CSP. In Complexity of Constraints - An Overview of Current Research Themes {Result of a Dagstuhl Seminar}., pages 68--92, 2008. Google ScholarDigital Library
- A. A. Bulatov, P. Jeavons, and A. A. Krokhin. Classifying the complexity of constraints using finite algebras. SIAM J. Comput., 34(3):720--742, 2005. Google ScholarDigital Library
- S. Burris and H. Sankappanavar. A course in universal algebra, vol. 78 of Graduate Texts in Mathematics. Springer-Verlag, N.Y.-Berlin, 1981.Google Scholar
- R. Dechter. Constraint processing. Morgan Kaufmann Publishers, 2003. Google ScholarDigital Library
- T. Feder and M. Vardi. Monotone monadic SNP and constraint satisfaction. In STOC 1993, pages 612--622. Google ScholarDigital Library
- T. Feder and M. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM Journal of Computing, 28:57--104, 1998. Google ScholarDigital Library
- P. Hell and Nešetřil. Graphs and homomorphisms, volume 28 of Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, 2004.Google Scholar
- P. Hell and J. Nešetřil. On the complexity of H-coloring. Journal of Combinatorial Theory, Ser.B, 48:92--110, 1990. Google ScholarDigital Library
- D. Hobby and R. McKenzie. The Structure of Finite Algebras, volume 76 of Contemporary Mathematics. American Mathematical Society, Providence, R.I., 1988.Google Scholar
- P. M. Idziak, P. Markovic, R. McKenzie, M. Valeriote, and R. Willard. Tractability and learnability arising from algebras with few subpowers. SIAM J. Comput., 39(7):3023--3037, 2010. Google ScholarDigital Library
- P. Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200:185--204, 1998. Google ScholarDigital Library
- P. Jeavons, D. A. Cohen, and M. Gyssens. Closure properties of constraints. J. ACM, 44(4):527--548, 1997. Google ScholarDigital Library
- P. Jeavons, D. Cohen, and M. Cooper. Constraints, consistency and closure. Artificial Intelligence, 101(1-2):251--265, 1998. Google ScholarDigital Library
- K. Kearnes. Idempotent simple algebras. In Logic and algebra (Pontignano, 1994), volume 180 of Lecture Notes in Pure and Appl. Math., pages 529--572. Dekker, New York, 1996.Google Scholar
- S. Khot. On the power of unique 2-prover 1-round games. In STOC 2002, pages 767--775. Google ScholarDigital Library
- P. Kolaitis. Constraint satisfaction, databases, and logic. In IJCAI'03, 2003. Google ScholarDigital Library
- P. Kolaitis and M. Vardi. A game-theoretic approach to constraint satisfaction. In AAAI 2000, pages 175--181. Google ScholarDigital Library
- B. Larose and L. Zádori. Bounded width problems and algebras. Algebra Universalis, 56(3-4):439--466, 2007.Google ScholarCross Ref
- D. Zhuk. On key relations preserved by a weak near-unanimity function. In ISMVL 2014, pages 61--66, 2014. Google ScholarDigital Library
- Graphs of relational structures: restricted types
Recommendations
Homomorphism-Homogeneous Relational Structures
We study relational structures (especially graphs and posets) which satisfy the analogue of homogeneity but for homomorphisms rather than isomorphisms. The picture is rather different. Our main results are partial characterizations of countable graphs ...
Lattice pseudoeffect algebras as double residuated structures
Special Issue on Evolutionary Fuzzy SystemsPseudoeffect algebras are partial algebraic structures which are non-commutative generalizations of effect algebras. The main result of the paper is a characterization of lattice pseudoeffect algebras in terms of so-called pseudo Sasaki algebras. In ...
Partial residuated structures and quantum structures
Residuated structures, bounded commutative residuated lattices in particular, play an important role in the study of algebraic structures of logics--classical and non-classical. In this paper, by introducing partial adjoint pairs, a new structure is ...
Comments