Neighborhood Interchangeability and dynamic bundling for non-binary finite CSPs

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2005, Pages 397-404

  Lal, Anagh ^a   Choueiry, Berthe Y ^a   Freuder, Eugene C ^b  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEM (CSP); NEIGHBORHOOD INTERCHANGEABILITY (NI);

ALGORITHMS; COMPUTATION THEORY; CONSTRAINT THEORY; COSTS;

ARTIFICIAL INTELLIGENCE;

EID: 29344449176     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Beckwith, A.M.; Choueiry, B.Y.; and Zou, H. 2001. How the Level of Interchangeability Embedded in a Finite Constraint Satisfaction Problem Affects the Performance of Search. In Australian Joint Conf. on AI, LNAI 2256. 50-61.
2. Benson, B.W. and Freuder, E.C. 1992. Interchangeability Preprocessing Can Improve Forward Checking Search. In Proc. of ECAI. 28-30.
3. Bessière, C.; Meseguer, P.; Freuder, E.C.; and Larrosa, J. 2002. On Forward Checking for Non-binary Constraint Satisfaction. Artificial Intelligence 141 (1-2):205-224.
4. Cheeseman, P.; Kanefsky, B.; and Taylor, W.M. 1991. Where the Really Hard Problems Are. In Proc. of IJCAI. 331-337.
5. Choueiry, B.Y. and Davis, A.M. 2002. Dynamic Bundling: Less Effort for More Solutions. In Proc. of SARA, volume 2371 of LNAI. Springer. 64-82.
6. Freuder, E.C. and Sabin, D. 1997. Interchangeability Supports Abstraction and Reformulation for Multi-Dimensional Constraint Satisfaction. In Proc. of AAAI. 191-196.
7. Freuder, E.C. 1991. Eliminating Interchangeable Values in Constraint Satisfaction Problems. In Proc. of AAAI. 227-233.
8. Ginsberg, M.L.; Parkes, A.J.; and Roy, A. 1998. Supermodels and Robustness. In Proc. of AAAI. 334-339.
9. Glaisher, J.W.L. 1874. On the Problem of the Eight Queens. Philosophical Magazine, series 4 48:457-467.
10. Haselböck, A. 1993. Exploiting Interchangeabilities in Constraint Satisfaction Problems. In Proc. of UCAI. 282-287.
11. Hubbe, P.D. and Freuder, E.C. 1989. An Efficient Cross Product Representation of the Constraint Satisfaction Problem Search Space. In Proc. of AAAI. 421-427.
12. Lal, A. and Choueiry, B.Y. 2004. Constraint Processing Techniques for Improving Join Computation: A Proof of Concept. In Proc. of the Symposium on Constraint Databases, LNCS 3074. 149-167.
13. Lal, Anagh 2005. Neighborhood Interchangeability for Non-Binary CSPs & Application to Databases. Master's thesis, Constraint Systems Laboratory, Department of Computer Science & Engineering, University of Nebraska-Lincoln, Lincoln, NE.
14. Lesaint, D. 1994. Maximal Sets of Solutions for Constraint Satisfaction Problems. In Proc. of ECAI. 110-114.
15. Neagu, N. and Faltings, B. 2001. Exploiting Interchangeabilities for Case Adaptation. In International Conference on Case-Based Reasoning (ICCBR 01), volume 2080 of LNCS. Springer. 422-436.
16. Petcu, A. and Faltings, B. 2003. Applying Interchangeabilily Techniques to the Distributed Breakout Algorithm. In Proc. of IJCAI. 1381-1382.
17. Purvis, L. 2002. A Genetic Algorithm Approach to Automated Custom Document Assembly. In Proc. of the Intelligent Systems Design and Applications Conference. 131-136.
18. Rees, D.G. 2001. Essential Statistics. Chapman and Hall.
19. Sabin, D. and Freuder, E.C. 1994. Contradicting Conventional Wisdom in Constraint Satisfaction. In Proc. of ECAI. 125-129.
20. SymCon, 2004. The 4th International Workshop on Symmetry and Constraint Satisfaction Problems. http://www.dis.uu.se/SymCon04/.
21. Weil, G. and Heus, K. 1998. Eliminating Interchangeable Values in the Nurse Scheduling Problem Formulated as a Constraint Satisfaction Problem. In Workshop on Constraint-Based Reasoning (FLAIRS 95).