Maximal infinite-valued constraint languages

Authors:
Manuel Bodirsky;Hubie Chen;Jan Kára;Timo von Oertzen
Affiliations:
LIX, École Polytechnique, Greater Paris, France;Departament de Tecnologies de la Informació i les Comunicacions, Universitat Pompeu Fabra, Barcelona, Spain;Department of Applied Mathematics, Charles University, Prague, Czech Republic;Max-Planck-Institute for Human Development, Berlin, Germany
Venue:
Theoretical Computer Science
Year:
2009

Citing 16
Cited 2

The core of a graph

Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
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)
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
The Complexity of Equality Constraint Languages

Theory of Computing Systems
A complete classification of tractability in RCC-5

Journal of Artificial Intelligence Research
Datalog and constraint satisfaction with infinite templates

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

The complexity of temporal constraint satisfaction problems

Journal of the ACM (JACM)
Schaefer's theorem for graphs

Proceedings of the forty-third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	5.23

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