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...
Main Authors: | Borner, F, Bulatov, A, Jeavons, P, Krokhin, A |
---|---|
格式: | Journal article |
语言: | English |
出版: |
2003
|
相似书籍
-
Quantified constraints: algorithms and complexity
由: Börner, F, et al.
出版: (2003) -
The complexity of constraint satisfaction games and QCSP
由: Börner, F, et al.
出版: (2009) -
The complexity of maximal constraint languages
由: Bulatov, A, et al.
出版: (2001) -
The complexity of maximal constraint languages
由: Bulatov, A, et al.
出版: (2001) -
The Complexity of Constraint Satisfaction: An Algebraic Approach
由: Krokhin, A, et al.
出版: (2004)