Skip to Main content Skip to Navigation
Conference papers

Propagation des contraintes tables souples - étude préliminaire

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Francois Chevallier Connect in order to contact the contributor
Submitted on : Friday, October 4, 2013 - 2:16:37 PM
Last modification on : Wednesday, October 20, 2021 - 9:58:20 AM
Long-term archiving on: : Monday, January 6, 2014 - 10:20:53 AM


Files produced by the author(s)


  • 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⟩



Les métriques sont temporairement indisponibles