Abstract
We had claimed that arc-consistency is preserved in a constraint reformulation relying on functional dependencies (Theorem 2 of Cambazard and O’Sullivan Constraints 13(3):385–406 (2008)). We show that the statement of this theorem was too strong by providing a counter-example. However, the result holds for dependencies between pairs of variables, and more generally in restricted settings.
Similar content being viewed by others
References
Bessière, C., & Régin, J.-C. (1997). Arc consistency for general constraint networks: Preliminary results. In IJCAI (1) (pp. 398–404).
Cambazard, H., & O’Sullivan, B. (2008). Reformulating table constraints using functional dependencies - An application to explanation generation. Constraints, 13(3), 385–406.
Huhtala, Y., Kärkkäinen, J., Porkka, P., & Toivonen, H. (1999). Tane: An efficient algorithm for discovering functional and approximate dependencies. Computer Journalen, 42(2), 100–111.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by Science Foundation Ireland (Grant Number 05/IN/I886).
Rights and permissions
About this article
Cite this article
Cambazard, H., O’Sullivan, B. Erratum to “Reformulating table constraints using functional dependencies—an application to explanation generation”. Constraints 15, 145–147 (2010). https://doi.org/10.1007/s10601-009-9081-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10601-009-9081-4