Circuit Complexity and Decompositions of Global Constraints

Simple item page
dc.creatorBessiere, Christian
dc.creatorKatsirelos, George
dc.creatorNarodytska, Nina
dc.creatorWalsh, Toby
dc.date2009-05-22
dc.date.accessioned2026-07-07T13:17:44Z
dc.date.available2026-07-07T13:17:44Z
dc.descriptionWe 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.
dc.descriptionProceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI-09). Old file included deleted
dc.identifierhttps://arxiv.org/abs/0905.3757
dc.identifierhttp://arxiv.org/abs/0905.3757
dc.identifierIJCAI-2009
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/231212
dc.subjectArtificial Intelligence
dc.subjectComputational Complexity
dc.subjectI.2.4
dc.titleCircuit Complexity and Decompositions of Global Constraints
dc.typetext

Files

Collections

arXiv