Solution techniques for constraint satisfaction problems: Foundations

Artificial Intelligence Review

Volumn 15, Issue 4, 2000, Pages 243-267

  Miguel, I ^a   Shen, Q ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Consistency enforcing; Constraint graph; Constraint Satisfaction Problems; Pre processing; Tree search

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GRAPH THEORY; TREES (MATHEMATICS);

CONSTRAINT SATISFACTION PROBLEMS (CSP);

ARTIFICIAL INTELLIGENCE;

EID: 0034970955     PISSN: 02692821     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011039901653     Document Type: Review

References (64)

1. Toward a general theory of action and time
2. The hazards of fancy backtracking
3. Arc-consistency and arc-consistency again
4. Using inference to reduce arc consistency computation
5. Backtrack programming techniques
6. Fast planning through planning graph analysis
7. Constraint hierarchies and logic programming
8. Solving combinatorial search problems by intelligent backtracking
9. Path-consistency: When space misses time
10. An optimal k-consistency algorithm
11. A constraint-network approach to truth-maintenance
12. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
13. Constraint networks
14. Belief Maintenance in Dynamic Constraint Networks
15. Experimental evaluation of preprocessing techniques in constraint satisfaction problems
16. Network-based heuristics for constraint-satisfaction problems
17. Tree clustering for constraint networks
18. An efficient arc consistency algorithm for a class of CSP problems
19. A truth maintenance system
20. Efficient graph automorphism by vertex partitioning
21. Synthesizing constraint expressions
22. A sufficient condition for backtrack-free search
23. Dead-end driven learning
24. Dynamic backtracking
25. GSAT and dynamic backtracking
26. Comments on Mohr and Henderson's path consistency algorithm
27. Experimenting with new systematic and non-systematic search techniques
28. A comparison of ATMS and CSP techniques
29. Constraints for object recognition in aerial images - Handling of unobserved features
30. A theoretical evaluation of selected backtracking algorithms
31. Algorithms for constraint satisfaction problems: A survey
32. A general framework for reason maintenance
33. Relational consistency algorithms and their applications in finding subgraph and graph isomorphism
34. Consistency in networks of relations
35. On reading sketch maps
36. Constraint satisfaction problems
37. The complexity of some polynomial network-consistency algorithms for constraint-satisfaction problems
38. Constraint satisfaction problems: An overview
39. Extending qualitative modelling for simulation of time-delayed behaviour
40. Solution techniques for constraint satisfaction problems: Advanced approaches
41. Arc and path consistency revisited
42. Networks of constraints: Fundamental properties and applications to picture processing
43. Constraint satisfaction algorithms
44. A reactive scheduling agent
45. Hybrid algorithms for the constraint satisfaction problem
46. Propagating temporal constraints for scheduling
47. A generic model and hybrid algorithm for hoist scheduling problems
48. Scene labeling by relaxation operations
49. Stubbornness: A possible enhancement for backjumping and nogood recording
50. Lazy arc consistency
51. Structural descriptions and inexact matching
52. Fuzzy qualitative simulation
53. Forward reasoning and dependency-directed backtracking in a system for computer aided circuit analysis
54. The consistent labeling problem in temporal reasoning
55. An algorithm for subgraph isomorphism
56. Why AC - 3 is almost always better than AC - 4 for establishing arc consistency in CSPs
57. Understanding line drawings of scenes with shadows
58. A rearrangement strategy for determining propositional satisfiability