Automatic generation of CHR constraint solvers

Theory and Practice of Logic Programming

Volumn 5, Issue 4-5, 2005, Pages 403-418

  Abdennadher, Slim ^a   Rigotti, Christophe ^b  

^a Faculty of Media Engineering and Technology   (Egypt)

^b CNRS   (France)

Author keywords

Automatic solver generation; Constraint logic programming; Rule based constraint solver; Tabled resolution

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; CONTEXT SENSITIVE GRAMMARS; HIGH LEVEL LANGUAGES; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; WORLD WIDE WEB;

AUTOMATIC SOLVER GENERATION; CONSTRAINT LOGIC PROGRAMMING; RULE-BASED CONSTRAINED SOLVER; TABLED RESOLUTION;

CONSTRAINT THEORY;

EID: 22944455580     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068405002371     Document Type: Article

References (19)

1. ABDENNADHER, S. AND RIGOTTI, C. 2000. Automatic generation of propagation rules for finite domains. In 6th International Conference on Principles and Practice of Constraint Programming, CP'00. LNCS 1894. Springer-Verlag, 18-34.
2. ABDENNADHER, S. AND RIGOTTI, C. 2001a. Towards inductive constraint solving. In 7th International Conference on Principles and Practice of Constraint Programming, CP'01. LNCS 2239. Springer-Verlag, 31-45.
3. ABDENNADHER, S. AND RIGOTTI, C. 2001b. Using confluence to generate rule-based constraint solvers. In Third International Conference on Principles and Practice of Declarative Programming. ACM Press, 127-135.
4. v: A flexible query language. In Third International Conference on Flexible Query Answering Systems. LNAI 1495. Springer-Verlag, 1-14.
5. APT, K. 1998. A proof theoretic view of constraint programming. Special Issue of Fundamenta Informaticae 34, 3, 295-321.
6. APT, K. AND MONFROY, E. 1999. Automatic generation of constraint propagation algorithms for small finite domains. In 5th International Conference on Principles and Practice of Constraint Programming, CP'99. LNCS 1713. Springer-Verlag, 58-72.
7. CUI, B. AND WARREN, D. S. 2000. A system for tabled constraint logic programming. In First International Conference on Computational Logic. LNCS 1861. Springer-Verlag, 478-492.
8. FRÜHWIRTH, T. 1998. Theory and practice of constraint handling rules, special issue on constraint logic programming. Journal of Logic Programming 37, 1-3, 95-138.
9. JAFFAR, J. AND MAHER, M. J. 1994. Constraint logic programming: A survey. Journal of Logic Programming 19, 20, 503-581.
10. LE PROVOST, T. AND WALLACE, M. 1993. Generalized constraint propagation over the CLP scheme. Journal of Logic Programming 16, 3, 319-359.
11. MARRIOTT, K. AND STUCKEY, P. 1998. Programming with Constraints: An Introduction. MIT Press.
12. MUGGLETON, S. AND DE RAEDT, L. 1994. Inductive Logic Programming: theory and methods. Journal of Logic Programming 19, 20, 629-679.
13. PLOTKIN, G. 1970. A note on inductive generalization. In Machine Intelligence. Vol. 5. Edinburgh University Press, 153-163.
14. RINGEISSEN, C. AND MONFROY, E. 2000. Generating propagation rules for finite domains via unification in finite algebra. In New Trends in Constraints. LNAI 1865. Springer-Verlag, 150-172.
15. STUCKEY, P. 1995. Negation and constraint logic programming. Information and Computation 118, 1, 12-33.
16. TAMAKI, H. AND SATO, T. 1986. OLD resolution with tabulation. In 3rd International Conference on Logic Programming. LNCS 225. Springer-Verlag, 84-98.
17. VAN HENTENRYCK, P., SARASWAT, V., AND DEVILLE, Y. 1998. Desing, implementation, and evaluation of the constraint language cc(FD). Journal of Logic Programming 37, 1-3, 139-164.
18. WARREN, D. S. 1992. Memoing for logic programs. Communications of ACM 35, 4, 93-11.
19. WÜRTZ, J. AND MÜLLER, T. 1996. Constructive disjunction revisited. In 20th German Annual Conference on Artificial Intelligence. LNAI 1137. Springer-Verlag, 377-386.