%0 Conference Paper %1 Bodirsky2024 %A Bodirsky, Manuel %A Semanišinová, Žaneta %A Lutz, Carsten %B Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science %C New York, NY, USA %D 2024 %I Association for Computing Machinery %K imported %P 1–14 %R 10.1145/3661814.3662071 %T The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems %U https://doi.org/10.1145/3661814.3662071 %X 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. %@ 9798400706608

@inproceedings{Bodirsky2024, 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.}, added-at = {2024-12-10T13:00:43.000+0100}, address = {New York, NY, USA}, author = {Bodirsky, Manuel and Semanišinová, Žaneta and Lutz, Carsten}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/20eb6ef65c20928f57e76698dbc2633c8/scadsfct}, booktitle = {Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science}, day = 8, doi = {10.1145/3661814.3662071}, interhash = {2d6a045ae322d43af9579a51fbf4ddb7}, intrahash = {0eb6ef65c20928f57e76698dbc2633c8}, isbn = {9798400706608}, keywords = {imported}, location = {Tallinn, Estonia}, month = {7}, pages = {1–14}, publisher = {Association for Computing Machinery}, series = {LICS '24}, timestamp = {2024-12-10T13:00:43.000+0100}, title = {The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems}, url = {https://doi.org/10.1145/3661814.3662071}, year = 2024 }