Adaptive Singleton-Based Consistencies


  • Amine Balafrej University of Montpellier / University Mohammed V Agdal
  • Christian Bessiere University of Montpellier
  • El Houssine Bouyakhf University Mohammed V Agdal
  • Gilles Trombettoni University of Montpellier



constraint programming, Consistencies, Adaptive


Singleton-based consistencies have been shown to dramatically improve the performance of constraint solvers on some difficult instances. However, they are in general too expensive to be applied exhaustively during the whole search. In this paper, we focus on partition-one-AC, a singleton-based consistency which, as opposed to singleton arc consistency, is able to prune values on all variables when it performs singleton tests on one of them. We propose adaptive variants of partition-one-AC that do not necessarily run until having proved the fixpoint. The pruning can be weaker than the full version but the computational effort can be significantly reduced. Our experiments show that adaptive Partition-one-AC can obtain significant speed-ups over arc consistency and over the full version of partition-one-AC.




How to Cite

Balafrej, A., Bessiere, C., Bouyakhf, E. H., & Trombettoni, G. (2014). Adaptive Singleton-Based Consistencies. Proceedings of the AAAI Conference on Artificial Intelligence, 28(1).



Main Track: Search and Constraint Satisfaction