Skip to Main content Skip to Navigation
Conference papers

Relational Consistency by Constraint Filtering

Shant Karakashian 1 Robert J. Woodward 1 Berthe Y. Choueiry 1 Christian Bessière 2
2 COCONUT - Agents, Apprentissage, Contraintes
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Sat- isfaction Problem (CSP). This algorithm operates by filtering the constraint while leaving the topology of the graph unchanged. We study the resulting relational consistency property and compare it to existing ones. We evaluate the effectiveness of our algorithm in a search procedure for solving CSPs and demonstrate the appli- cability, effectiveness, and usefulness of enforcing high levels of consistency.
Document type :
Conference papers
Complete list of metadata
Contributor : Martine Peridier <>
Submitted on : Friday, January 21, 2011 - 2:42:45 PM
Last modification on : Monday, January 11, 2021 - 5:24:13 PM


  • HAL Id : lirmm-00558309, version 1



Shant Karakashian, Robert J. Woodward, Berthe Y. Choueiry, Christian Bessière. Relational Consistency by Constraint Filtering. SAC: Symposium on Applied Computing, Mar 2010, Sierre, Switzerland. pp.2073-2074. ⟨lirmm-00558309⟩



Record views