Propagation des contraintes tables souples - étude préliminaire - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Propagation des contraintes tables souples - étude préliminaire


WCSP is a framework that has attracted a lot of at- tention during the last decade. In particular, there have been many developments of ltering approaches based on the concept of soft local consistencies such as node consistency (NC), arc consistency (AC), full directional arc consistency (FDAC), existential directional arc consistency (EDAC), virtual arc consistency (VAC) and optimal soft arc consistency (OSAC). Almost all algorithms related to these properties have been introduced for binary weighted constraint networks, and most of the conducted experiments typically include constraint networks involving only binary and ternary constraints. In this paper, we focus on extensional soft constraints of large arity. We propose an algorithm to lter such constraints and embed it in PFC-MRDAC. Despite still being preliminary at this stage, we show it can be used to solve e ciently a new benchmark of Crossword puzzles.
Fichier principal
Vignette du fichier
strFinalJFPC2012.pdf (128.49 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00869908 , version 1 (04-10-2013)


  • HAL Id : hal-00869908 , version 1


Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sebastien Tabary. Propagation des contraintes tables souples - étude préliminaire. 8ièmes Journées Francophones de Programmation par Contraintes (JFPC'12), 2012, Toulouse, France. pp.196-201. ⟨hal-00869908⟩
47 View
61 Download


Gmail Facebook Twitter LinkedIn More