Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Maintaining reversible DAC for Max-CSP
Artificial Intelligence
Partition-Based Lower Bound for Max-CSP
Constraints
Node and arc consistency in weighted CSP
Eighteenth national conference on Artificial intelligence
Reduction operations in fuzzy or valued constraint satisfaction
Fuzzy Sets and Systems - Optimisation and decision
Arc consistency for soft constraints
Artificial Intelligence
Solving weighted CSP by maintaining arc consistency
Artificial Intelligence
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Artificial Intelligence
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Existential arc consistency: getting closer to full arc consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Towards efficient consistency enforcement for global constraints in weighted constraint satisfaction
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Soft arc consistency revisited
Artificial Intelligence
Pairwise decomposition for combinatorial optimization in graphical models
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Hi-index | 0.00 |
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.