TITLE: A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
PRESENTER: Dr. Barry O'Sullivan, http://www.cs.ucc.ie/~osullb/, email@example.com
AFFILIATION:University College Cork, http://www.cs.ucc.ie/
DATE: Friday 1st July 2005
PLACE: CSE Seminar Room K17_113
Constraint programming is rapidly becoming the technology
of choice for modelling and solving complex combinatorial
problems. However, users of this technology need significant
expertise in order to model their problem appropriately.
The lack of availability of such expertise is a significant
bottleneck to the broader uptake of constraint technology in
the real world. We present a new SAT-based version space
algorithm for acquiring constraint satisfaction problems from
examples of solutions and non-solutions of the target problem.
We show how domain-specific knowledge related to constraint
redundancy can be exploited in a number of ways using the new
algorithm. We highlight a number of advantages of our approach.
Finally, we empirically demonstrate the algorithm and the effect
of exploiting domain-specific knowledge.
(Joint work with Christian Bessiere, Remi Coletta
and Frederic Koriche, LIRMM, Montpellier, France)
BIOGRAPHY OF SPEAKER:
Dr O'Sullivan is Senior Lecturer in the Department of computer
science at University College Cork and Associate Director of
the Cork Constraint Computation Centre.
Van Hai Ho