{"type":"ScholarlyArticle","title":"Optimizing Simple Tabular Reduction with a Bitwise Representation","authors":[{"name":"Ruiwei Wang","slug":"ruiwei-wang","given":"Ruiwei","family":"Wang","affiliation":""},{"name":"Wei Xia","slug":"wei-xia","given":"Wei","family":"Xia","affiliation":""},{"name":"Roland H. C. Yap","slug":"roland-h-c-yap","given":"Roland H.C.","family":"Yap","affiliation":""},{"name":"Zhanshan Li","slug":"zhanshan-li","given":"Zhanshan","family":"Li","affiliation":""}],"abstract":"Maintaining Generalized Arc Consistency (GAC) during search is considered an efficient way to solve non-binary constraint satisfaction problems. Bit-based representations have been used effectively in Arc Consistency algorithms. We propose STRbit, a GAC algorithm, based on simple tabular reduction (STR) using an efficient bit vector support data structure. STRbit is extended to deal with compression of the underlying constraint with c-tuples. Experimental evaluation show our algorithms are faster than many algorithms (STR2, STR2-C, STR3, STR3-C and MDDc) across a variety of benchmarks except for problems with small tables where complex data structures do not payoff.","doi":null,"url":"https://ijcai.org/proceedings/2016/117","pdf":"https://ijcai.org/proceedings/2016/0117.pdf","markdown":"https://ijcai.org/proceedings/2016/117.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/117","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":117,"pages":{"first":787,"last":794},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}