Please use this identifier to cite or link to this item:
|Title:||A refutation approach to neighborhood interchangeability in CSPs||Authors:||Likitvivatanavong, C.
|Issue Date:||2008||Citation:||Likitvivatanavong, C.,Yap, R.H.C. (2008). A refutation approach to neighborhood interchangeability in CSPs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5360 LNAI : 93-103. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-540-89378-3_10||Abstract:||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.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/41762||ISBN:||3540893776||ISSN:||03029743||DOI:||10.1007/978-3-540-89378-3_10|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 14, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.