Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quasi Directed Jonsson Operations Imply Bounded Width (For fo-expansions of symmetric binary cores with free amalgamation) (2402.16540v1)

Published 26 Feb 2024 in cs.LO

Abstract: Every CSP(B) for a finite structure B is either in P or it is NP-complete but the proofs of the finite-domain CSP dichotomy by Andrei Bulatov and Dimitryi Zhuk not only show the computational complexity separation but also confirm the algebraic tractability conjecture stating that tractability origins from a certain system of operations preserving B. The establishment of the dichotomy was in fact preceded by a number of similar results for stronger conditions of this type, i.e. for system of operations covering not necessarily all tractable finite-domain CSPs. A similar, infinite-domain algebraic tractability conjecture is known for first-order reducts of countably infinite finitely bounded homogeneous structures and is currently wide open. In particular, with an exception of a quasi near-unanimity operation there are no known systems of operations implying tractability in this regime. This paper changes the state-of-the-art and provides a proof that a chain of quasi directed Jonsson operations imply tractability and bounded width for a large and natural class of infinite structures.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (30)
  1. Barto, L. Finitely related algebras in congruence distributive varieties have near unanimity terms. Canadian Journal of Mathematics 65, 1 (2013), 3–21.
  2. Barto, L. The collapse of the bounded width hierarchy. J. Log. Comput. 26, 3 (2016), 923–943.
  3. Congruence distributivity implies bounded width. SIAM J. Comput. 39, 4 (2009), 1531–1542.
  4. Constraint satisfaction problems solvable by local consistency methods. J. ACM 61, 1 (2014), 3:1–3:19.
  5. The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS ’16, New York, NY, USA, July 5-8, 2016 (2016), M. Grohe, E. Koskinen, and N. Shankar, Eds., ACM, pp. 615–622.
  6. Bodirsky, M. Complexity of Infinite-Domain Constraint Satisfaction. Lecture Notes in Logic. Cambridge University Press, 2021.
  7. Datalog and constraint satisfaction with infinite templates. J. Comput. Syst. Sci. 79, 1 (2013), 79–100.
  8. The complexity of temporal constraint satisfaction problems. J. ACM 57, 2 (2010), 9:1–9:41.
  9. Constraint satisfaction problems for reducts of homogeneous graphs. SIAM J. Comput. 48, 4 (2019), 1224–1264.
  10. A dichotomy for first-order reducts of unary structures. Log. Methods Comput. Sci. 14, 2 (2018).
  11. Constraint satisfaction with countable homogeneous templates. J. Log. Comput. 16, 3 (2006), 359–373.
  12. Schaefer’s theorem for graphs. J. ACM 62, 3 (2015), 19:1–19:52.
  13. Canonical Functions: a Proof via Topological Dynamics. Homogeneous Structures, A Workshop in Honour of Norbert Sauer’s 70th Birthday, Contributions to Discrete Mathematics 16, 2 (2021), 36–45.
  14. Bulatov, A. A. A dichotomy theorem for nonuniform csps. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017 (2017), C. Umans, Ed., IEEE Computer Society, pp. 319–330.
  15. Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34, 3 (2005), 720–742.
  16. Cherlin, G. Homogeneous Ordered Graphs, Metrically Homogeneous Graphs, and Beyond, vol. 2 of Lecture Notes in Logic. Cambridge University Press, 2022.
  17. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput. 28, 1 (1998), 57–104.
  18. On the complexity of H-coloring. Journal of Combinatorial Theory, Series B 48 (1990), 92–110.
  19. Tractability and learnability arising from algebras with few subpowers. SIAM J. Comput. 39, 7 (2010), 3023–3037.
  20. Absorption and directed Jónsson terms. Springer International Publishing, Cham, 2018, pp. 203–220.
  21. Countable ultrahomogeneous undirected graphs. TAMS 262, 1 (1980), 51–94.
  22. Smooth approximations and relational width collapses. In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference) (2021), N. Bansal, E. Merelli, and J. Worrell, Eds., vol. 198 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 138:1–138:20.
  23. Smooth approximations and csps over finitely bounded homogeneous structures. In LICS ’22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022 (2022), C. Baier and D. Fisman, Eds., ACM, pp. 36:1–36:13.
  24. An order out of nowhere: a new algorithm for infinite-domain csps. CoRR abs/2301.12977 (2023).
  25. Pinsker, M. Current challenges in infinite-domain constraint satisfaction: Dilemmas of the infinite sheep. CoRR abs/2203.17182 (2022).
  26. Schaefer, T. J. The complexity of satisfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA (1978), R. J. Lipton, W. A. Burkhard, W. J. Savitch, E. P. Friedman, and A. V. Aho, Eds., ACM, pp. 216–226.
  27. Siggers, M. H. A strong Mal’cev condition for varieties omitting the unary type. Algebra Universalis 64, 1 (2010), 15–20.
  28. Wrona, M. On the relational width of first-order expansions of finitely bounded homogeneous binary cores with bounded strict width. In LICS ’20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020 (2020), H. Hermanns, L. Zhang, N. Kobayashi, and D. Miller, Eds., ACM, pp. 958–971.
  29. Wrona, M. Relational width of first-order expansions of homogeneous graphs with bounded strict width. In 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France (2020), C. Paul and M. Bläser, Eds., vol. 154 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 39:1–39:16.
  30. Zhuk, D. A proof of the CSP dichotomy conjecture. J. ACM 67, 5 (2020), 30:1–30:78.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets