A Refutation Approach to Neighborhood Interchangeability in CSPs

The concept of Interchangeability was developed to deal with redundancy of values in the same domain. Conventional algorithms for detecting Neighborhood Interchangeability work by gradually establishing relationships between values from scratch. We propose the opposite strategy: start by assuming everything is interchangeable and disprove certain relations as more information arises. Our refutation-based algorithms have much better lower bounds whereas the lower bound and the upper bound of the traditional algorithms are asymptotically identical.

• Type: Conference
• Year: 2008
• Where: AUSAI
• Authors: Chavalit Likitvivatanavong, Roland H. C. Yap
• Keywords: Artificial Intelligence, AUSAI 2008, Conventional Algorithms, Lower Bound, Neighborhood Interchangeability Work