The Framework Approach for Constraint Satisfaction

ACM Computing Surveys

Volumn 32, Issue 1, 2000, Pages 13-

  Roy, Pierre ^a   Liret, Anne ^a   Pachet, Francois ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b SONY COMPUTER SCIENCE LABORATORY   (France)

Author keywords

Constraint satisfaction; Frameworks; Object oriented programming

Indexed keywords

EID: 33745104014     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/351936.351949     Document Type: Article

References (18)

1. P. Avesani, A. Perini, and F. Ricci, “COOL: An Object System with Constraints” proceedings of TOOLS’2, Paris, pp. 221-228, 1990.
2. N. Beldiceanu and E. Contejean “Introducing global constraints in CHIP” Journal of Mathematical and Computer Modelling, 20 (12), pp. 97-123, 1994.
3. C. Bessiere and J.-C. Regin, “Arc-Consistency for General Constraint Networks: Preliminary Results” proceedings of IJCAI, Nagoya, Japan, pp. 398-404, Aug. 1997.
4. Y. Caseau, “Abstract Interpretation of Constraints over an Order-Sorted Domain” proceedings of International Logic Programming Symposium, San Diego (Ca), pp. 435-454, 1991.
5. Y. Caseau, “Constraint Satisfaction with an Object-Oriented Knowledge Representation Language” Journal of Applied Intelligence, vol. 4, pp. 157-184, 1994.
6. Yves Caseau and Francois Laburthe, “CLAIRE: Combining Objects and Rules for Problem Solving” proceedings of the JICSLP’96 workshop on multi-paradigm logic programming, M.T. Chakravarty, Y. Guo, T. Ida eds., TU berlin, 1996.
7. P. Codognet and D. Diaz, “Compiling Constraints in clp(FD)”, Journal of Logic Programming, vol. 27 (3), pp. 185-226, 1996.
8. A. Colmerauer, “An Introduction to Prolog-III” Communication of the ACM, vol. 33(7), pp. 69, 1990.
9. M. Fayad and D. Schmidt, “Object-Oriented Application Frameworks”, Communications of the ACM, Special Issue on Object-Oriented Application Frameworks, 40 (10), October 1997.
10. E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design Patterns, Addison-Wesley, 1994.
11. R. Johnson and B. Foote, “Designing Reusable Classes” JOOP, vol. 1(2), pp. 22, 1988.
12. J.-L. Lauriere, “A Language and a Program for Stating and Solving Combinatorial Problems” Artificial intelligence, vol. 10(1), pp. 29-127, 1978.
13. A. K. Mackworth, “Consistency in Networks of Relations” Artificial intelligence, vol. 8 (1), pp. 99-118, 1977.
14. P. Prosser, “Hybrid Algorithms for the Constraint Satisfaction Problem” Computational Intelligence, vol. 9, pp. 268-299, 1993.
15. J.-F. Puget and M. Leconte, “Beyond the Glass Box: Constraints as Objects” propceedings of International Logic Programming Symposium, ILPS, pp. 513-527, Portland, Oregon, Dec. 1995.
16. P. Roy and F. Pachet, “Reifying Constraint Satisfaction in Smalltalk” Journal of Object-Oriented Programming, vol. 10 (4), pp. 51-63, 1997.
17. P. Roy and F. Pachet, “A Framework for Expressing Knowledge About Constraint Satisfaction Problems” proceedings of Flairs, Daytona Beach (Florida), pp. 47-51, May 1997.
18. P. Van Hentenryck, H. Simonis and M. Dincbas, “Constraint Satisfaction using Constraint Logic Programming”, Artificial Intelligence, vol. 58, pp. 113-159, 1992.