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. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Likitvivatanavong, C., & Yap, R. H. C. (2008). A refutation approach to neighborhood interchangeability in CSPs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5360 LNAI, pp. 93–103). https://doi.org/10.1007/978-3-540-89378-3_10
Mendeley helps you to discover research relevant for your work.