Alexandre Tessier

Title: Alexandre Tessier

Main Research Question: How can we develop a concise and accessible explanation for the withdrawal of a value from a domain in constraint satisfaction problems?

Methodology: The authors focused on constraint satisfaction problems (CSP) and finite domains, specifically using a constraint programming language over finite domains, GNU-Prolog. They explored two methods of solving CSPs: labeling and domain reduction. The main contribution of this paper is the development of a value withdrawal explanation framework, which is applicable to a wide range of constraint solvers.

Results: The authors proposed a framework for explaining the withdrawal of a value from a domain in CSPs. This framework is based on the concept of a "clue," which is a rule that contributes to the removal of a value from a domain. They demonstrated how clues can be used to construct explanations for value withdrawal in both a specific case (arc consistency) and a more general case (hyper-arc consistency and other weaker consistencies).

Implications: The development of this explanation framework has several implications. First, it provides a tool for debugging CSP programs by analyzing the removal of values from domains, which can help locate errors. Second, it can be used to optimize search algorithms and improve the efficiency of constraint solvers. Finally, the framework can be extended to other constraint domains and problem types, making it a versatile and valuable tool for constraint programming.

Link to Article: https://arxiv.org/abs/0012005v1 Authors: arXiv ID: 0012005v1