Three meta-questions on infinite-domain Constraint Satisfaction Problems

2025-02-10

AI Summary

This paper addresses the Bodirsky–Pinsker conjecture—the central open problem concerning the complexity dichotomy for constraint satisfaction problems (CSPs) over infinite domains. Methodologically, it integrates model theory, universal algebra, Datalog computability, and orbit system analysis. Key results include: (1) establishing the conjecture’s equivalence to its restriction to templates with no algebraicity; (2) showing that higher-arity invariants reduce to essentially unary (i.e., essentially injective) forms; and (3) constructing a “sandwich” correspondence between solvability of infinite-domain CSPs and finite-domain promise CSPs (PCSPs). The main contributions are threefold: (i) structural and algebraic simplification of the conjecture’s scope; (ii) identification of essential injectivity as the canonical reduction paradigm; and (iii) a constructive translation of tractable infinite-domain CSP templates into Datalog-solvable finite-domain PCSP instances—thereby establishing the first computational bridge between these two classes.

Technology Category

• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Cognitive Modeling & Cognitive Systems: Conceptual Inference and Reasoning

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Web Mining and Content Analysis: Models for Web evolution
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems

Abstract

The Feder-Vardi dichotomy conjecture for Constraint Satisfaction Problems (CSPs) with finite templates, confirmed independently by Bulatov and Zhuk, has a counterpart for infinite templates due to Bodirsky and Pinsker which remains wide open. We resolve several meta-problems on the scope of their conjecture. Our first two main results provide two fundamental simplifications of this scope, one of structural, and the other one of algebraic nature. The former simplification implies that the conjecture is equivalent to its restriction to templates without algebraicity, a crucial assumption in the most powerful classification methods. The latter yields that the higher-arity invariants of any template within its scope can be assumed to be essentially injective, and hence any algebraic condition characterizing any complexity class within the conjecture must be satisfiable by injections, thus lifting the mystery of the better applicability of certain conditions over others. Our third main result uses the first one to show that any tractable template within the scope serves, up to a Datalog-computable modification of it, as the witness of the tractability of a finite-domain Promise Constraint Satisfaction Problem (PCSP) by the so-called sandwiching method. This provides a strong hitherto unknown connection between infinite-domain CSPs and finite-domain PCSPs.

Problem

• Resolves meta-problems in infinite-domain CSPs.
• Simplifies conjecture scope structurally and algebraically.
• Links infinite-domain CSPs to finite-domain PCSPs.

Innovation

• Simplifies infinite-domain CSP scope
• Assumes higher-arity invariants injective
• Connects infinite-domain CSP to PCSP