论文信息 - Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms

Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms

Several constraint satisfaction algorithms focus on numeric constraint satisfaction problems (CSPs). A numeric CSP is defined by a set of variables, their domains, intervals in \(\mathcal R\), and the set of constraints, expressed as mathematical relations, which must be satisfied for any solution. Such CSPs can model many engineering and design problems from domains such as mechanical, electrical and civil engineering.

Claudio Lottaz

[1] Pascal Van Hentenryck,et al. CLP(Intervals) Revisited , 1994, ILPS.

[2] Pascal Van Hentenryck,et al. Numerica: A Modeling Language for Global Optimization , 1997, IJCAI.

[3] Esther Gelle,et al. On the generation of locally consistent solution spaces in mixed dynamic constraint problems , 1998 .

[4] Jamila Sam. Constraint consistency techniques for continuous domains , 1995 .

[5] Peter van Beek,et al. On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems , 1998, AAAI/IAAI.

[6] Boi Faltings,et al. Local Consistency for Ternary Numeric Constraints , 1997, IJCAI.

[7] Ian F. C. Smith,et al. Constraint-Based Support for Collaboration in Design and Construction , 1999 .

[8] Rina Dechter,et al. Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems , 1989, IJCAI.

[9] Olivier Lhomme,et al. Consistency Techniques for Numeric CSPs , 1993, IJCAI.

[10] Rina Dechter,et al. On the Expressiveness of Networks with Hidden Variables , 1990, AAAI.