Automatic generation of rule-based constraint solvers over finite domains

ACM Transactions on Computational Logic

Volumn 5, Issue 2, 2004, Pages 177-205

  Abdennadher, Slim ^a   Rigotti, Christophe ^b,c  

^a GERMAN UNIVERSITY IN CAIRO   (Egypt)

^b UNIVERSITÉ DE LYON   (France)

^c CNRS   (France)

Author keywords

Finite domains; Generation of solvers; Rule based constraint programming

Indexed keywords

BOOLEAN CIRCUIT; CONSTRAINT HANDLING RULES (CHR); PROPAGATION RULES; SUPERFLUOUS CONSTRAINTS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BOOLEAN ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; DIGITAL CIRCUITS; MATHEMATICAL TRANSFORMATIONS; SET THEORY;

CONSTRAINT THEORY;

EID: 4444269262     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/976706.976707     Document Type: Article

References (25)

1. ABDENNADHER, S. AND RIGOTTI, C. 2000. Automatic generation of propagation rules for finite domains. In Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (Singapore). Lecture Notes in Computer Science, vol. 1894. Springer-Verlag, New York, 18-34.
2. ABDENNADHER, S. AND RIGOTTI, C. 2001a. Towards inductive constraint solving. In Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming (Paphos, Cyprus). Lecture Notes in Computer Science, vol. 2239. Springer-Verlag, New York, 31-45.
3. ABDENNADHER, S. AND RIGOTTI, C. 2001b. Using confluence to generate rule-based constraint solvers. In Proceedings of the 3rd International Conference on Principles and Practice of Declarative Programming (Firenze, Italy). ACM, New York, 127-135.
4. ABDENNADHER, S. AND SAFT, M. Constraint Handling Rules online, http://www.pms.informatik.unimuenchen.de/~webchr/
5. AGRAWAL, R., IMIELINSKI, T., AND SWAMI, A. N. 1993. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (Washington, D.C.). ACM, New York, 207-216.
6. ALLEN, J. F. 1983. Maintaining knowledge about temporal intervals. Commun. ACM 26, 11, 832-843.
7. APT, K. R. 1998. A proof theoretic view of constraint programming. Fund. Inf. 34, 295-321.
8. APT, K. R. 2000. Some remarks on Boolean constraint propagation. In New Trends in Constraints, Lecture Notes in Artificial Intelligence, vol. 1865. Springer-Verlag, New York, 91-107.
9. APT, K. R. AND MONFROY, E. 1999. Automatic generation of constraint propagation algorithms for small finite domains. In Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming (Alexandria, Va.). Lecture Notes in Computer Science, vol. 1713. Springer-Verlag, New York, 58-72.
10. APT, K. R. AND MONFROY, E. 2001. Constraint programming viewed as rule-based programming. Theory Pract. Logic Prog. 1, 6, 713-750.
11. BAYARDO, R. J., AGRAWAL, R., AND GUNOPULOS, D. 1999. Constraint-based rule mining in large, dense databases. In Proceedings of the 15th International Conference on Data Engineering (Sydney, Australia). IEEE Computer Society, New York, 188-197.
12. CASEAU, Y., JOSSET, P.-X., AND LABURTHE, P. 1999. Claire: Combining sets, search, and rules to better express algorithms. In Proceedings of the 16th International Conference on Logic Programming (Las Cruces, N.M.). The MIT Press, Cambridge, Mass., 245-259.
13. CODOGNET, P. AND DIAZ, D. 1993. Boolean constraint solving using CLP(FD). In Proceedings of the International Symposium on Logic Programming (Vancouver, B.C., Canada). The MIT Press, Cambridge, Mass., 525-539.
14. DINCBAS, M., VAN HENTENRYCK, P., SIMONIS, H., AGGOUN, A., GRAF, T., AND BERTHIER, F. 1988. The constraint logic programming language CHIP. Tech. Rep. TR-LP-37. ECRC, Munich, Germany.
15. FHÜHWIRTH, T. 1998. Theory and practice of constraint handling rules. J. Logic Prog. 37, 1-3, 95-138.
16. KIRCHNER, C., KIRCHNER, H., AND VITTEK, M. 1993. Implementing computational systems with constraints. In Proceedings of the 1st Workshop on Principles and Practice of Constraints Programming (Newport, R.I.). MIT Press, Cambridge, Mass., 156-165.
17. KIRCHNER, C. AND RINGEISSEN, C. 1998. Rule-based constraint programming. Fund. Inf. 34, 225-262.
18. KIRCHNER, H. AND RINGEISSEN, C. 1992. A constraint solver in finite algebras and its combination with unification algorithms. In Proceedings of the Joint International Conference and Symposium on Logic Programming (Washington, D.C.). MIT Press, Cambridge, Mass., 225-239.
19. KLEENE, S. 1950. Introduction to Metamathematics. Van Nostrand, Princeton, New Jersey.
20. MUGGLETON, S. AND DE RAEDT, L. 1994. Inductive logic programming: Theory and methods. J. Logic Prog. 19/20, 629-679.
21. PLOTKIN, G. 1970. A note on inductive generalization. In Machine Intelligence. Vol. 5. Edinburgh University Press, 153-163.
22. RINGEISSEN, C. AND MONFROY, E. 2000. Generating propagation rules for finite domains via unification in finite algebra. In New Trends in Constraints. Lecture Notes in Artificial Intelligence, vol. 1865. Springer-Verlag, New York, 150-172.
23. TOIVONEN, H., KLEMETTINEN, M., RONKAINEN, P., HÄTÖNEN, K., AND MANNILA, H. 1995. Pruning and grouping of discovered association rules. In Proceedings of the ECML Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases (Heraklion, Crete, Greece). MLnet, 47-52.
24. VAN HENTENRYCK, P. 1991. Constraint logic programming. The Knowledge Engineering Review 6,3, 151-194.
25. VAN HENTENRYCK, P., SIMONIS, H., AND DINCBAS, M. 1992. Constraint satisfaction using constraint logic programming. Artif. Intel. 58, 1-3, 113-159.