Maintaining Generalized Arc Consistency on Ad-hoc n-ary Boolean Constraints

Authors:
Kenil C. K. Cheng;Roland H. C. Yap
Affiliations:
National University of Singapore, 3 Science Drive 2, Singapore, {chengchi,ryap}@comp.nus.edu.sg;National University of Singapore, 3 Science Drive 2, Singapore, {chengchi,ryap}@comp.nus.edu.sg
Venue:
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Year:
2006

Citing 6
Cited 9

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Model checking

Model checking
Indexical-Based Solver Learning

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Constrained decision diagrams

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
A fast arc consistency algorithm for n-ary constraints

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Solving set constraint satisfaction problems using ROBDDs

Journal of Artificial Intelligence Research

Optimization of Simple Tabular Reduction for Table Constraints

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Data structures for generalised arc consistency for extensional constraints

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints

Constraints
A constraint store based on multivalued decision diagrams

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Efficient reasoning for nogoods in constraint solvers with BDDs

PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
Generating special-purpose stateless propagators for arbitrary constraints

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
STR2: optimized simple tabular reduction for table constraints

Constraints
Space-Time tradeoffs for the regular constraint

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

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.