Dynamic Flexible Constraint Satisfaction

Applied Intelligence

Volumn 13, Issue 3, 2000, Pages 231-245

  Miguel, Ian ^a   Shen, Qiang ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Constraint satisfaction; Dynamic CSP; Flexible local changes; Prioritised preference based constraints

Indexed keywords

EID: 0004872609     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026563910104     Document Type: Article

References (30)

1. A. Mackworth, "Constraint satisfaction problems," in Encyclopedia of Artificial Intelligence, John Wiley and Sons: New York, pp. 285-293, 1992.
2. I. Miguel and Q. Shen, "Solution techniques for constraint satisfaction problems (Part 1: Foundations, Part 2: Advanced approaches)," Artificial Intelligence Review, in press.
3. L. Shapiro and R. Haralick, "Structural descriptions and inexact matching," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 5, pp. 504-518, 1981.
4. D. Waltz, "Understanding line drawings of scenes with shadows," in The Psychology of Computer Vision, edited by P.H. Winston, McGraw-Hill: NewYork, pp. 19-91, 1975.
5. A. Blum and M. Furst, "Fast planning through planning graph analysis," Artificial Intelligence, vol. 90, pp. 281-300, 1997.
6. D. Dubois, H. Fargier, and H. Prade, "Fuzzy constraints in jobshop scheduling," Journal of Intelligent Manufacturing, vol. 6, pp. 215-235, 1995.
7. J. de Kleer, "An assumption-based tms," Artificial Intelligence, vol. 28, pp. 127-162, 1986.
8. R. Dechter and A. Dechter, "Belief maintenance in dynamic constraint networks," in Proceedings of the 9th National Conference on Artificial Intelligence, 1988, pp. 37-42.
9. E.H. Turner and R.M. Turner, "A constraint-based approach to assigning system components to tasks," Applied Intelligence, vol. 10, no. 2, pp. 155-172, 1999.
10. A. Borning, M. Maher, A. Martindale, and M. Wilson, "Constraint hierarchies and logic programming," in Proceedings of the 6th International Conference on Logic Programming, 1989, pp. 149-164.
11. B. Kuipers, Qualitative Reasoning: Modeling and Simulation with Incomplete Knowledge, MIT Press: Cambridge, MA, 1994.
12. I. Miguel and Q. Shen, "Extending qualitative modelling for simulation of time-delayed behaviour," in Proceedings of the 12th International Workshop on Qualitative Reasoning, 1998, pp. 161-166.
13. D. Dubois, H. Fargier, and H. Prade, "Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty," Applied Intelligence, vol. 6, no. 4, pp. 287-309, 1996.
14. E.C. Freuder and R.J. Wallace, "Partial constraint satisfaction," Artificial Intelligence, vol. 58, pp. 21-70, 1992.
15. R.J. Wallace and E.C. Freuder, "Stable solutions for dynamic constraint satisfaction problems," in Principles and Practice of Constraint Programming - CP98, edited by M. Maher and J.-F. Puget, Springer: Berlin, 1998.
16. I. Miguel and Q. Shen, "Extending fcsp to support dynamically changing problems," in Proceedings of the 8th International Conference on Fuzzy Systems, 1999, pp. 1615-1620.
17. R.J. Wallace, "Enhancements of branch and bound methods for the maximal constraint satisfaction problem," in Proceedings of the 13th National Conference on Artificial Intelligence, 1996, pp. 188-195.
18. R. Dechter, A. Dechter, and J. Pearl, "Optimization in constraint networks," in Influence Diagrams, Belief Nets and Decision Analysis, edited by R.M. Oliver and J. Q. Smith, John Wiley and Sons: NewYork, pp. 411-425, 1990.
19. T. Schiex, H. Fargier, and G. Verfaillie, "Valued constraint satisfaction problems: Hard and easy problems," in Proceedings of the 14th International Joint Conference on Artificial Intelligence, 1995, pp. 631-637.
20. T. Schiex, "Possibilistic constraint satisfaction problems, or how to handle soft constraints," in Proceedings of the 8th Conference on Uncertainty in Artificial Intelligence, 1992, pp. 268-275.
21. S. Minton, M.D. Johnston, A.B. Philips, and P. Laird, "Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems," Artificial Intelligence, vol. 58, pp. 161-205, 1992.
22. G. Verfaillie and T. Schiex, "Solution reuse in dynamic constraint satisfaction problems," in Proceedings of the 12th National Conference on Artificial Intelligence, 1994, pp. 307-312.
23. T. Schiex and G. Verfaillie, "Nogood recording for static and dynamic constraint satisfaction problems," International Journal of Artificial Intelligence Tools, vol. 3, no. 2, pp. 187-207, 1994.
24. B. Mazure, L. Saïs, and É. Grégoire, "Tabu search for sat," in Proceedings of the 15th National Conference on Artificial Intelligence, 1997, pp. 281-285.
25. R.M. Haralick and G.L. Elliot, "Increasing tree search efficiency for constraint satisfaction problems," Artificial Intelligence, vol. 14, pp. 263-313, 1980.
26. D. Sabin and E.C. Freuder, "Contradicting conventional wisdom in constraint satisfaction," in Proceedings of the 11th European Conference on Artificial Intelligence, 1994, pp. 125-129.
27. D.S. Weld, "Recent advances in ai planning," AI Magazine, vol, 20, no. 2, pp. 93-123, 1999.
28. W. Hamscher, L. Console, and J. de Kleer, Readings in Modelbased Diagnosis, Morgan Kaufmann: Los Altos, CA, 1992.
29. J. Keppens and Q. Shen, "On compositional modelling," Knowledge Engineering Review, in press, 2001.
30. J. Moura Pires, F. Moura Pires, and R. Almeida Ribeiro, "Structure and properties of leximin fcsp and its influence on optimisation problems," in Proceedings of the 7th Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, 1998, pp. 188-194.