RESEARCH ARTICLE

Case modifying of high-speed cutting database based on CSP and similarity theory

  • Kejun XIANG ,
  • Zhanqiang LIU ,
  • Xing AI
Expand
  • Information Management College, Shandong Economic University, Jinan 250014, China

Received date: 25 Jul 2008

Accepted date: 02 Sep 2008

Published date: 05 Mar 2009

Copyright

2014 Higher Education Press and Springer-Verlag Berlin Heidelberg

Abstract

By analyzing the reasoning of a high-speed cutting database system, a case modifying method is put forward. According to the variables’ difference of the solution part in a case, a constraint satisfaction problem (CSP) and similarity calculation are used to modify a case. The constraint relationship of discrete variables is described by establishing a rule knowledge base. The algorithm of CSP is used to solve the discrete variable constraint problem. On the basis of the high-speed cutting theory, a similarity calculation formula is deduced to calculate the consecutive variables. The CSP and similarity calculation are applied to case modifying, which is possible to automatically modify cases in the high-speed cutting database system.

Cite this article

Kejun XIANG , Zhanqiang LIU , Xing AI . Case modifying of high-speed cutting database based on CSP and similarity theory[J]. Frontiers of Mechanical Engineering, 2009 , 4(1) : 83 -87 . DOI: 10.1007/s11465-009-0014-0

Acknowledgements

This study was supported by the National Natural Science Foundation of China (Grant No. 50375089), Fok Ying Tung Education Foundation (No. 91054) and the Program for New Century Excellent Talents in University (NCET-04-0629).
1
Deng Jian xin, Zhao Jun. Numerical Control Cutting Tool Material Handbook. Beijing: Mechanical Industry Press, 2005 (in Chinese)

2
Huang Rulin. Concise Handbook for Metal Cutting. Beijing: Chemical Industry Press, 2004 (in Chinese)

3
Wang Qinhui, Chen Enhong, Wang Xufa. Research and development of distributed constraint satisfaction problems. Journal of Software, 2006, 17(10): 2029–2039 (in Chinese)

DOI

4
Jiang Yingxin, Sun Jigui. Solving constraint satisfaction problems and brief introduction to ILOG SOLVER system. Journal of Jilin University (Science Edition), 2002, 40(1): 53–60 (in Chinese)

5
Jiang Bentie, Bi Shifei. A class of constraint satisfaction problems and its algorithms. Journal of Northeastern University (Natural Science), 2003, 24(12): 1169–1172 (in Chinese)

6
Yao Xianghua, Shi Ren. Constraint programming and application in product configurators. Computer Applications and Software, 2004, 21(3): 36–37 (in Chinese)

7
Li Wei, Zhang Mengqing, Liu Guangfu. Product configuration method based on constraint satisfaction problem. Transactions of the Chinese Society for Agricultural Machinery, 2005, 36(7): 126–130(in Chinese)

8
Yi C P. Determination of manufacturability and machining parameters based on a new classification of machinability. West Lafayette: Purdue University, 1989

9
Zhang Tiemao. Metal Cutting Science. Beijing: Weapon Industry Press, 1991 (in Chinese)

10
Lu Shouli. Similarity Theory and Application on the Metal Forming. Beijing: Metallurgical Industry Press, 1995 (in Chinese)

Outlines

/