Adaptive Singleton-based Consistencies

Amine Balafrej (1) , Christian Bessiere (1) , Gilles Trombettoni (1) , El Houssine Bouyakhf (2)

1 COCONUT - Agents, Apprentissage, Contraintes
2 LIMIARF - Laboratoire d'Informatique, Mathématiques appliquées, Intelligence Artificielle et Reconnaissance de Formes

Singleton-based consistencies have been shown to dra- matically improve the performance of constraint solvers on some difficult instances. However, they are in gen- eral 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 ver- sion but the computational effort can be significantly reduced. Our experiments show that adaptive Partition- one-AC can obtain significant speed-ups over arc con- sistency and over the full version of partition-one-AC.

Domaines: Intelligence artificielle [cs.AI]

Amine Balafrej, Christian Bessiere, Gilles Trombettoni, El Houssine Bouyakhf. Adaptive Singleton-based Consistencies. AAAI Conference on Artificial Intelligence, Jul 2014, Québec City, Canada. pp.2601-2607. ⟨lirmm-01067213⟩