How the level of interchangeability embedded in a finite constraint satisfaction problem affects the performance of search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2256, Issue , 2001, Pages 50-61

  Beckwith, Amy M ^a   Choueiry, Berthe Y ^a   Zou, Hui ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

ALL SOLUTIONS; BUNDLING STRATEGIES; DYNAMIC ORDER; FINITE CONSTRAINTS; FORWARD CHECKING; STATIC ORDERING;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 32844474319     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45656-2_5     Document Type: Conference Paper

References (14)

1. 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.
2. 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-03. http://consystlab.unl.edu/CSL-01-03.ps, University of Nebraska-Lincoln, 2001.
3. Cynthia A. Brown, Larry Finkelstein, and Paul W. Purdom 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.
4. 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.
5. 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.
6. 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/KSLAbstracts/KSL-98-24.html.
7. Eugene C. Freuder. Eliminating Interchangeable Values in Constraint Satisfaction Problems. In Proc. of AAAI-91, pages 227–233, Anaheim, CA, 1991.
8. 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.
9. Pieter Andreas Geelen. Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems. In Proc. of the 10 th ECAI, pages 31–35, Vienna, Austria, 1992.
10. Robert M. Haralick and Gordon L. Elliott. Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence, 14:263–313, 1980.
11. Alois Haselböck. Exploiting Interchangeabilities in Constraint Satisfaction Problems. In Proc. of the 13 th IJCAI, pages 282–287, Chambéry, France, 1993.
12. Alan K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8:99–118, 1977.
13. 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.
14. 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.