Skip to Main content Skip to Navigation
Conference papers

Propagating Soft Table Constraints

Abstract : WCSP is a framework that has attracted a lot of attention during the last decade. In particular, many filtering approaches have been developed on the concept of equivalence-preserving transformations (cost transfer operations), using the definition of soft local consistencies such as, for example, node consistency, arc consistency, full directional arc consistency, and existential directional arc consistency. Almost all algorithms related to these properties have been introduced for binary weighted constraint networks, and most of the conducted experiments typically include networks with binary and ternary constraints only. In this paper, we focus on extensional soft constraints (of large arity), so-called soft table constraints. We propose an algorithm to enforce a soft version of generalized arc consistency (GAC) on such constraints, by combining both the techniques of cost transfer and simple tabular reduction, the latter dynamically maintaining the list of allowed tuples in constraint tables. On various series of problem instances containing soft table constraints of large arity, we show the practical interest of our approach.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Francois Chevallier Connect in order to contact the contributor
Submitted on : Tuesday, September 24, 2013 - 4:22:21 PM
Last modification on : Wednesday, October 20, 2021 - 9:58:20 AM
Long-term archiving on: : Wednesday, December 25, 2013 - 4:40:11 AM


Files produced by the author(s)


  • HAL Id : hal-00865618, version 1



Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sebastien Tabary. Propagating Soft Table Constraints. 18th International Conference on Principles and Practice of Constraint Programming (CP'12), 2012, Québec, Canada. pp.390-405. ⟨hal-00865618⟩



Les métriques sont temporairement indisponibles