Sciweavers

17 search results - page 2 / 4
» Length-Lex Ordering for Set CSPs
Sort
View
CSCLP
2003
Springer
13 years 11 months ago
Clustering for Disconnected Solution Sets of Numerical CSPs
This paper considers the issue of postprocessing the output of interval-based solvers for further exploitations when solving numerical CSPs with continuum of solutions. Most interv...
Xuan-Ha Vu, Djamila Sam-Haroud, Boi Faltings

Book
357views
15 years 4 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang
ECAI
2004
Springer
13 years 10 months ago
Encoding Quantified CSPs as Quantified Boolean Formulae
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
COCOS
2003
Springer
139views Optimization» more  COCOS 2003»
13 years 11 months ago
Inter-block Backtracking: Exploiting the Structure in Continuous CSPs
This paper details a technique, called inter-block backtracking (IBB), which improves interval solving of decomposed systems with non-linear equations over the reals. This techniqu...
Bertrand Neveu, Christophe Jermann, Gilles Trombet...
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 6 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson