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.
京公网安备 11010502051620号
