An explanation-based tools for debugging constraint satisfaction problems

Authors:
Samir Ouis;Mohamed Tounsi
Affiliations:
Imam University, Computer Science Department, Riyadh, P.O. Box 84880, Saudi Arabia;Prince Sultan University, Computer Science Department, Riyadh, P.O. Box 66833, Saudi Arabia
Venue:
Applied Soft Computing
Year:
2008

Citing 8
Cited 1

Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition

Artificial Intelligence
Generalizing partial order and dynamic backtracking

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The GNU Prolog system and its implementation

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
GSAT and Dynamic Backtracking

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Dynamic backtracking

Journal of Artificial Intelligence Research
Computing explanations and implications in preference-based configurators

ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Explaining the Non-compliance between Templates and Agreement Offers in WS-Agreement

ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an explanation-based tools for constraint programming system. These tools provide to the user the conflicts when it raise during solving process. Our tools simulate constraint additions and/or constraint relaxations without any propagation; it also determine if a given constraint belongs to a conflict and it provide diagnosis tool (e.g. why variable v cannot take value val?). With more user-friendly representation of conflicts and explanations, our proposed tools give better problem understanding to the user. We prooved that the proposed tools are efficient, and while there is no debugging system that allow the user to interact with the solver, our explanation-based tools could be used for many other applications.