Hard, flexible and dynamic constraint satisfaction

Knowledge Engineering Review

Volumn 14, Issue 3, 1999, Pages 199-220

  Miguel, Ian ^a   Shen, Qiang ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; PROBABILITY; PROBLEM SOLVING; SCHEDULING;

CONSTRAINT SATISFACTION PROBLEM (CSP); DYNAMIC FLEXIBLE CONSTRAINT;

CONSTRAINT THEORY;

EID: 0004844632     PISSN: 02698889     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269888999003070     Document Type: Article

References (65)

1. Baker, AB, 1994, "The hazards of fancy backtracking" Proceedings of the Twelfth National Conference on Artificial Intelligence pp 288-293.
2. Beale, S, 1997, "Using branch-and-bound with constraint satisfaction in optimization problems" Proc. of AAAI-97 pp 209-214.
3. Bertele, U and Brioschi, F, 1972, Nonserial Dynamic Programming Academic Press.
4. Bessiere, C, 1994, "Arc-consistency and arc-consistency again" Artificial Intelligence 65 179-190.
5. Bessiere, C, Freuder, EC and Regin, J, 1995, "Using inference to reduce arc consistency computation" Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence pp 592-598.
6. Bitner, R and Reingold, M, 1975, "Backtrack programming techniques" Communications of the ACM 18(11).
7. Borning, A, Maher, M, Martindale, A and Wilson, M, 1989, "Constraint hierarchies and logic programming" Proceedings of the Sixth International Conference on Logic Programming pp 149-164.
8. Boyle, RD and Thomas, RC, 1988, Computer Vision: A First Course Blackwell Scientific.
9. Cooper, MC, 1989, "An optimal k-consistency algorithm" Artificial Intelligence 41 89-95.
10. de Kleer, J, 1986, "An assumption-based tms" Artificial Intelligence 28 127-162.
11. Dechter, R, 1990, "Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition" Artificial Intelligence 41 273-312.
12. Dechter, R, 1992, "Constraint networks" In: Encyclopedia of Artificial Intelligence Wiley, pp 276-285.
13. Dechter, R and Dechter, A, 1988, "Belief maintenance in dynamic constraint networks" Proceedings of the Ninth National Conference on Artificial Intelligence pp 37-42.
14. Dechter, R and Meiri, I, 1989, "Experimental evaluation of preprocessing techniques in constraint satisfaction problems" Proceedings of the Eleventh International Joint Conference on Artificial Intelligence pp 271-277.
15. Dechter, R and Pearl, J, 1988, "Network-based heuristics for constraint-satisfaction problems" Artificial Intelligence 34 1-38.
16. Dechter, R and Pearl, J, 1989, "Tree clustering for constraint networks" Artificial Intelligence 38 353-366.
17. Deville, Y and van Hentenryck, P, 1991, "An efficient arc consistency algorithm for a class of csp problems" Proceedings of the Twelfth International Joint Conference on Artificial Intelligence.
18. Doyle, J, 1979, "A truth maintenance system" Artificial Intelligence 12 231-272.
19. Dubois, D, Fargier, H and Prade, H, 1995, "Fuzzy constraints in job-shop scheduling" Journal of Intelligent Manufacturing 6 215-235.
20. Dubois, D, Fargier, H and Prade, H, 1996a, "Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty" Applied Intelligence 6 287-309.
21. Dubois, D, Fargier, H and Prade, H, 1996b, "Refinements of the maximin approach to decision making in a fuzzy environment" Fuzzy Sets and Systems 81 103-122.
22. Dubois, H and Prade, D, 1988, Possibility Theory: An Approach to Computerised Processing of Uncertainty Plenum Press.
23. Fox, MS, 1987, Constraint-Directed Search: A Case Study of Job-Shop Scheduling Pitman, Morgan Kaufmann.
24. Freuder, EC, 1978, "Synthesizing constraint expressions" Communications of the ACM 21(11) 958-966.
25. Freuder, EC, 1982, "A sufficient condition for backtrack-free search" Journal of the ACM 29(1) 24-32.
26. Freuder, EC, 1978, "Partial constraint satisfaction" Proceedings of the Eleventh International Joint Conference on Artificial Intelligence pp 278-283.
27. Freuder, EC and Wallace, RJ, 1992, "Partial constraint satisfaction" Artificial Intelligence 58 21-70.
28. Frost, D and Dechter, R, 1994, "Dead-end driven learning" Proceedings of the Twelfth National Conference on Artificial Intelligence pp 294-300.
29. Frost, D and Dechter, R, 1995, "Look-ahead value ordering for constraint satisfaction" Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence pp 572-578.
30. Gaschnig, J, 1979, "Performance measurement and analysis of certain search algorithms" Technical Report CMU-CS-79-124, Department of Computer Science, Carnegie-Mellon University.
31. Ginsberg, ML, 1993, "Dynamic backtracking" Journal of Artificial Intelligence Research 1 25-46.
32. Guan, Q and Friedrich, G, 1992, "Extending constraint satisfaction problem solving in structural design" Proceedings of the 5th International Conference IEA/AIE, Paderborn, Germany pp 341-350.
33. Han, C and Lee, C, 1988, "Comments on Mohr and Henderson's path consistency algorithm" Artificial Intelligence 36 125-130.
34. Haralick, RM and Elliot, GL, 1980, "Increasing tree search efficiency for constraint satisfaction problems" Artificial Intelligence 14 263-313.
35. Joslin, D and Pollack, ME, 1995, "Passive and active decision postponement in plan generation" Proceedings of the 3rd European Workshop on Planning.
36. Kondrak, G and van Beek P, 1995, "A theoretical evaluation of selected backtracking algorithms" Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence pp 541-547.
37. Kuipers, B, 1994, Qualitative Reasoning: Modeling and Simulation with Incomplete Knowledge MIT Press.
38. Lang, J, 1991, "Possibilistic logic as a logical framework for min-max discrete optimisation problems and prioritised constraints" Proceedings of the International Conference on the Fundamentals of Artificial Intelligence Research pp 112-126.
39. Mackworth, A and Freuder, E, 1985, "The complexity of some polynomial network-consistency algorithms for constraint-satisfaction problems" Artificial Intelligence 25 65-74.
40. Mackworth, AK, 1977, "Consistency in networks of relations" Artificial Intelligence 8(1) 99-118.
41. Mackworth, AK, 1977, "On reading sketch maps" Proceedings of the Fifth International Joint Conference on Artificial Intelligence pp 598-606.
42. McDermott, D, 1991, "A general framework for reason maintenance" Artificial Intelligence 50 289-329.
43. Meseguer, P, 1989, "Constraint satisfaction problems: An overview" AI Communications 2(1) 3-17.
44. Meseguer, P and Larrosa, J, 1997, "Solving fuzzy constraint satisfaction problems" Proceedings of FUZZ-IEEE pp 1233-1238.
45. Miguel, I and Shen, Q, 1998, "Extending qualitative modelling for simulation of time-delayed behaviour" Proceedings of the Twelfth International Workshop on Qualitative Reasoning pp 161-166.
46. Minton, S, Johnston, MD, Philps, AB and Laird, P, 1992, "Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems" Artificial Intelligence 58 161-205.
47. Mohr, R and Henderson, T, 1986, "Arc and path consistency revisited" Artificial Intelligence 28 225-233.
48. Montanari, U, 1974, "Networks of constraints: Fundamental properties and applications to picture processing" Information Science 795-132.
49. Moura Pires, J and Prade, H, 1998, "Logical analysis of fuzzy constraint satisfaction problems" Proc. of FUZZ-IEEE-98 pp 957-962.
50. Prosser, P, 1993, "Hybrid algorithms for the constraint satisfaction problem" Computational Intelligence 9(1).
51. Rosenfeld, A, Hummel, R and Zucker, S, 1976, "Scene labeling by relaxation operations" IEEE Transactions on Systems, Man, and Cybernetics 6 420-433.
52. Schiex, T, 1992, "Possibilistic constraint satisfaction problems, or how to handle soft constraints" Proceedings of the Eighth Conference on Uncertainty in Artificial Intelligence pp 268-275.
53. Schiex, T, Fargier, H and Verfaillie, G, 1995, "Valued constraint satisfaction problems: Hard and easy problems" Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence pp 631-637.
54. Schiex, T and Verfaillie, G, 1993, "Nogood recording for static and dynamic CSP" Proceedings of the fifth IEEE International Conference on Tools with Artificial Intelligene.
55. Shapiro, L and Haralick, R, 1981, "Structural descriptions and inexact matching" IEEE Transactions on Pattern Analysis and Machine Intelligence 3(5) 504-518.
56. Shen, Q and Leitch, L, 1993, "Fuzzy qualitative simulation" IEEE Transactions on Systems, Man, and Cybernetics 23(4) 1038-1061.
57. Stallman, RM and Sussman, GJ, 1977, "Forward reasoning and dependency-directed backtracking in a system for computer aided circuit analysis" Artificial Intelligence 9 135-196.
58. Stefik, M, 1981, "Planning with constraints (Molgen: Part 1)" Artificial Intelligence 16 111-140.
59. Tsang, EPK, 1993, Foundations of Constraint Satisfaction Academic Press.
60. van Hentenryck, P, 1989, Constraint Satisfaction in Logic Programming MIT Press.
61. van Hentenryck, P and Provost, TL, 1991, "Incremental search in constraint logic programming" New Generation Computing 9 257-275.
62. Verfaillie, G and Schiex, T, 1994, "Solution reuse in dynamic constraint satisfaction problems" Proceedings of the Twelfth National Conference on Artificial Intelligence pp 307-312.
63. Wallace, RJ, 1996, "Enhancements of branch and bound methods for the maximal constraint satisfaction problem" Proc. of AAAI-96 pp 188-195.
64. Wallace, RJ and Freuder, EC, 1998, "Stable solutions for dynamic constraint satisfaction problems" In: M Maher and J-F Puget (eds) Principles and Practice of Constraint Programming - CP98 Springer-Verlag.
65. Waltz, D, 1975, "Understanding line drawings of scenes with shadows" In: PH Winston (ed) The Psychology of Computer Vision McGraw-Hill, pp 19-91.