Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
43 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems (2309.15654v3)

Published 27 Sep 2023 in math.LO, cs.CC, and cs.DB

Abstract: Valued constraint satisfaction problems (VCSPs) constitute a large class of computational optimisation problems. It was shown recently that, over finite domains, every VCSP is in P or NP-complete, depending on the admitted cost functions. In this article, we study cost functions over countably infinite domains whose automorphisms form an oligomorphic permutation group. Our results include a hardness condition based on a generalisation of pp-constructability as known from classical CSPs and a polynomial-time tractability condition based on the concept of fractional polymorphisms. We then observe that the resilience problem for unions of conjunctive queries (UCQs) studied in database theory, under bag semantics, may be viewed as a special case of the VCSPs that we consider. We obtain a complexity dichotomy for the case of incidence-acyclic UCQs and exemplarily use our methods to determine the complexity of a query that had remained open in the literature. Further, we conjecture that our hardness and tractability conditions match for resilience problems for UCQs.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (47)
  1. Correlation clustering. Machine Learning, 56(1-3):89–113, 2004.
  2. L. Barto and M. Kozik. Absorbing subalgebras, cyclic terms and the constraint satisfaction problem. Logical Methods in Computer Science, 8/1(07):1–26, 2012.
  3. The wonderland of reflections. Israel Journal of Mathematics, 223(1):363–398, 2018.
  4. M. Bodirsky. Cores of countably categorical structures. Logical Methods in Computer Science (LMCS), 3(1):1–16, 2007.
  5. M. Bodirsky. Complexity of Infinite-Domain Constraint Satisfaction. Lecture Notes in Logic (52). Cambridge University Press, 2021.
  6. M. Bodirsky and J. Kára. The complexity of equality constraint languages. Theory of Computing Systems, 3(2):136–158, 2008. A conference version appeared in the proceedings of Computer Science Russia (CSR’06).
  7. Piecewise linear valued CSPs solvable by linear programming relaxation. ACM Transactions of Computational Logic, 23(1):1–35, 2022. Preprint arXiv:1912.09298.
  8. M. Bodirsky and A. Mottet. A dichotomy for first-order reducts of unary structures. Logical Methods in Computer Science, 14(2), 2018.
  9. M. Bodirsky and J. Nešetřil. Constraint satisfaction with countable homogeneous templates. In Proceedings of Computer Science Logic (CSL), pages 44–57, Vienna, 2003.
  10. Projective clone homomorphisms. Journal of Symbolic Logic, 86(1):148–161, 2021.
  11. A. A. Bulatov. A dichotomy theorem for nonuniform CSPs. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, pages 319–330, 2017.
  12. S. Butti. Symmetries in Constraint Satisfaction: Weisfeiler-Leman Invariance and Promise Problems. PhD thesis, Universitat Pompeu Fabra, Barcelona, 2022.
  13. View-based query processing and constraint satisfaction. In 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000, pages 361–371, 2000.
  14. S. Chaudhuri and M. Y. Vardi. Optimization of real conjunctive queries. In Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS ’93, pages 59–70, New York, NY, USA, 1993. Association for Computing Machinery.
  15. Universal graphs with forbidden subgraphs and algebraic closure. Advances in Applied Mathematics, 22:454–491, 1999.
  16. An algebraic theory of complexity for discrete optimization. SIAM J. Comput., 42(5):1915–1939, 2013.
  17. An algebraic characterisation of complexity for valued constraints. In Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings, pages 107–121, 2006.
  18. Parameterized Algorithms. Springer Publishing Company, Incorporated, 1st edition, 2015.
  19. J. Foniok. Homomorphisms and structural properties of relational systems. Doctoral Thesis, Charles University Prague, Faculty of Mathematics and Physics, 2007.
  20. A characterization of the complexity of resilience and responsibility for self-join-free conjunctive queries. CoRR, abs/1507.00674, 2015.
  21. The complexity of resilience and responsibility for self-join-free conjunctive queries. Proc. VLDB Endow., 9(3):180–191, 2015.
  22. New results for the complexity of resilience for binary conjunctive queries with self-joins. In Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2020, Portland, OR, USA, June 14-19, 2020, pages 271–284, 2020.
  23. P. Fulla and S. Živný. A Galois connection for weighted (relational) clones of infinite size. TOCT, 8(3):9:1–9:21, 2016.
  24. M. Garey and D. Johnson. A guide to NP-completeness. CSLI Press, Stanford, 1978.
  25. A new approach to the maximum-flow problem. J. Assoc. Comput. Mach., 35(4):921–940, 1988.
  26. W. Hodges. A shorter model theory. Cambridge University Press, Cambridge, 1997.
  27. J. Hubička and J. Nešetřil. Universal structures with forbidden homomorphisms. In Logic Without Borders - Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics, pages 241–264. De Gruyter, 2015. arXiv:0907.4079.
  28. J. Hubička and J. Nešetřil. Homomorphism and embedding universal structures for restricted classes. Multiple-Valued Logic and Soft Computing, 27(2-3):229–253, 2016. arXiv:0909.4939.
  29. Bag query containment and information theory. ACM Trans. Database Syst., 46(3), 2021.
  30. Solving hard cut problems via flow-augmentation. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pages 149–168, 2021.
  31. Directed flow-augmentation. In STOC ’22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pages 938–947, 2022.
  32. V. Kolmogorov. Testing the complexity of a valued CSP language. CoRR, abs/1803.02289, 2018.
  33. The complexity of general-valued CSPs. SIAM J. Comput., 46(3):1087–1110, 2017.
  34. The power of linear programming for general-valued CSPs. SIAM J. Comput., 44(1):1–36, 2015.
  35. M. Kozik and J. Ochremiak. Algebraic properties of valued constraint satisfaction problem. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I, pages 846–858, 2015.
  36. A. Krokhin and S. Zivny. The Complexity of Valued CSPs. In A. Krokhin and S. Zivny, editors, The Constraint Satisfaction Problem: Complexity and Approximability, volume 7 of Dagstuhl Follow-Ups, pages 233–266. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2017.
  37. A characterisation of first-order constraint satisfaction problems. Logical Methods in Computer Science, 3(4:6), 2007.
  38. N. Makhija and W. Gatterbauer. A Unified Approach for Resilience and Causal Responsibility with Integer Linear Programming (ILP) and LP Relaxations, 2022.
  39. The complexity of causality and responsibility for query answers and non-answers. Proc. VLDB Endow., 4(1):34–45, 2010.
  40. A. Mottet and M. Pinsker. Cores over Ramsey structures. Journal of Symbolic Logic, 86(1):352–361, 2021.
  41. J. Nešetřil and C. Tardif. Duality theorems for finite structures. Journal of Combinatorial Theory, Series B, 80:80–97, 2000.
  42. F. M. Schneider and C. Viola. An application of Farkas’ lemma to finite-valued constraint satisfaction problems over infinite domains. CoRR, abs/2208.04912, 2022.
  43. J. Thapper and S. Živný. The complexity of finite-valued CSPs. In Proceedings of the Symposium on Theory of Computing Conference (STOC), Palo Alto, CA, USA, June 1-4, 2013, pages 695–704, 2013.
  44. C. Viola. Valued Constraint Satisfaction Problems over Infinite Domains. PhD thesis, TU Dresden, 2020.
  45. C. Viola and S. Zivný. The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains. ACM Trans. Algorithms, 17(3):21:1–21:23, 2021.
  46. D. Zhuk. A proof of the CSP dichotomy conjecture. J. ACM, 67(5):30:1–30:78, 2020.
  47. D. N. Zhuk. A proof of CSP dichotomy conjecture. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, pages 331–342, 2017. https://arxiv.org/abs/1704.01914.
Citations (2)
View on Semantic Scholar

Summary

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

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