Circuit Complexity and Decompositions of Global Constraints

Details Circuit Complexity and Decompositions of Global Constraints Circuit Complexity and Decompositions of Global Constraints

2009-05-22

arxiv.org/abs/0905.3757v1

IJCAI-2009

Computer Science

Artificial Intelligence

Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI-09). Old file included delete

Scientific paper

We show that tools from circuit complexity can be used to study decompositions of global constraints. In particular, we study decompositions of global constraints into conjunctive normal form with the property that unit propagation on the decomposition enforces the same level of consistency as a specialized propagation algorithm. We prove that a constraint propagator has a a polynomial size decomposition if and only if it can be computed by a polynomial size monotone Boolean circuit. Lower bounds on the size of monotone Boolean circuits thus translate to lower bounds on the size of decompositions of global constraints. For instance, we prove that there is no polynomial sized decomposition of the domain consistency propagator for the ALLDIFFERENT constraint.

Affiliated with

Also associated with

No associations

Rating

Circuit Complexity and Decompositions of Global Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Circuit Complexity and Decompositions of Global Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Circuit Complexity and Decompositions of Global Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-498866