Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)

2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)(2019)

引用 18|浏览22
暂无评分
摘要
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template has a pseudo-Siggers polymorphism, and NP-complete otherwise. One of the important questions related to this conjecture is whether, similarly to the case of finite structures, the condition of having a pseudo-Siggers polymorphism can be replaced by the condition of having polymorphisms satisfying a fixed set of identities of height 1, i.e., identities which do not contain any nesting of functional symbols. We provide a negative answer to this question by constructing for each non-trivial set of height 1 identities a structure whose polymorphisms do not satisfy these identities, but whose CSP is tractable nevertheless. An equivalent formulation of the dichotomy conjecture characterizes tractability of the CSP via the local satisfaction of nontrivial height 1 identities by polymorphisms of the structure. We show that local satisfaction and global satisfaction of nontrivial height 1 identities differ for ω -categorical structures with less than double exponential orbit growth, thereby resolving one of the main open problems in the algebraic theory of such structures.
更多
查看译文
关键词
NP-complete problem,algebraic theory,infinite-domain constraint satisfaction problems,nontrivial set,fixed set,polymorphisms,finite structures,pseudoSiggers polymorphism,model-complete core,polynomial-time tractable,CSP,algebraic dichotomy conjecture,ω -categorical structures
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要