liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0002-5288-3330
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.
Algorithms Group, University of Sheffield, UK.
2021 (English)In: Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik , 2021, Vol. 210, p. 32:1-32:20Conference paper, Published paper (Refereed)
Abstract [en]

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. 

Place, publisher, year, edition, pages
Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik , 2021. Vol. 210, p. 32:1-32:20
Series
Leibniz International Proceedings in Informatics (LIPIcs), ISSN 1868-8969 ; 32
Keywords [en]
Constraint Satisfaction Problems, Parameterised Complexity, Backdoors
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-198452DOI: 10.4230/LIPIcs.CP.2021.32ISBN: 9783959772112 (print)OAI: oai:DiVA.org:liu-198452DiVA, id: diva2:1804540
Conference
International Conference on Principles and Practice of Constraint Programming, October 25-29, 2021
Available from: 2023-10-13 Created: 2023-10-13 Last updated: 2023-10-18Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

Jonsson, PeterLagerkvist, Victor

Search in DiVA

By author/editor
Jonsson, PeterLagerkvist, Victor
By organisation
Artificial Intelligence and Integrated Computer SystemsFaculty of Science & Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 14 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf