Quantified constraints: Algorithms and complexity

Quantified constraints: Algorithms and complexity

Taispeáin leaganacha eile (1)

The standard constraint satisfaction problem over an arbitrary finite domain can be expressed as follows: given a first-order sentence consisting of a conjunction of predicates, where all of the variables are existentially quantified, determine whether the sentence is true. This problem can be param...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Borner, F, Bulatov, A, Jeavons, P, Krokhin, A
Formáid:	Journal article
Teanga:	English
Foilsithe / Cruthaithe:	2003

Míreanna comhchosúla

Quantified constraints: algorithms and complexity
de réir: Börner, F, et al.
Foilsithe / Cruthaithe: (2003)

The complexity of constraint satisfaction games and QCSP
de réir: Börner, F, et al.
Foilsithe / Cruthaithe: (2009)

The complexity of maximal constraint languages
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2001)

The complexity of maximal constraint languages
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2001)

The Complexity of Constraint Satisfaction: An Algebraic Approach
de réir: Krokhin, A, et al.
Foilsithe / Cruthaithe: (2004)

Classifying the complexity of constraints using finite algebras
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2005)

Classifying the complexity of constraints using finite algebras
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2005)

Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey
de réir: Krokhin, A, et al.
Foilsithe / Cruthaithe: (2003)

Functions of multiple−valued logic and the complexity of constraint satisfaction: A short survey
de réir: Krokhin, A, et al.
Foilsithe / Cruthaithe: (2003)

The complexity of constraint satisfaction games and QCSP
de réir: Boerner, F, et al.
Foilsithe / Cruthaithe: (2009)

Constraint satisfaction problems and finite algebras
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2000)

Constraint satisfaction problems and finite algebras
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2000)

Soft constraints: Complexity and multimorphisms
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2003)

Soft constraints: complexity and multimorphsims
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2003)

The complexity of soft constraint satisfaction
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2006)

The complexity of soft constraint satisfaction
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2006)

Constraint satisfaction problems on intervals and lengths
de réir: Krokhin, A, et al.
Foilsithe / Cruthaithe: (2004)

Constraint satisfaction problems on intervals and lengths
de réir: Krokhin, A, et al.
Foilsithe / Cruthaithe: (2004)

Structural Theory of Automata‚ Semigroups‚ and Universal Algebra
de réir: Krokhin, A, et al.
Foilsithe / Cruthaithe: (2003)

An algebraic approach to multi-sorted constraints
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2003)

An algebraic approach to multi−sorted constraints
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2003)

Tractable constraints closed under a binary operation
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2000)

A maximal tractable class of soft constraints
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2004)

A maximal tractable class of soft constraints
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2004)

Finite semigroups imposing tractable constraints
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2002)

The constraint satisfaction problem: complexity and approximability
de réir: Krokhin, A, et al.
Foilsithe / Cruthaithe: (2017)

Binarisation for valued constraint satisfaction problems
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2017)

The complexity of constraint languages
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2006)

The Complexity of Valued Constraint Models.
de réir: Zivny, S, et al.
Foilsithe / Cruthaithe: (2009)

The complexity of valued constraint models
de réir: Živný, S, et al.
Foilsithe / Cruthaithe: (2009)

The complexity of valued constraint models
de réir: Živný, S, et al.
Foilsithe / Cruthaithe: (2009)

A complete classification of complexity in Allen's algebra in the presence of a non−trivial basic relation
de réir: Krokhin, A, et al.
Foilsithe / Cruthaithe: (2001)

Supermodular Functions and the Complexity of MAX CSP
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2004)

Supermodular functions and the complexity of MAX CSP
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2005)

Supermodular functions and the complexity of M-AX CSP
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2005)

Chapter 8 The complexity of constraint languages
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2006)

The complexity of global cardinality constraints
de réir: Andrei A. Bulatov, et al.
Foilsithe / Cruthaithe: (2010-10-01)

An algebraic characterisation of complexity for valued constraints
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2006)

An algebraic characterisation of complexity for valued constraints
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2006)

Supermodularity on chains and complexity of maximum constraint satisfaction
de réir: Vladimir Deineko, et al.
Foilsithe / Cruthaithe: (2005-01-01)