Towards inductive constraint solving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2239, Issue , 2001, Pages 31-45

  Abdennadher, Slim ^a   Rigotti, Christophe ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY;

AUTOMATIC GENERATION; CONSTRAINT LOGIC PROGRAMS; CONSTRAINT PROPAGATION; CONSTRAINT SOLVERS; CONSTRAINT SOLVING; PROPAGATION RULE; SIMPLIFICATION ALGORITHMS; SIMPLIFICATION RULES;

LOGIC PROGRAMMING;

EID: 84947914416     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_3     Document Type: Conference Paper

References (20)

1. S. Abdennadher. Operational semantics and confluence of constraint propagation rules. In Proc. of the third International Conference on Principles and Practice of Constraint Programming, CP’97, LNCS 1330, pages 252–266. Springer-Verlag, November 1997.
2. S. Abdennadher, T. Fruhwirth, and H. Meuss. Confluence and semantics of constraint simplification rules. Constraints Journal, Special Issue on the Second International Conference on Principles and Practice of Constraint Programming, 4(2):133–165, May 1999.
3. S. Abdennadher and C. Rigotti. Automatic generation of propagation rules for finite domains. In Proc. of the 6th International Conference on Principles and Practice of Constraint Programming, CP’00, LNCS 1894, pages 18–34. Springer- Verlag, September 2000.
4. S. Abdennadher and C. Rigotti. Using confluence to generate rule-based constraint solvers. In Proc. of the third International Conference on Principles and Practice of Declarative Programming. ACM Press, September 2001. To appear.
5. K. Apt and E. Monfroy. Automatic generation of constraint propagation algorithms for small finite domains. In Proc. of the 5th International Conference on Principles and Practice of Constraint Programming, CP’99, LNCS 1713, pages 58–72. Springer-Verlag, October 1999.
6. T. Fruhwirth. Theory and practice of constraint handling rules, special issue on constraint logic programming. Journal of Logic Programming, 37(1-3):95–138, October 1998.
7. T. Fruhwirth. Proving termination of constraint solver programs. In New Trends in Constraints, pages 298–317. LNAI 1865, 2000.
8. P. V. Hentenryck, V. Saraswat, and Y. Deville. Desing, implementation, and evaluation of the constraint language cc(FD). Journal of Logic Programming, 37(1-3):139–164, 1998.
9. J. Jaffar and M. J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19-20:503–581, 1994.
10. L. Martin and C. Vrain. Induction of constraint logic programs. In Proc. of the International Conference on Algorithms and Learning Theory, LNCS 1160, pages 169–176. Springer-Verlag, October 1996.
11. F. Mizoguchi and H. Ohwada. Constrained relative least general generalization for inducing constraint logic programs. New Generation Computing, 13:335–368, 1995.
12. S. Muggleton and L. De Raedt. Inductive Logic Programming: theory and methods. Journal of Logic Programming, 19,20:629–679, 1994.
13. S. Padmanabhuni and A. K. Ghose. Inductive constraint logic programming: An overview. In Learning and reasoning with complex representations, LNCS 1359, pages 1–8. Springer-Verlag, 1998.
14. C. Page and A. Frisch. Generalization and learnability: a study of constrained atoms. In Inductive Logic Programming, pages 29–61. London: Academic Press, 1992.
15. G. Plotkin. A note on inductive generalization. In Machine Intelligence, volume 5, pages 153–163. Edinburgh University Press, 1970.
16. T. L. Provost and M. Wallace. Generalized constraint propagation over the CLP scheme. Journal of Logic Programming, 16(3):319–359, 1993.
17. C. Ringeissen and E. Monfroy. Generating propagation rules for finite domains: A mixed approach. In New Trends in Constraints, pages 150–172. LNAI 1865, 2000.
18. M. Sebag and C. Rouveirol. Constraint inductive logic programming. In Advances in ILP, pages 277–294. IOS Press, 1996.
19. H. Tamaki and T. Sato. OLD resolution with tabulation. In Proc. of the 3rd International Conference on Logic Programming, LNCS 225, pages 84–98. Springer- Verlag, 1986.
20. J. Wurtz and T. Muller. Constructive disjunction revisited. In Proc. of the 20th German Annual Conference on Artificial Intelligence, LNAI 1137, pages 377–386. Springer-Verlag, 1996.