Document Open Access Logo

Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors

Authors Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak

PDF
Thumbnail PDF

File

LIPIcs.CP.2021.32.pdf
  • Filesize: 0.74 MB
  • 20 pages

Document Identifiers

Author Details

Peter Jonsson
  • Department of Computer and Information Science, Linköping University, Sweden
Victor Lagerkvist
  • Department of Computer and Information Science, Linköping University, Sweden
Sebastian Ordyniak
  • Algorithms Group, University of Sheffield, UK

Funding

  • Jonsson, Peter: Partially supported by the Swedish Research Council (VR) under grant 2017-04112.
  • Lagerkvist, Victor: Partially supported by the Swedish Research Council (VR) under grant 2019-03690.
  • Ordyniak, Sebastian: Partially supported by the Engineering and Physical Sciences Research Council under grant EP/V00252X/1.

Acknowledgements

We thank the anonymous reviewers for several useful comments.

Cite AsGet BibTex

Peter Jonsson, Victor Lagerkvist, and Sebastian Ordyniak. Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 32:1-32:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.CP.2021.32

Abstract

A backdoor in a finite-domain CSP instance is a set of variables where each possible instantiation moves the instance into a polynomial-time solvable class. Backdoors have found many applications in artificial intelligence and elsewhere, and the algorithmic problem of finding such backdoors has consequently been intensively studied. Sioutis and Janhunen (KI, 2019) have proposed a generalised backdoor concept suitable for infinite-domain CSP instances over binary constraints. We generalise their concept into a large class of CSPs that allow for higher-arity constraints. We show that this kind of infinite-domain backdoors have many of the positive computational properties that finite-domain backdoors have: the associated computational problems are fixed-parameter tractable whenever the underlying constraint language is finite. On the other hand, we show that infinite languages make the problems considerably harder.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Discrete mathematics
  • Theory of computation → Complexity theory and logic
Keywords
  • Constraint Satisfaction Problems
  • Parameterised Complexity
  • Backdoors

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. M. Bodirsky. Complexity of Infinite-Domain Constraint Satisfaction. Cambridge University Press, 2021. Preprint available from URL: https://www.math.tu-dresden.de/~bodirsky/Book.pdf.
  2. M. Bodirsky and P. Jonsson. A model-theoretic view on qualitative constraint reasoning. Journal of Artificial Intelligence Research, 58:339-385, 2017. URL: https://doi.org/10.1613/jair.5260.
  3. M. Bodirsky and J. Kára. The complexity of temporal constraint satisfaction problems. Journal of the ACM, 57(2):9:1-9:41, 2010. Google Scholar
  4. Manuel Bodirsky and Stefan Wölfl. RCC8 is polynomial on networks of bounded treewidth. In Proc. of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-2011), pages 756-761, 2011. Google Scholar
  5. A. Bulatov. A dichotomy theorem for nonuniform CSPs. In Proc. 58th Annual Symposium on Foundations of Computer Science (FOCS-2017), pages 319-330, 2017. Google Scholar
  6. C. Carbonnel, M. C. Cooper, and E. Hebrard. On backdoors to tractable constraint languages. In Barry O'Sullivan, editor, Principles and Practice of Constraint Programming, pages 224-239, Cham, 2014. Springer International Publishing. Google Scholar
  7. R. Downey and M. Fellows. Parameterized complexity. Monographs in Computer Science. Springer, 1999. URL: http://books.google.se/books?id=pt5QAAAAMAAJ.
  8. W. Dvorák, S. Ordyniak, and S. Szeider. Augmenting tractable fragments of abstract argumentation. Artificial Intelligence, 186:157-173, 2012. Google Scholar
  9. F. Dylla, J. Lee, T. Mossakowski, T. Schneider, A. Van Delden, J. Van De Ven, and D. Wolter. A survey of qualitative spatial and temporal calculi: Algebraic and computational properties. ACM Computing Surveys, 50(1):7:1-7:39, 2017. Google Scholar
  10. J. Fichte and S. Szeider. Backdoors to tractable answer set programming. Artificial Intelligence, 220:64-103, 2015. Google Scholar
  11. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006. Google Scholar
  12. Robert Ganian, M. S. Ramanujan, and Stefan Szeider. Discovering archipelagos of tractability for constraint satisfaction and counting. ACM Trans. Algorithms, 13(2):29:1-29:32, 2017. Google Scholar
  13. S. Gaspers, N. Misra, S. Ordyniak, S. Szeider, and S. Živný. Backdoors into heterogeneous classes of SAT and CSP. Journal of Computer and System Sciences, 85:38-56, 2017. URL: https://doi.org/10.1016/j.jcss.2016.10.007.
  14. S. Gaspers, S. Ordyniak, and S. Szeider. Backdoor sets for CSP. In The Constraint Satisfaction Problem: Complexity and Approximability, volume 7 of Dagstuhl Follow-Ups, pages 137-157. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017. Google Scholar
  15. S. Gaspers and S. Szeider. Backdoors to satisfaction. In The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, pages 287-317. Springer, 2012. Google Scholar
  16. Robin Hirsch. Relation algebras of intervals. Artificial intelligence, 83(2):267-295, 1996. Google Scholar
  17. Wilfrid Hodges. Model theory. Cambridge University Press, 1993. Google Scholar
  18. Jinbo Huang. Compactness and its implications for qualitative spatial and temporal reasoning. In Proc. 13th International Conference on Principles of Knowledge Representation and Reasoning (KR-2012), 2012. Google Scholar
  19. P. Jonsson and V. Lagerkvist. An initial study of time complexity in infinite-domain constraint satisfaction. Artificial Intelligence, 245:115-133, 2017. URL: https://doi.org/10.1016/j.artint.2017.01.005.
  20. P. Jonsson and V. Lagerkvist. Why are CSPs based on partition schemes computationally hard? In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS-2018), pages 43:1-43:15, 2018. Google Scholar
  21. Peter Jonsson. Constants and finite unary relations in qualitative constraint reasoning. Artificial Intelligence, 257:1-23, 2018. Google Scholar
  22. D. Kavvadias and M. Sideri. The inverse satisfiability problem. SIAM Journal on Computing, 28:152-163, 1998. Google Scholar
  23. P. Kilby, J. Slaney, S. Thiébaux, and T. Walsh. Backbones and backdoors in satisfiability. In Proc. 20th National Conference on Artificial Intelligence (AAAI-2005), page 1368–1373, 2005. Google Scholar
  24. M. Kronegger, S. Ordyniak, and A. Pfandler. Backdoors to planning. Artificial Intelligence, 269:49-75, 2019. Google Scholar
  25. V. Lagerkvist and B. Roy. Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem. Journal of Computer and System Sciences, 117:23-39, 2021. Google Scholar
  26. A. Meier, S. Ordyniak, M. Ramanujan, and I. Schindler. Backdoors for linear temporal logic. Algorithmica, 81(2):476-496, 2019. Google Scholar
  27. Sebastian Ordyniak, André Schidler, and Stefan Szeider. Backdoor DNFs. In Proc. 28th of the International Joint Conference on Artificial Intelligence (IJCAI-2021), 2021. To appear. Report version available from https://www.ac.tuwien.ac.at/files/tr/ac-tr-21-001.pdf. Google Scholar
  28. A. Pfandler, S. Rümmele, and S. Szeider. Backdoors to abduction. In Proc. 23rd International Joint Conference on Artificial Intelligence (IJCAI-2013), pages 1046-1052, 2013. Google Scholar
  29. M. Samer and S. Szeider. Backdoor sets of quantified boolean formulas. Journal of Automated Reasoning, 42(1):77-97, 2009. Google Scholar
  30. M. Samer and S. Szeider. Fixed-parameter tractability. In Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, pages 425-454. IOS Press, 2009. Google Scholar
  31. Marko Samer and Stefan Szeider. Backdoor trees. In Proc. 23rd AAAI Conference on Artificial Intelligence (AAAI-2008), pages 363-368, 2008. Google Scholar
  32. M. Sioutis and T. Janhunen. Towards leveraging backdoors in qualitative constraint networks. In Proc. 42nd German Conference on AI (KI-2019), pages 308-315, 2019. Google Scholar
  33. R. Williams, C. Gomes, and B. Selman. Backdoors to typical case complexity. In Proc. 18th International Joint Conference on Artificial Intelligence (IJCAI-2003), pages 1173-1178, 2003. Google Scholar
  34. D. Zhuk. A proof of the CSP dichotomy conjecture. Journal of the ACM, 67(5):30:1-30:78, 2020. URL: https://doi.org/10.1145/3402029.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact