Skip to Main content Skip to Navigation
Conference papers

On Learning Constraint Problems

Abstract : It is well known that modeling with constraints networks require a fair expertise. Thus tools able to automatically generate such networks have gained a major interest. The major contribution of this paper is to set a new framework based on Inductive Logic Programming able to build a constraint model from solutions and non-solutions of related problems. The model is expressed in a middle-level modeling language. On this particular relational learning problem, traditional topdown search methods fall into blind search and bottom-up search methods produce too expensive coverage tests. Recent works in Inductive Logic Programming about phase transition and crossing plateau shows that no general solution can face all these difficulties. In this context, we have designed an algorithm combining the major qualities of these two types of search techniques.We present experimental results on some benchmarks ranging from puzzles to scheduling problems.
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Greyc Référent Connect in order to contact the contributor
Submitted on : Tuesday, July 1, 2014 - 1:08:49 PM
Last modification on : Tuesday, October 12, 2021 - 5:20:29 PM
Long-term archiving on: : Wednesday, October 1, 2014 - 12:15:50 PM


Files produced by the author(s)


  • HAL Id : hal-01016891, version 1


Arnaud Lallouet, Matthieu Lopez, Lionel Martin, Christel Vrain. On Learning Constraint Problems. International Conference on Tools with Artificial Intelligence,ICTAI, Oct 2010, Arras, France. pp.45-52. ⟨hal-01016891⟩



Record views


Files downloads