Maximal infinite-valued constraint languages

Authors:
Manuel Bodirsky;Hubie Chen;Jan Kára;Timo von Oertzen
Affiliations:
Department of Algorithms and Complexity, Humboldt University, Berlin;Department of Applied Mathematics, Charles University, Prague;Departament de Tecnologies de la Informació i les Comunicacions;Max-Planck-Institute for Human Development, Berlin
Venue:
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Year:
2007

Citing 16
Cited 1

Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra

Journal of the ACM (JACM)
A shorter model theory

A shorter model theory
Closure properties of constraints

Journal of the ACM (JACM)
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
On the complexity of qualitative spatial reasoning: a maximal tractable fragment of the region connection calculus

Artificial Intelligence
Maintaining knowledge about temporal intervals

Communications of the ACM
The complexity of maximal constraint languages

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra

Journal of the ACM (JACM)
Point algebras for temporal reasoning: algorithms and complexity

Artificial Intelligence
A Graph of a Relational Structure and Constraint Satisfaction Problems

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Relation Algebras and their Application in Temporal and Spatial Reasoning

Artificial Intelligence Review
Classifying the Complexity of Constraints Using Finite Algebras

SIAM Journal on Computing
Constraint Satisfaction with Countable Homogeneous Templates

Journal of Logic and Computation
A complete classification of tractability in RCC-5

Journal of Artificial Intelligence Research
The complexity of equality constraint languages

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Datalog and constraint satisfaction with infinite templates

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Constraint Satisfaction Problems with Infinite Templates

Complexity of Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 wellestablished notion of maximal constraint languages from finite to infinite domains. If the constraint language can be defined with an ω-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.