Skip to Main content Skip to Navigation
Conference papers

A Probabilistic Model to Count Solutions on the alldifferent Constraint

Abstract : This article presents two probabilistic models for the alldifferent constraint. We are interested in studying the combinatorial structure of the alldifferent constraint. More specifically, we are interested in the existence of solutions for an instance of alldifferent and to count them. Such informations can be used in search heuristics. From this probabilistic approach, we show how to compute some estimators of the number of solutions and we use them in a search heuristics inspired by Counting-Based Search heuristics.
Document type :
Conference papers
Complete list of metadata
Contributor : IMT Mines Albi IMT Mines Albi Connect in order to contact the contributor
Submitted on : Thursday, November 15, 2018 - 2:17:46 PM
Last modification on : Friday, August 5, 2022 - 2:54:52 PM


  • HAL Id : hal-01923767, version 1


Giovanni Lo Bianco, Charlotte Truchet, Xavier Lorca, Vlady Ravelomanana. A Probabilistic Model to Count Solutions on the alldifferent Constraint. CP 2018 - The 24th International Conference on Principles and Practice of Constraints Programming, Aug 2018, Lille, France. 9 p. ⟨hal-01923767⟩



Record views