277 search results - page 7 / 56 » Conditional Lexicographic Orders in Constraint Satisfaction ... |
CSCLP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
110
click to vote
IJCAI
1993
15 years 1 months ago
1993
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
CP
2005
Springer
15 years 5 months ago
2005
Springer
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
105
click to vote
JCSS
2008
14 years 12 months ago
2008
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
CIE
2008
Springer
14 years 12 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...