1589 search results - page 179 / 318 » Constraints with Variables' Annotations |
149
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
123
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
The Quantified Constraint Satisfaction Problem (QCSP) has been introduced to express situations in which we are not able to control the value of some of the variables (the universa...
138
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
When numerical CSPs are used to solve systems of n equations with n variables, the preconditioned interval Newton operator plays two key roles: First it allows handling the n equat...
145
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogo...
127
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...