Relational Consistency by Constraint Filtering - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2010

Relational Consistency by Constraint Filtering

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.
No file

Dates and versions

lirmm-00558309 , version 1 (21-01-2011)

Identifiers

  • HAL Id : lirmm-00558309 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More