Quantified constraints: Algorithms and complexity
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...
Главные авторы: | Borner, F, Bulatov, A, Jeavons, P, Krokhin, A |
---|---|
Формат: | Journal article |
Язык: | English |
Опубликовано: |
2003
|
Схожие документы
-
Quantified constraints: algorithms and complexity
по: Börner, F, и др.
Опубликовано: (2003) -
The complexity of constraint satisfaction games and QCSP
по: Börner, F, и др.
Опубликовано: (2009) -
The complexity of maximal constraint languages
по: Bulatov, A, и др.
Опубликовано: (2001) -
The complexity of maximal constraint languages
по: Bulatov, A, и др.
Опубликовано: (2001) -
The Complexity of Constraint Satisfaction: An Algebraic Approach
по: Krokhin, A, и др.
Опубликовано: (2004)