Skip to Main content Skip to Navigation
Conference papers

Propagation des contraintes tables souples Etude pr eliminaire

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 directio- nal arc consistency (FDAC), existential directional arc consistency (EDAC), virtual arc consistency (VAC) and optimal soft arc consistency (OSAC). Almost all algo- rithms 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Nicolas Paris Connect in order to contact the contributor
Submitted on : Wednesday, April 10, 2013 - 9:44:33 AM
Last modification on : Wednesday, October 20, 2021 - 9:58:20 AM
Long-term archiving on: : Thursday, July 11, 2013 - 4:11:31 AM


Files produced by the author(s)


  • HAL Id : hal-00810477, version 1



Christophe Lecoutre, Nicolas Paris, Sébastien Tabary, Olivier Roussel. Propagation des contraintes tables souples Etude pr eliminaire. JFPC 2012, May 2012, Toulouse, France. ⟨hal-00810477⟩



Record views


Files downloads