Towards Inductive Constraint Solving
A difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation and simplification algorithm. In previous work, different methods for automatic generation of propagation rules ,, and simplification rules  for constraints defined over finite domains have been proposed. In this paper, we present a method for generating rule-based solvers for constraint predicates defined by means of a constraint logic program, even when the constraint domain is infinite. This approach can be seen as a concrete step towards Inductive Constraint Solving.
KeywordsLogic Program Logic Programming Constraint Programming Constraint Logic Inductive Logic Programming
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 7.T. Frühwirth. Proving termination of constraint solver programs. In New Trends in Constraints, pages 298–317. LNAI 1865, 2000.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 18.M. Sebag and C. Rouveirol. Constraint inductive logic programming. In Advances in ILP, pages 277–294. IOS Press, 1996.Google Scholar
- 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.Google Scholar
- 20.J. Würtz and T. Müller. Constructive disjunction revisited. In Proc. of the 20th German Annual Conference on Artificial Intelligence, LNAI 1137, pages 377–386. Springer-Verlag, 1996.Google Scholar