Circuit Complexity and Decompositions of Global Constraints
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 412-417.
Abstract
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 alldiff constraint.Christian Bessiere, George Katsirelos, Nina Narodytska, Toby Walsh
@inproceedings{ijcai2009p76,
title = {Circuit Complexity and Decompositions of Global Constraints},
author = {Bessiere, Christian and Katsirelos, George and Narodytska, Nina and Walsh, Toby},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {412--417},
year = {2009},
url = {https://ijcai.org/proceedings/2009/76},
}
TY - CPAPER TI - Circuit Complexity and Decompositions of Global Constraints AU - Bessiere, Christian AU - Katsirelos, George AU - Narodytska, Nina AU - Walsh, Toby T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 412 EP - 417 UR - https://ijcai.org/proceedings/2009/76 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
