Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction

Research output: Contribution to book/Conference proceedings/Anthology/ReportConference contributionContributedpeer-review

Abstract

Many natural decision problems can be formulated as constraint satisfaction problems for reducts of finitely bounded homogeneous structures. This class of problems is a large generalisation of the class of CSPs over finite domains. Our first result is a general polynomial-time reduction from such infinite-domain CSPs to finite-domain CSPs. We use this reduction to obtain new powerful polynomial-time tractability conditions that can be expressed in terms of topological polymorphism clones. Moreover, we study the subclass C of CSPs for structures that are first-order definable over equality with parameters. Also this class C properly extends the class of all finite-domain CSPs. We show that the tractability conjecture for reducts of finitely bounded homogeneous structures is for C equivalent to the finite-domain tractability conjecture.

Details

Original languageEnglish
Title of host publicationProceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, LICS 2016
PublisherIEEE, New York [u. a.]
Pages623-632
Number of pages10
ISBN (electronic)9781450343916
Publication statusPublished - 5 Jul 2016
Peer-reviewedYes

Conference

Title31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2016
Duration5 - 8 July 2016
CityNew York
CountryUnited States of America

External IDs

ORCID /0000-0001-8228-3611/work/142241101

Keywords

ASJC Scopus subject areas

Keywords

  • abstract tractability conditions, canonical functions, constraint satisfaction problems