A dynamic programming approach, IJCAI'05 Fifth Workshop on Modelling and Solving Problems with Constraints, 2005. ,
Algorithm 457: finding all cliques of an undirected graph, Communications of the ACM, vol.16, issue.9, pp.575-577, 1973. ,
DOI : 10.1145/362342.362367
Identifying and exploiting problem structures using explanation-based constraint programming, Proceedings (CP-AI-OR'05), pp.94-109, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00869105
Explanationbased generalisation of failures, Proceedings (ECAI'88), pp.339-344, 1988. ,
Dynamic programming to minimize the maximum number of open stacks, IJCAI'05 Fifth Workshop on Modelling and Solving Problems with Constraints, 2005. ,
QUICKXPLAIN : Conflict detection for arbitrary constraint propagation algorithms, IJCAI'01 Workshop on Modelling and Solving problems with constraints, 2001. ,
Generalized nogoods in csps, National Conference on Artificial Intelligence (AAAI-2005), pp.390-396, 2005. ,
Sorting and Searching, volume 3 of The Art of Computer Programming, pp.492-512, 1997. ,
Chaff, Proceedings of the 38th conference on Design automation , DAC '01, 2001. ,
DOI : 10.1145/378239.379017
NOGOOD RECORDING FOR STATIC AND DYNAMIC CONSTRAINT SATISFACTION PROBLEMS, International Journal on Artificial Intelligence Tools, vol.03, issue.02, pp.187-207, 1994. ,
DOI : 10.1142/S0218213094000108
A constraint programming approach to the min-stack problem, IJ- CAI'05 Fifth Workshop on Modelling and Solving Problems with Constraints, 2005. ,
Constraint modelling challenge, IJCAI'05 Fifth Workshop on Modelling and Solving Problems with Constraints, 2005. ,