Abstract
In [Walsh and Stergiou, 1999] enforcing arc consistency (AC) in the dual encoding was shown to strictly dominate enforcing AC on the hidden or GAC on the original problem. We introduce a dual encoding that requires only a small subset of the original constraints to be stored in extension, while the remaining constraints can be stored intensionally. In this paper we present a theoretical comparison between the pruning achieved by enforcing AC on this dual encoding, versus enforcing GAC and dual arc consistency on the standard encoding. We show how the covering based encoding retains the dominance over enforcing GAC on the original problem, while using less space than the existing dual encoding.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bessiere C. Non-binary constraints. In Principles and Practice of Constraint Programming, CP-99, Invited Lecture, 1999.
R. Dechter. Constraint networks. In Stuart C. Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 276–285. Wiley, 1992. Volume 1, second edition.
R. Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Intelligence, 38:353–366, 1989.
Janssen P, Jegou P, Nouguier B., and Vilarem M.C. A filtering process for general constraint satisfaction problems: achieving pair-wise consistency using an associated binary representation. In Proceedings of the IEEE Workshop on Tools for Artificial Intelligence, pages 420–427, Fairfax, USA, 1989.
Mohr R. and Masini G. Good old discrete relaxation. In Proceedings ECAI’88, pages 651–656, 1988.
Kostas Stergiou and Toby Walsh. Encodings of non-binary constraint satisfaction problems. In Proceedings of the 16th National Conference on Artificial Intelligence, pages 163–168, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nagarajan, S., Goodwin, S., Sattar, A., Thornton, J. (2000). On Dual Encodings for Non-binary Constraint Satisfaction Problems. In: Dechter, R. (eds) Principles and Practice of Constraint Programming – CP 2000. CP 2000. Lecture Notes in Computer Science, vol 1894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45349-0_44
Download citation
DOI: https://doi.org/10.1007/3-540-45349-0_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41053-9
Online ISBN: 978-3-540-45349-9
eBook Packages: Springer Book Archive