An explanation-based tools for debugging constraint satisfaction problems

Applied Soft Computing Journal

Volumn 8, Issue 4, 2008, Pages 1400-1406

  Ouis, Samir ^a   Tounsi, Mohamed ^b  

^a AL IMAM MOHAMMAD IBN SAUD ISLAMIC UNIVERSITY IMSIU   (Saudi Arabia)

^b PRINCE SULTAN UNIVERSITY   (Saudi Arabia)

Author keywords

Conflicts; Constraint programming; Debugging; Explanations; Solver

Indexed keywords

COMPUTER PROGRAMMING;

CONFLICTS; CONSTRAINT PROGRAMMING; CONSTRAINT SATISFACTION PROBLEMS; DEBUGGING; EXPLANATIONS; SOLVER;

CONSTRAINT THEORY;

EID: 50149098394     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2007.10.019     Document Type: Article

References (21)

1. A. Aggoun, M. Dincbas, A. Herold, H. Simonis, P. Van Hentenryck, The CHIP system, Technical Report TR-LP-24, ECRC, Munich, Germany, 1987.
2. F. Laburthe, CHOCO: implementing a CP kernel, in: CP00 Post Conference Workshop on Techniques for Implementing Constraint Programming Systems (TRICS), Singapore, 2000.
3. Diaz D., and Codognet P. The GNU prolog system and its implementation. ACM Symposium on Applied Computing. Villa Olmo, Como, Italy (2000)
4. Ilog: Solver Reference Manual, 2001.
5. Junker U. QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems. Proceedings AAAI'04 (2004)
6. Freuder E.C., Likitvivatanavong C., Moretti M., Rossi F., and Wallace R.J. Computing explanations and implications in preference-based configurators. Proceeding of Recent Advances in Constraints (2003)
7. Callaghan B.O., Sullivan B.O., and Freuder E.C. Generating corrective explanations for interactive constraint satisfaction. Proceedings of CP-2005. Springer LNCS (2005)
8. Bessière C. Arc consistency in dynamic constraint satisfaction problems. Proceedings AAAI'91 (1991)
9. Bayardo R.J., and Miranker Jr. D.P. A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem. AAAI'96 (1996)
10. Schiex T., and Verfaillie G. Nogood recording for static and dynamic constraint satisfaction problems. Int. J. Artif. Intell. Tools 3 (1994) 187-207
11. Freuder E.,C., and Wallace R.J. Explanations for whom?. Workshop on User Interaction in Constraint Satisfaction Constraint Programming Systems, A Post-conference Workshop of CP 2001. Paphos, November (2001)
12. Stallman R.M., and Sussman G.J. Forward reasoning and dependency directed backtracking in a system for computer-aided circuit analysis,. Artif. Intell. 9 (1977) 135-196
13. Ginsberg M. Dynamic backtracking. J. Artif. Intell. Res. 1 (1993) 25-46
14. N. Jussien, R. Debruyne, P. Boizumault, Maintaining arc-consistency within dynamic backtracking, in: Principles and Practice of Constraint Programming (CP 2000), Lecture Notes in Computer Science, vol. 1894, Springer-Verlag, Singapore, 2000, pp. 249-261.
15. M. Ginsberg, D. McAllester, GSAT and dynamic backtracking, in: A. Borning (Ed.), Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 874, Springer, 1994 (PPCP'94: Second International Workshop, Orcas Island, Seattle, USA).
16. Bliek C. Generalizing partial order and dynamic backtracking. Proceedings of AAAI (1998)
17. P. Prosser, MAC-CBJ: maintaining arc-consistency with conflict-directed backjumping, Research Report 95/177, Department of Computer Science, University of Strathclyde, 1995.
18. F. Glover, M. Laguna, in: C. Reeves, Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publishing, 1993.
19. Schiex T., and Verfaillie G. Nogood recording for static and dynamic CSP. 5th IEEE International Conference on Tools with Artificial Intelligence. Boston, MA (1993) 48-55
20. Dechter R. Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artif. Intell. 41 (1990) 273-312
21. Borning A., Maher M., Martindale A., and Wilson M. Constraint hierarchies and logic programming. In: Levi G., and Martelli M. (Eds). ICLP'89: Proceedings 6th International Conference on Logic Programming. Lisbon, Portugal, MIT Press (1989) 149-164