An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints
From MaRDI portal
Publication:968351
DOI10.1007/s10601-009-9087-yzbMath1204.68188MaRDI QIDQ968351
Roland H. C. Yap, Kenil C. K. Cheng
Publication date: 5 May 2010
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-009-9087-y
global constraint; ad hoc constraint; generalized arc consistency; multi-valued decision diagram; negative constraint; positive constraint; table constraint
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
STR2: optimized simple tabular reduction for table constraints, Generating custom propagators for arbitrary constraints
Uses Software
Cites Work
- Applying ad-hoc global constraints with the case constraint to still-life
- Introducing global constraints in CHIP
- Partition search for non-binary constraint satisfaction
- An optimal coarse-grained arc consistency algorithm
- Generalized Arc Consistency for Positive Table Constraints
- Revisiting the Sequence Constraint
- Graph-Based Algorithms for Boolean Function Manipulation
- Improving the variable ordering of OBDDs is NP-complete
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
- Unnamed Item
- Unnamed Item
- Unnamed Item