Please use this identifier to cite or link to this item:
Title: Maintaining generalized arc consistency on Ad-hoc n-ary boolean constraints
Authors: Cheng, K.C.K.
Yap, R.H.C. 
Issue Date: 2006
Citation: Cheng, K.C.K.,Yap, R.H.C. (2006). Maintaining generalized arc consistency on Ad-hoc n-ary boolean constraints. Frontiers in Artificial Intelligence and Applications 141 : 78-82. ScholarBank@NUS Repository.
Abstract: Binary decision diagrams (BDDs) can compactly rep- resent ad-hoc n-ary Boolean constraints. However, there is no gen- eralized arc consistency (GAC) algorithm which exploit BDDs. For example, the global case constraint by SICStus Prolog for ad-hoc constraints is designed for non-Boolean domains. In this paper, we introduce a new GAC algorithm, bddc, for BDD constraints. Our empirical results demonstrate the advantages of a new BDD-based global constraint-bddc is more efficient both in terms of mem- ory and time than the case constraint when dealing with ad-hoc Boolean constraints. This becomes important as the size of the ad- hoc constraints becomes large. © 2006 The authors.
Source Title: Frontiers in Artificial Intelligence and Applications
ISBN: 9781586036423
ISSN: 09226389
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Mar 29, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.