Skip to Main content Skip to Navigation
Habilitation à diriger des recherches

The versatility of using explanations within constraint programming

Narendra Jussien 1
1 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
Abstract : Constraint programming is a research topic benefiting from many other areas: discrete mathematics, numerical analysis, artificial intelligence, operations research, and formal calculus. It has proven its interest and its efficiency in various domains: combinatorial optimization, scheduling, finance, simulation and synthesis, diagnosis, molecular biology, or geometrical problems. However, some limitations and difficulties remain: designing stable and generic algorithms, handling dynamic problems, opening constraint programming to non-specialists, etc.

In this document, we advocate the use of explanations within constraint programming. Our aim is two-fold: drawing the big picture about explanations (definition, generation, management and use) and showing that they can help address several issues in constraint programming. We also introduce a new general explanation-based search technique that has been successfully used to design new efficient algorithms. Finally, current open issues and research topics in this field are presented.
Document type :
Habilitation à diriger des recherches
Complete list of metadatas

Cited literature [79 references]  Display  Hide  Download
Contributor : Narendra Jussien <>
Submitted on : Monday, July 7, 2008 - 8:54:44 PM
Last modification on : Friday, October 23, 2020 - 4:42:41 PM
Long-term archiving on: : Friday, May 28, 2010 - 8:39:51 PM


  • HAL Id : tel-00293905, version 1


Narendra Jussien. The versatility of using explanations within constraint programming. Other [cs.OH]. Université de Nantes, 2003. ⟨tel-00293905⟩



Record views


Files downloads