R. R. Baker, F. Dikker, F. Tempelman, and P. M. Wognum, Diagnosing and solving over-determined constraint satisfaction problems, Proceedings of IJCAI'93, pp.276-281, 1993.

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting systematic search by weighting constraints, Proceedings of ECAI'04, pp.146-150, 2004.

R. Bruni, Approximating minimal unsatisfiable subformulae by means of adaptive core search, Discrete Applied Mathematics, vol.130, issue.2, pp.85-100, 2003.
DOI : 10.1016/S0166-218X(02)00399-2

R. Bruni and A. Sassano, Detecting minimaly unsatisfiable subformulae in unsatisfiable SAT instances by means of adaptative core search, Proceedings of SAT'00, 2000.

H. and K. Buning, On subclasses of minimal unsatisfiable formulas, Discrete Applied Mathematics, vol.107, issue.1-3, pp.83-98, 2000.
DOI : 10.1016/S0166-218X(00)00245-6

M. Garcia-de-la-banda, P. J. Stuckey, and J. Wazny, Finding all minimal unsatisfiable subsets, Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming , PPDP '03, 2003.
DOI : 10.1145/888251.888256

J. L. De-siqueira and J. F. Puget, Explanation-based generalisation of failures, Proceedings of ECAI'88, pp.339-344, 1988.

H. Fleischner, O. Kullmann, and S. Szeider, Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference, Theoretical Computer Science, vol.289, issue.1, pp.503-516, 2002.
DOI : 10.1016/S0304-3975(01)00337-1

M. Ginsberg, Dynamic backtracking, Artificial Intelligence, vol.1, pp.25-46, 1993.

B. Han and S. Lee, Deriving minimal conflict sets by CS-trees with mark set in diagnosis from first principles, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.29, issue.2, pp.281-286, 1999.
DOI : 10.1109/3477.752801

T. Hulubei and B. O. Sullivan, Search Heuristics and Heavy-Tailed Behaviour, Proceedings of CP'05, pp.328-342, 2005.
DOI : 10.1007/11564751_26

U. Junker, QuickXplain : conflict detection for abitrary constraint propagation algorithms, Proceedings of IJCAI'01 Workshop on modelling and solving problems with constraints, pp.75-82, 2001.

U. Junker, QuickXplain : preferred explanations and relaxations for over-constrained problems, Proceedings of AAAI'04, pp.167-172, 2004.

N. Jussien and V. Barichard, The palm system : explanation-based constraint programming, Proceedings of TRICS'0O workshop held with CP'00, pp.118-133, 2000.

N. Jussien, R. Debruyne, and P. Boizumault, Maintaining arc-consistency within dynamic backtracking Backjump-based techniques versus conflict-directed heuristics, Proceedings of CP'00 Proceedings of ICTAI'04, pp.249-261, 2000.

I. Lynce and J. P. Marques-silva, On computing minimum unsatisfiable cores, Proceedings of SAT'04, 2004.

A. K. Mackworth, Consistency in networks of relations, Artificial Intelligence, vol.8, issue.1, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-8

J. P. Marques-silva and K. A. Sakallah, Conflict analysis in search algorithms for propositional satisfiability, INESC, 1996.

J. Mauss and M. Tatar, Computing minimal conflicts for rich constraint languages, Proceedings of ECAI'02, pp.151-155, 2002.

Y. Oh, M. N. Mneimneh, Z. S. Andraus, K. A. Sakallah, and I. L. Markov, AMUSE, Proceedings of the 41st annual conference on Design automation , DAC '04, pp.518-523, 2004.
DOI : 10.1145/996566.996710

C. H. Papadimitriou and M. Yannakakis, The complexity of facets (and some facets of complexity), Journal of Computer and System Sciences, vol.28, issue.2, pp.244-259, 1984.
DOI : 10.1016/0022-0000(84)90068-0

C. H. Papadimitriou and D. Wolfe, The complexity of facets resolved, Journal of Computer and System Sciences, vol.37, issue.1, pp.2-13, 1988.
DOI : 10.1016/0022-0000(88)90042-6

T. Petit, C. Bessière, and J. C. Régin, A general conflict-set based framework for partial constraint satisfaction, Proceedings of SOFT'03 workshop held with CP'03, 2003.
URL : https://hal.archives-ouvertes.fr/lirmm-00269780

P. Prosser, HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM, Computational Intelligence, vol.1, issue.4, pp.268-299, 1993.
DOI : 10.1016/0004-3702(77)90007-8

D. Sabin and E. Freuder, Contradicting conventional wisdom in constraint satisfaction, Proceedings of CP'94, pp.10-20, 1994.
DOI : 10.1007/3-540-58601-6_86

M. C. Silaghi and B. Faltings, Asynchronous aggregation and consistency in distributed constraint satisfaction, Artificial Intelligence, vol.161, issue.1-2, pp.25-53, 2005.
DOI : 10.1016/j.artint.2004.10.003
URL : http://doi.org/10.1016/j.artint.2004.10.003

L. Zhang and S. Malik, Extracting small unsatisfiable cores from unsatisfiable boolean formulas, Proceedings of SAT'03, 2003.