Abstract
We investigate how the performance of search for solving finite constraint satisfaction problems (CSPs) is affected by the level of interchangeability embedded in the problem. First, we describe a generator of random CSPs that allows us to control the level of interchangeability in an instance. Then we study how the varying level of interchangeability affects the performance of search for finding one solution and all solutions to the CSP. We conduct experiments using forward-checking search, extended with static and dynamic ordering heuristics in combination with non-bundling, static, and dynamic bundling strategies. We demonstrate that: (1) While the performance of bundling decreases in general with decreasing interchangeability, this effect is muted when finding a first solution. (2) Dynamic ordering strategies are significantly more resistant to this degradation than static ordering. (3) Dynamic bundling strategies perform overall significantly better than static bundling strategies. Even when finding one solution, the size of the bundles yielded by dynamic bundling is large and less sensitive to the level of interchangeability. (4) The combination of dynamic ordering heuristics with dynamic bundling is advantageous. We conclude that this combination, in addition to yielding the best results, is the least sensitive to the level of interchangeability, and thus, indeed is superior to other searches.
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
Fahiem Bacchus and P. van Run. Dynamic Variable Ordering in CSPs. In Principles and Practice of Constraint Programming, CP’95. Lecture Notes in Artificial Intelligence 976, pages 258–275. Springer Verlag, 1995.
Amy M. Beckwith and Berthe Y. Choueiry. Effects of Dynamic Ordering and Bundling on the Solution Space of Finite Constraint Satisfaction Problems. Technical Report CSL-01-03http://consystlab.unl.edu/CSL-01-03.ps, University of Nebraska-Lincoln, 2001.
Cynthia A. Brown, Larry Finkelstein, and Paul W. Purdom, Jr. Backtrack Searching in the Presence of Symmetry. In T. Mora, editor, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pages 99–110. Springer-Verlag, 1988.
Berthe Y. Choueiry and Amy M. Beckwith. On Finding the First Solution Bundle in Finite Constraint Satisfaction Problems. Technical Report CSL-01-03. http://consystlab.unl.edu/CSL-01-04.ps, University of Nebraska-Lincoln, 2001.
Berthe Y. Choueiry and Amy M. Beckwith. Techniques for Bundling the Solution Space of Finite Constraint Satisfaction Problems. Technical Report CSL-01-02. http://consystlab.unl.edu/CSL-01-02.ps, University of Nebraska-Lincoln, 2001.
Berthe Y. Choueiry and Guevara Noubir. On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems. In Proc. of AAAI-98, pages 326–333, Madison, Wisconsin, 1998. Revised version KSL-98-24, http://ksl-web.stanford.edu/KSL_Abstracts/KSL-98-24.html.
Eugene C. Freuder. Eliminating Interchangeable Values in Constraint Satisfaction Problems. In Proc. of AAAI-91, pages 227–233, Anaheim, CA, 1991.
Eugene C. Freuder and Daniel Sabin. Interchangeability Supports Abstraction and Reformulation for Multi-Dimensional Constraint Satisfaction. In Proc. of AAAI-97, pages 191–196, Providence, Rhode Island, 1997.
Pieter Andreas Geelen. Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems. In Proc. of the 10 th ECAI, pages 31–35, Vienna, Austria, 1992.
Robert M. Haralick and Gordon L. Elliott. Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence, 14:263–313, 1980.
Alois Haselböck. Exploiting Interchangeabilities in Constraint Satisfaction Problems. In Proc. of the 13 th IJCAI, pages 282–287, Chambéry, France, 1993.
Alan K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8:99–118, 1977.
Daniel Sabin and Eugene C. Freuder. Contradicting Conventional Wisdom in Constraint Satisfaction. In Proc. of the 11 th ECAI, pages 125–129, Amsterdam, The Netherlands, 1994.
Hui Zou, Amy M. Beckwith, and Berthe Y. Choueiry. A Generator of Random Instances of Binary Finite Constraint Satisfaction Problems with Controllable Levels of Interchangeability. Technical Report CSL-01-01. http://consystlab.unl.edu/CSL-01-01.doc, University of Nebraska-Lincoln, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beckwith, A.M., Choueiry, B.Y., Zou, H. (2001). How the Level of Interchangeability Embedded in a Finite Constraint Satisfaction Problem Affects the Performance of Search. In: Stumptner, M., Corbett, D., Brooks, M. (eds) AI 2001: Advances in Artificial Intelligence. AI 2001. Lecture Notes in Computer Science(), vol 2256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45656-2_5
Download citation
DOI: https://doi.org/10.1007/3-540-45656-2_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42960-9
Online ISBN: 978-3-540-45656-8
eBook Packages: Springer Book Archive