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)