By Topic

Enhancing Neighbourhood Substitutability Thanks to Singleton Arc Consistency

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D'Almeida, D. ; CRIL-CNRS, Univ. d''Artois, Lens, France ; Sais, L.

In this paper, a semantic generalization of neighbourhood substitutability is presented. Instead of the syntactical concept of supports, our generalization originally exploits a new semantic measure based on single arc-consistency (SAC) checking. This generalization is then exploited in two different ways. Firstly, a new pretreatment of constraints networks is proposed. Secondly, as SAC is a basic operation in backtrack search-based algorithms like MAC, we show that our generalization can be easily applied dynamically. The experimental results of our approach show interesting improvements on some classes of CSP instances and demonstrate the feasibility of the dynamic integration of our generalized neighbourhood substitutability.

Published in:

Tools with Artificial Intelligence, 2009. ICTAI '09. 21st International Conference on

Date of Conference:

2-4 Nov. 2009