A context for constraint satisfaction problem formulation selection

Constraints

Volumn 6, Issue 4, 2001, Pages 299-327

  Borrett, James E ^a   Tsang, Edward P K ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

Constraint satisfaction; Heuristics; Modelling; Problem formulation

Indexed keywords

COMPUTER SIMULATION; CONSTRAINT THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; REDUNDANCY;

CONSTRAINT SATISFACTION PROBLEMS (CSP);

PROBLEM SOLVING;

EID: 0035479115     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011432307724     Document Type: Article

References (36)

1. On representation of problems of reasoning about actions
2. Adaptive constraint satisfaction: The quickest first principle
3. CHIC lessons on CLP methodology
4. Removing redundancies in constraint networks
5. Network-based heuristics for constraint-satisfaction problems
6. Tree clustering for constraint networks
7. The constraint logic programming language CHIP
8. A sufficient condition for backtrack-free search
9. Interchangeability supports abstraction and reformulation for multidimensional constraint satisfaction
10. Generalisation and abstraction for constraint satisfaction
11. Modeling: The final frontier
12. Easy problems are sometimes hard, research note
13. Increasing tree search efficiency for constraint satisfaction problems
14. The hardest constraint problems: A double phase transition, research note
15. Toward a model of representation charges
16. Constraint logic programming for scheduling and planning
17. Consistency in networks of relations
18. Consistent-labelling problems and their algorithms
19. Consistent-labelling problems and their algorithms: Expected-complexities and theory-based heuristics
20. Solving the general consistent-labelling (or constraint satisfaction) problem: Two algorithm and their expected complexities
21. Representation selection for constraint satisfaction: A case study using n-queens
22. Applications of constraint programming
23. On the equivalent of constraint satisfaction problems
24. The CHIP system and its applications
25. Phase transition and the mushy region in constraint satisfaction problems
26. Where the exceptionally hard problems are, proceedings, workshop on studying and solving really hard problems
27. An attempt to map a range of constraint satisfaction algorithms and heuristics
28. Constraint satisfaction using constraint logic programming
29. Practical applications of constraint programming
30. Some applications of graph bandwidth to constraint satisfaction problems