Visualization for structured constraint satisfaction problems

AAAI Workshop - Technical Report

Volumn WS-10-07, Issue , 2010, Pages 61-68

  Li, Xingjian ^a   Epstein, Susan L ^a,b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b City College of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL PROBLEMS; CONSTRAINT SATISFACTION PROBLEMS; REAL-WORLD PROBLEM; SEARCH ALGORITHMS;

MATHEMATICAL MODELS;

VISUALIZATION;

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

References (18)

1. Berghen, F. V. 2009. "Small, simple, cross-platform, free and fast C++ XML Parser." from http://www.applied-mathematics.net/tools/xmlParser. html.
2. Boussemart, F., F. Hemery, C. Lecoutre and L. Sais 2004. Boosting systematic search by weighting constraints. In Proceedings of the Sixteenth European Conference on Artificial Intelligence (ECAI-2004), 146-150. Valencia, Spain.
3. Dechter, R. and J. Pearl 1987. The cycle-cutset method for improving search performance in AI applications. In Proceedings of Third IEEE on AI Applications, 224-230. Orlando, Florida.
4. Epstein, S. L., E. C. Freuder and R. J. Wallace 2005. Learning to Support Constraint Programmers. Computational Intelligence 21(4): 337-371.
5. Epstein, S. L. and X. Li 2009a. Cluster Graphs as Abstractions for Constraint Satisfaction Problems. The Eighth Symposium on Abstraction, Reformulation and Approximation (SARA), Lake Arrowhead, California
6. Epstein, S. L. and X. Li 2009b. Search on Constraint Satisfaction Problems with Sparse Secondary Structure. International Symposium on Combinatorial Search, Lake Arrowhead, California
7. Gent, I., C. Jefferson, T. Kelsey, I. Lynce, I. Miguel, P. Nightingale, B. M. Smith and S. A. Tarim 2007. Search in the patience game 'Black Hole'. AI Communications 20(3): 211-226.
8. Gompert, J. and B. Y. Choueiry 2005. A Decomposition Techniques For CSPs Using Maximal Independent Sets And Its Integration With Local Search. In Proceedings of FLAIRS-2005, 167-174. Clearwater Beach, FL, AAAI Press.
9. Gyssens, M., P. G. Jeavons and D. A. Cohen 1994. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence 66(1): 57-89.
10. Hansen, P., N. Mladenovic and D. Urosevic 2004. Variable neighborhood search for the maximum clique. Discrete Applied Mathematics 145: 117-125.
11. Haralick, R. M. and G. L. Elliot 1980. Increasing Tree-Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence 14: 263-313.
12. Lecoutre, C. 2009. "Benchmarks - XML representation of CSP instances" from http://www.cril.univ-artois.fr/~lecoutre/benchmarks.html.
13. Lecoutre, C., F. Boussemart and F. Hemery 2004. Back-jump-based techniques versus conflict-directed heuristics. In Proceedings of ICTAI, 549-558.
14. Long, D. and M. Fox. 2002. "The Third International Planning Competition." from http://www.cs.cmu.edu/afs/cs/project/jair/pub/volume20/ long03a-html/node37.html.
15. Mackworth, A. K. and E. C. Freuder 1985. The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems. Artificial Intelligence 25(1):65-74.
16. Murphey, R. A., P. M. Pardalos and M. G. C. Resende 1999. Frequency assignment problems. Handbook of Combinatorial Optimization. Du, D. Z. and P. M. Pardalos, Kluwer Academic Publishers, Netherlands.
17. Roussel, O. and C. Lecoutre. 2008. "XCSP 2.1: a format to represent CSP/QCSP/WCSP instances." from http://www.cril.univ-artois.fr/~lecoutre/ benchmarks.html.
18. Sabin, D. and E. C. Freuder 1997. Understanding and Improving the MAC Algorithm. In Proceedings of Principles and Practice of Constraint Programming (CP 1997), 167-181. Linz, Austria, Springer Verlag.