Constraint programming viewed as rule-based programming

Theory and Practice of Logic Programming

Volumn 1, Issue 6, 2001, Pages 713-750

  Apt, Krzysztof R ^a   Monfroy, Eric ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b UNIVERSITÉ DE NANTES   (France)

Author keywords

constraint programming; finite domain; rule based programming

Indexed keywords

EID: 85008544040     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068401000072     Document Type: Article

References (39)

1. Abdennadher, S. & Rigotti, C. (2000) Automatic generation of propagation rules for finite domains. In: Dechter, R. (ed.), Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (CP'00), pp. 18–34. Lecture Notes in Computer Science. 1894 Springer-Verlag.
2. Agrawal, R., Mannila, H., Srikant, R., Toivonen & Verkamo, A. I. (1996) Fast discovery of association rules. In: Fayyad, U. M., Piatetsky-Shapiro, G., Smyth, P. & Uthurusamy, R. (eds.), Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI Press.
3. Allen, J. F. (1983) Maintaining knowledge about temporal intervals. Comm. ACM, 26 (11), 832–843.
4. Apt, K. R. (1998) A proof theoretic view of constraint programming. Fundamenta informaticae, 33 (3), 263–293 (Available via http://arXiv.org/archive/cs/.)
5. Apt, K. R. (1999a) The essence of constraint propagation. Theoretical Computer Science, 221(1–2), 179–210. (Available via http://arXiv.org/archive/cs/.)
6. Apt, K. R. (1999b) The rough guide to constraint propagation. In: Jaffar, J. (ed.), Fifth International Conference on Principles and Practice of Constraint Programming (CP'99), pp. 1–23. Lecture Notes in Computer Science 1713. Springer-Verlag. (Available via http://arXiv.org/archive/cs/.)
7. Apt, K. R. & Monfroy, E. (1999) Automatic generation of constraint propagation algorithms for small finite domains. In: Jaffar, J. (ed.), Fifth International Conference on Principles and Practice of Constraint Programming (CP'99), pp. 58–72. Lecture Notes in Computer Science. Springer-Verlag. (Available via http://arXiv.org/archive/cs/.)
8. Apt, K. R. (2000) Some remarks on Boolean constraint propagation. In: Apt, K. R., Kakas, A. C., Monfroy, E. & Rossi, F. (eds.), New Trends in Constraints: Lecture Notes in Artificial Intelligence 1865, pp. 91–107. Springer-Verlag. (Available via http://arXiv.org/archive/cs/.)
9. Bessière, C. (1999) Non-binary constraints. In: Jaffar, J. (ed.), Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming (CP’99): Lecture Notes in Computer Science 1713, pp. 24–27. Springer-Verlag.
10. Bessière, C. & Régin, J. C. (1997) Arc consistency for generalized constraint networks: preliminary results. Proceedings International Joint Conference on Artificial Intelligence (IJCAI'97), p. 398–404.
11. Borovansky, P., Kirchner, C., Kirchner, H., Moreau, P.-E. & Ringeissen, Ch. (1998) An Overview of ELAN. In: Kirchner, C. & Kirchner, H. (eds.), Proceedings Second International Workshop on Rewriting Logic and its Applications: Electronic Notes in Theoretical Computer Science 15, pp. 398–404. Elsevier.
12. By, T. (1997) Line labelling by meta-programming. Technical report CS-97–07, University of Sheffield, UK.
13. Caseau, Y. & Laburthe, F. (1996) Introduction to the CLAIRE programming language. Technical report, Departement Mathématiques et Informatique, Ecole Normale Supérieure, Paris, France.
14. Castro, C. (1998) Building constraint satisfaction problem solvers using rewrite rules and strategies. Fundamenta informaticae, 33 (3), 263–293.
15. Davis, E. (1987) Constraint propagation with interval labels. Artif. Intell., 32 (3), 281–331.
16. Dechter, R. & van Beek, P. (1997) Local and global relational consistency. Theoretical Computer Science, 173 (1), 283–308.
17. Fleming, J. (2000) Rainy day games. Dell Logic Puzzles 67, 7.
18. Forgy, C. L. (1981) The OPS5 user's manual. Technical report CMU-CS-81–135, Carnegie-Mellon University.
19. Frühwirth, T. (1998) Theory and practice of constraint handling rules. J. Logic Programming, 37(1–3), 95–138. (Special Issue on Constraint Logic Programming (P. Stuckey and K. Marriot, eds.).)
20. Frühwirth, T. (1995) Constraint handling rules. In: Podelski, A. (ed.), Constraint programming: Basics and trends: Lecture Notes in Computer Science 910, pp. 90–107. Springer-Verlag.
21. Kirchner, C. & Ringeissen, C. (1998) Rule-based constraint programming. Fundamenta Informaticae, 34 (3), 225–262.
22. Kleene, S. C. (1952) Introduction to Metamathematics. van Nostrand.
23. Luger, G. F. & Stubblefield, W. A. (1998) Artificial Intelligence. 3rd ed. Addison-Wesley.
24. Mackworth, A. (1977a) Consistency in networks of relations. Artif. Intell., 8 (1), 99–118.
25. Mackworth, A. K. (1977b) On reading sketch maps. Proceedings International Joint Conference on Artificial Intelligence (IJCAI'77), pp. 598–606.
26. Marriott, K. & Stuckey, P. (1998) Programming with Constraints. MIT Press.
27. Mohr, R. & Masini, G. (1988) Good old discrete relaxation. In: Kodratoff, Y. (ed.), Proceedings of the 8th European Conference on Artificial Intelligence (ECAI), pp. 651–656. Pitman.
28. Montanari, U. & Rossi, F. (1991) Constraint relaxation may be perfect. Artif. Intell., 48, 143–170.
29. Muggleton, S. & de Raedt, L. (1994) Inductive logic programming: Theory and methods. J. Logic Programming, 19, 20, 629–680.
30. Muth, P. (1976) A nine-valued circuit model for test generation. IEEE Trans. Computers, C-25 (6), 630–636.
31. Pedrycz, W. & Gomide, F. (1998) An Introduction to Fuzzy Sets. MIT Press.
32. Quinlan, J. R. (1993) C4.5: Programs for Machine Learning. Morgan Kaufmann.
33. Ringeissen, C. & Monfroy, E. (2000) Generating propagation rules for finite domains: a mixed approach. In: Apt, K. R., Kakas, A. C., Monfroy, E. & Rossi, F. (eds.), New Trends in Constraints: Lecture Notes in Artificial Intelligence 1865, pp. 150–172. Springer-Verlag.
34. Sabin, D. & Freuder, E. (1994) Contradicting conventional wisdom in constraint satisfaction. In: Borning, A. (ed.), PPCP'94: Second Workshop on Principles and Practice of Constraint Programming.
35. Tsang, E. (1993) Foundations of Constraint Satisfaction. Academic Press.
36. Ullman, J. D. (1988) Principles of Database and Knowledge-base Systems, Vol. i. Computer Science Press.
37. Van Hentenryck, P., Simonis, H. & Dincbas, M. (1992) Constraint satisfaction using constraint logic programming. Artif. Intell., 58, 113–159.
38. Waltz, D. L. (1975) Generating semantic descriptions from drawings of scenes with shadows. In: Winston, P. H. (ed.), The Psychology of Computer Vision, pp. 19–91. McGraw Hill.
39. Winston, P. H. (1992) Artificial Intelligence. 3rd ed. Addison-Wesley.