A Tool for Visualizing the Behavior of Fuzzy Constraint Satisfaction Solvers
Takuto Yanagida, Masahito Kurihara, and Hidetoshi Nonaka
Graduate School of Information Science and Technology, Hokkaido University, Kita 14, Nishi 9, Kita-ku, Sapporo 060-0814, Japan
-  Z. Ruttkay, “Fuzzy Constraint Satisfaction,” In Proc. of the 3rd IEEE Conf. on Fuzzy Systems, Vol.2, pp. 1263-1268, Orlando, FL, USA, 1994.
-  T. Yanagida and H. Nonaka, “Flexible Widget Layout Formulated as Fuzzy Constraint Satisfaction Problem,” In K. Nakamatsu, G. Phillips-Wren, L. C. Jain, and R. J. Howlett, editors, Proc. of the 1st KES Int. Symposium on Intelligent Decision Technologies (KES IDT 2009), New Advances in Intelligent Decision Technologies, pp. 73-83, Himeji, Japan, Springer, April 2009.
-  T. Yanagida, Y. Sudo, and H. Nonaka, “Flexible Widget Layout Based on Fuzzy Constraint Satisfaction,” J. of Japan Society for Fuzzy Theory and Intelligent Informatics, Vol.20, No.6, pp. 840-849, December 2008. (in Japanese)
-  S. Sadaoui, M. Mouhoub, and X. Li, “An OCL-Based CSP Specification and Solving Tool,” In N. T. Nguyen and R. Katarzyniak, editors, New Challenges in Applied Intelligence Technologies, Vol.134 of Studies in Computational Intelligence, pp. 235-244, Springer, 2008.
-  L. Grangier. “JCLEditor – A Graphical CSP Solver Based on JCL,” on the Web, 2005.
Available at http://liawww.epfl.ch/JCL/
-  T. Yanagida. “Download Site for Anvics,” 2009.
Available at http://kussharo.complex.eng.hokudai.ac.jp/˜takty/demo/anvics.en.html
-  T. Yanagida and Y. Sudo. “Stlics: A Java Library for Fuzzy Constraint Satisfaction Problems,” 2009.
Available at http://kussharo.complex.eng.hokudai.ac.jp/˜takty/interest/stlics.en.html
-  P. Morris, “The Breakout Method for Escaping From Local Minima,” In Proc. of the 11th National Conf. on Artificial Intelligence (AAAI-93), pp. 40-45, Washington, DC, USA, AAAI Press/The MIT Press, 1993.
-  R. M. Haralick and G. L. Elliott, “Increasing Tree Search Efficiency for Constraint Satisfaction Problems,” Artificial Intelligence, Vol.14, No.3, pp. 263-313, 1980.
-  A. J. Davenport, E. P. K. Tsang, C. J. Wang, and K. Zhu, “GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement,” In Proc. of the 12th National Conf. on Artificial Intelligence (AAAI ’94), pp. 325-330, 1994.
-  G. Verfaillie and T. Schiex, “Solution Reuse in Dynamic Constraint Satisfaction Problems,” In Proc. of the 12th National Conf. on Artificial Intelligence, pp. 307-312, Seattle, WA, USA, AAAI Press, 1994.
-  I. Miguel and Q. Shen, “Extending FCSP to Support Dynamically Changing Problems,” In Proc. of the 8th IEEE Int. Conf. on Fuzzy Systems (FUZZ-IEEE ’99), Vol.3, pp. 1615-1620, Seoul, Korea, 1999.
-  J. H. Y. Wong and H. Leung, “Extending GENET to Solve Fuzzy Constraint Satisfaction Problems,” the 15th National Conf. on Artificial Intelligence/10th Conf. on Innovative Applications of Artificial Intelligence, (AAAI ’98/IAAI ’98), pp. 380-385, Menlo Park, CA, USA, 1998.
-  Y. Sudo and M. Kurihara, “Spread-Repair-Shrink: A Hybrid Algorithm for Solving Fuzzy Constraint Satisfaction Problems,” In Proc. of the 2006 IEEE World Congress on Computational Intelligence/the 2006 IEEE Int. Conf. on Fuzzy Systems (WCCI 2006/FUZZ-IEEE 2006), pp. 2127-2133, Vancouver, BC, Canada, 2006.
-  T. M. J. Fruchterman and E. M. Reingold, “Graph Drawing by Force-Directed Placement,” Software – Practice & Experience, Vol.21, No.11, pp. 1129-1164, Nov. 1991.
This article is published under a Creative Commons Attribution-NoDerivatives 4.0 Internationa License.