Neighborhood Interchangeability and Dynamic Bundling for Non-binary CSPs

Authors

Anagh Lal, University of Nebraska-LincolnFollow
Berthe Y. Choueiry, University of Nebraska-LincolnFollow
Eugene C. Freuder, University College CorkFollow

Date of this Version

2005

Comments

Lal, Choueiry & Freuder in Proceedings of the National Conference on Artificial Intelligence (AAAI 2005, Pittsburgh, Pennsylvania). Pages 397-404. Copyright 2005, AAAI. Used by permission.

Abstract

1. Interchangeability: An algorithm for computing interchangeability in non-binary CSPs.

2. Dynamic bundling: Integration of the above with backtrack search for solving non-binary CSPs.

3. Experiments demonstrating the benefits of dynamic bundling

·Finding multiple, robust solutions.

·Decreasing computational cost of search.