A decomposition technique for CSPs using maximal independent sets and its integration with local search

Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005 - Recent Advances in Artifical Intelligence

Volumn , Issue , 2005, Pages 167-174

  Gompert, Joel ^a   Choueiry, Berthe Y ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT GRAPH; CONSTRAINT SATISFACTION PROBLEM (CSP); LOCAL SEARCH;

PROBLEM SOLVING; RANDOM PROCESSES; SEARCH ENGINES; SET THEORY;

CONSTRAINT THEORY;

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

References (17)

1. Achlioptas, D.; Kirousis, L. M.; Kranakis, E.; Krizanc, D.; Molloy, M. S.; and Stamatiou, Y. C. 1997. Random Constraint Satisfaction: A More Accurate Picture. In Proc. of CP, volume 1330 of LNCS, 107-120. Springer.
2. 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 Advances in Artificial Intelligence, LNAI 2256, 50-61. Springer.
3. Bidyuk, B., and Dechter, R. 2004. On Finding Minimal w-Cutset Problem. In Proceedings of the Conference on Uncertainty in AI (UAI 04).
4. Boppana, R., and Halldórsson, M. M. 1990. Approximating maximum independent sets by excluding subgraphs. In 2nd Scandinavian Workshop on Algorithm Theory, volume 447, 13-25.
5. Choueiry, B. Y.; Faltings, B.; and Weigel, R. 1995. Abstraction by Interchangeability in Resource Allocation. In Proceedings of IJCAI, 1694-1701.
6. Dechter, R., and Pearl, J. 1987. The Cycle-Cutset Method for Improving Search Performance in AI Applications. In Third IEEE Conference on AI Applications, 224-230.
7. Dechter, R. 2003. Constraint Processing. Morgan Kaufmann.
8. Freuder, E. C. 1982. A Sufficient Condition for Backtrack-Free Search. JACM 29 (1):24-32.
9. Galinier, P., and Hao, J.-K. 1997. Tabu search for maximal constraint satisfaction problems. In CP 97, 196-208.
10. Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W J Freeman and Co.
11. Gompert, J. M. 2004. Local Search With Maximal Independent Sets. In Proceedings of CP, volume 3258 of LNCS, 795. Springer.
12. Haselböck, A. 1993. Exploiting Interchangeabilities in Constraint Satisfaction Problems. In Proceedings of UCAI, 282-287.
13. Hogg, T. 1996. Refining the phase transition in combinatorial search. Artificial Intelligence 81:127-154.
14. Junker, U. 2004. QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems. AAAI 167-172.
15. Kautz, H.; McAllester, D.; and Selman, B. 1997. Exploiting variable dependency in local search. Poster session abstract, IJCAI.
16. West, D. B. 2001. Introduction to Graph Theory. Prentice Hall, second edition.
17. Williams, R.; Gomes, C. P.; and Selman, B. 2003. Back-doors to typical case complexity. In IJCAI 03.