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

相似书籍