Random Constraint Satisfaction: a More Accurate Picture, Proceedings CP'97, pp.107-120, 1997. ,

A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem, Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pp.558-562, 1996. ,

Fifty-five solvers in vancouver: The sat 2004 competition, Proceedings of SAT'04, 2004. ,

MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems, Proceedings CP'96, pp.61-75, 1996. ,

Measuring Search Trees, Proceedings ECAI'04 Workshop on Modelling and Solving Problems with Constraints, 2004. ,

Formal Models of Heavy-tailed Behavior in Combinatorial Search, Proceedings CP'01, pp.408-421, 2001. ,

Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition', Artificial Intelligence, vol.41, issue.3, pp.273-312, 1990. ,

, Constraint Processing, 2003.

Summarizing CSP Hardness with Continuous Probability Distributions, AAAI-97, pp.327-333, 1997. ,

A General Backtrack Algorithm that Eliminates Most Redundant Tests, Proceedings IJCAI'77, p.447, 1977. ,

Easy Problems are Sometimes Hard, Artificial Intelligence, vol.70, pp.335-345, 1994. ,

Heavy-tailed Distributions in Combinatorial Search, Proceedings CP'97, pp.121-135, 1997. ,

Heavy-tailed phenomena in satisfiability and constraint satisfaction problems, J. of Automated Reasoning, vol.24, issue.1-2, pp.67-100, 2000. ,

Increasing Tree Search Efficiency for Constraint Satisfaction Problems, Artificial Intelligence, vol.14, pp.263-313, 1980. ,

, Phase Transitions and Search Problems'. Artificial Intelligence, vol.81, issue.1-2, pp.1-15, 1996.

The Hardest Constraint Problems: a Double Phase Transition, Artificial Intelligence, vol.69, pp.359-377, 1994. ,

, Stochastic Local Search: Foundations and Applications, 2004.

A Bayesian Approach to Tackling Hard Computational Problems, Proceedings of the Seventeenth Conference On Uncertainty in Artificial Intelligence (UAI-01), 2001. ,

Dynamic Restart Policies, Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02), 2002. ,

Heuristics Based on Unit Propagation for Satisfiability Problems, Proceedings IJCAI'97, pp.366-371, 1997. ,

GRASP -A search algorithm for propositional satisfiability, IEEE Transactions on Computers, vol.48, issue.5, pp.506-521, 1999. ,

Arc and Path Consistency Revisited, Artificial Intelligence, vol.28, pp.225-233, 1986. ,

URL : https://hal.archives-ouvertes.fr/inria-00548487

Chaff: Engineering an Efficient SAT Solver, Proceedings of the 39th Design Automation Conference, 2001. ,

, Constraint Satisfaction Algorithms'. Computational Intelligence, vol.5, pp.188-224, 1989.

Domain Filtering Can Degrade Intelligent Backtrack Search, Proceedings IJCAI'93, pp.262-267, 1993. ,

Hybrid algorithms for the constraint satisfaction problem', Computational Intelligence, vol.9, issue.3, pp.268-299, 1993. ,

Resolution versus Search: Two Strategies for SAT, J. of Automated Reasoning, vol.24, issue.1/2, pp.225-275, 2000. ,

Contradicting Conventional Wisdom in Constraint Satisfaction, Proceedings PPCP'94, 1994. ,

Finite-Size Scaling of the Computational Cost of Systematic Search', Artificial Intelligence, vol.81, issue.1-2, pp.273-295, 1996. ,

Sparse Constraint Graphs and Exceptionally Hard Problems, Proceedings IJCAI'95. Montral, pp.646-651, 1995. ,

Modelling Exceptionally Hard Constraint Satisfaction Problems, Proceedings CP'97, pp.182-195, 1997. ,

SAT vs CSP, Proceedings CP'00, pp.441-456, 2000. ,

Backdoors to Typical Case Complexity, 2003. ,

On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search, Proceedings of Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT-03), 2003. ,

Exact Phase Transition in Random Constraint Satisfaction Problems, vol.12, pp.93-103, 2000. ,