Maximal infinite-valued constraint languages

被引:0
|
作者
Bodirsky, Manuel [1 ]
Chen, Hubie [1 ]
Kara, Jan [1 ]
von Oertzen, Timo [1 ]
机构
[1] Humboldt Univ, Dept Algorithms & Complex, D-1086 Berlin, Germany
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We systematically investigate the computational complexity of constraint satisfaction problems for constraint languages over an infinite domain. In particular, we study a generalization of the well-established notion of maximal constraint languages from finite to infinite domains. If the constraint language can be defined with an omega-categorical structure, then maximal constraint languages are in one-to-one correspondence to minimal oligomorphic clones. Based on this correspondence, we derive general tractability and hardness criteria for the corresponding constraint satisfaction problems.
引用
收藏
页码:546 / +
页数:3
相关论文
共 50 条