BibTeX
@MISC{_maintaininggeneralized,
author = {},
title = {Maintaining Generalized Arc Consistency on Ad-hoc n-ary Boolean Constraints},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Binary decision diagrams (BDDs) can compactly represent ad-hoc n-ary Boolean constraints. However, there is no generalized 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 memory and time than the case constraint when dealing with ad-hoc Boolean constraints. This becomes important as the size of the adhoc constraints becomes large. 1
Keyphrases
ad-hoc n-ary boolean constraint generalized arc consistency adhoc constraint binary decision diagram global case constraint ad-hoc constraint sicstus prolog non-boolean domain empirical result ad-hoc boolean constraint bdd constraint new bdd-based global constraint bddc new gac algorithm case constraint
